10,000,000,000,000 This would be the number of permutations on a 13-position combination lock, for example. In the first position there would be one number out of ten possibilities (0-9). Next to any one number there would be any one of ten again. So in the first two positions there are 10 x 10 possible combinations i.e. 10^2 (= 100). In the third position there would be 10 more possibilities against the previous 100 possibilities, i.e. 100 x 10, that is: 10^3 (= 1000). So, for a thirteen digit lock, there would be 10^13 possibilities, which is 1 followed by thirteen zeros, as shown above. Of course, if 'numbers' with leading digits e.g. 0 000 087 654 321, and all zeros, are not counted as valid 'numbers' then there are 13 less possibilities. i.e. There are only 9,999,999,999,987 possible ' numbers'.
There are 720 combinations if you use each of the digits only once per combination.
2
120 combinations using each digit once per combination. There are 625 combinations if you can repeat the digits.
90000
9
You can select 12 numbers for the first digit, 11 numbers for the second digit, and 10 numbers for the third digit; so 12*11*10 = 1320 sets of 3 numbers can be made out of 12 different numbers.
Just think of how many possibilities you have for each digit. 10x9x8x7x6x5x4x3x2 or 10 factorial is 3 628 800.
* 10^10 * = ten billion (US), or * ten thousand million (UK)
6
66
10,000
15
999-111=888 888 3 digit numbers can be made with numbers between 1 - 9
Just the one. The order of the numbers does not matter in a combination so that 123456 is the same combination as 245136.
1,956 different numbers can be made from 6 digits. You can calculate this by using the permutation function in a summation function, like this: Σ6k=1 6Pk = 6P1+6P2+...+6P5+6P6 What this does is calculate how many 1 digit numbers you can make from 6 digits, then how many 2 digit numbers can be made from 6 digits and adds the amounts together, then calculates how many 3 digit numbers can be made and adds that on as well etc.
There are 12 such numbers.
Six.