999.
Think about it 001 002 003.....etc.
It just goes in order up to the 999
plus 000 makes 1,000
To calculate an ordered sequence (a permutation), you take the number of options for the first choice, times the number of options for the second choice, times the number of options for the third choice (etc).
In this case, you have 10 options for each digit (0 thru 9), so: 10 x 10 x10 = 1,000
The first digit can be 0 through 9, ten possibilities. Having selected the first digit, you have 9 digits to pick from the second digit. Having selected the second digit, you have 8 digits to pick from the third digit. Hence total possibilities = 10 x 9 x 8 = 720
If the digits can be used more than once, then 900. If not, then 648.
5 x 10 x 5 = 250 different numbers, assuming there is no limit to each digits' use.
1 set
99997
The first digit can be 0 through 9, ten possibilities. Having selected the first digit, you have 9 digits to pick from the second digit. Having selected the second digit, you have 8 digits to pick from the third digit. Hence total possibilities = 10 x 9 x 8 = 720
The number of 4 digit codes, using different digits, is 10*9*8*7 = 5040. However, computer passwords can, usually, have repeated digits and, if that is allowed, you can have 104 = 10000 codes.
10,000
5040
36
5040 different 4 digit numbers can be formed with the digits 123456789. This is assuming that no digits are repeated with each combination.
There are the digits 1 through 9 for the first digit. Then, we have 0 through 9 for the second digit - excluding the first digit. For the third digit, we have 0 through 9 excluding the two previous digits
If the digits can be used more than once, then 900. If not, then 648.
24
500
27 three digit numbers from the digits 3, 5, 7 including repetitions.
1339