How many different positive three-digit integers can be formed using only the digits in the set {2, 3, 5, 5, 5, 6, 6, 6} if no digit may be used more times than it appears in the given set of available digits?
235 ( 6 ) , 236 ( 6 ) , 255 ( 3 ) , 256 ( 6 ) , 266 ( 3 ) , 355 ( 3 ) , 356 ( 6 ) , 366 ( 3 ) , 555 ( 1 ) , 556 ( 3 ) , 566 ( 3 ) , 666 ( 1 ) , >>Total combinations = 12
>>Totals in parentheses = 44 permutations.
