The answer will depend on how many digits there are in each of the 30 numbers. If the 30 numbers are all 6-digit numbers then the answer is NONE! If the 30 numbers are the first 30 counting numbers then there are 126 combinations of five 1-digit numbers, 1764 combinations of three 1-digit numbers and one 2-digit number, and 1710 combinations of one 1-digit number and two 2-digit numbers. That makes a total of 3600 5-digit combinations.
7
There are 840 4-digit combinations without repeating any digit in the combinations.
It is: 9C7 = 36
This question needs clarificatioh. There are 4 one digit number combinations, 16 two digit combinations, ... 4 raised to the n power for n digit combinations.
The answer will depend on how many digits there are in each of the 30 numbers. If the 30 numbers are all 6-digit numbers then the answer is NONE! If the 30 numbers are the first 30 counting numbers then there are 126 combinations of five 1-digit numbers, 1764 combinations of three 1-digit numbers and one 2-digit number, and 1710 combinations of one 1-digit number and two 2-digit numbers. That makes a total of 3600 5-digit combinations.
7
There are 840 4-digit combinations without repeating any digit in the combinations.
There are 9 1-digit numbers and 16-2 digit numbers. So a 5 digit combination is obtained as:Five 1-digit numbers and no 2-digit numbers: 126 combinationsThree 1-digit numbers and one 2-digit number: 1344 combinationsOne 1-digit numbers and two 2-digit numbers: 1080 combinationsThat makes a total of 2550 combinations. This scheme does not differentiate between {13, 24, 5} and {1, 2, 3, 4, 5}. Adjusting for that would complicate the calculation considerably and reduce the number of combinations.
There are 167960 9 digits combinations between numbers 1 and 20.
There are 9C2 = 9*8/(2*1) = 36 2-digit combinations.
-8
120 combinations using each digit once per combination. There are 625 combinations if you can repeat the digits.
It is: 9C7 = 36
10,000
15
50 to the 5th power.156,250 combination.