How many different positive three-digit integers can be formed using only the digits {2, 3, 5, 5, 6, 6, 7} in the set if no digit may be used more times than it appears in the given set of available digits?
235 ( 6 ) , 236 ( 6 ) , 237 ( 6 ) , 255 ( 3 ) , 256 ( 6 ) , 257 ( 6 ) , 266 ( 3 ) , 267 ( 6 ) , 355 ( 3 ) , 356 ( 6 ) , 357 ( 6 ) , 366 ( 3 ) , 367 ( 6 ) , 556 ( 3 ) , 557 ( 3 ) , 566 ( 3 ) , 567 ( 6 ) , 667 ( 3 ) , >>Total combinations = 18 [The numbers in brackets are the number of permutations of each combination]
>>Total number of permutations = 84
