Quite appropriately, the word hippopotomonstrosesquipedalianism is used to describe words that are enormously long. In how many ways can its letters be arranged? Show In the $33$ letters of the word:
resulting in $\displaystyle{\frac{33!}{5! (4!)^3 2^5}}$ possible ways to arrange the letters. For the curious, the above expression evaluates to $163576434454494269015808000000$. R > counts = c(1,4,4,5,2,2,2,4,1,2,1,1,1,2,1) # h i p o t m n s r e q u d a l > factorial(sum(counts))/prod(factorial(counts)) There are five odd digits {1,3,5,7,9} so our numbers will be made using only these digits. This is the same number of possibilities as if you had a base 5 number system where the allowed digits are {0,1,2,3,4}. For a 1 digit base-5, there are 5 possibilities, for a two digit base-5 there are 5² = 25 possibilities, so for a 4-digit, there are 5^4 = 625possible. This is the same number you will have with only using odd digits. How many 4TAGS. How many four-digit odd numbers do not use any digit more than once? The answer is C, 2240.
How many 4As stated in the title above: How many 4-digit odd numbers can be formed using the digits 0, 1, 2 and 3 only if the repetition of the digit is not allowed? I already have the answer for this and it is 8.
How many 4=9×8×7×6×5! 5! =9×8×7×6=3024. Q.
How many 4The thousands place in a 4-digit number cannot be 0. The smallest 4-digit number is 1000 and the greatest 4-digit number is 9999. There are 9000 four-digit numbers in all.
|