I would not like a list all possible 4 digit combination using 0-9.
i would like a list all possible 4 digit combination using 0-9
There are 4 possible numbers if the digits are not repeated; 18 if they are. Those are 3-digit numbers, assuming that zero would not be a leading digit. If zero is allowed for a leading digit, then you can have 6 for the non repeated, and 27 if repetition.
Order does matter in this case so you need to use the formula for a Permutation with repetition allowed. This would be n^r where n=6 different numbers and r=6 possible places for each number to go when forming the full 6-digit number. 6^6 = 46,656 possible digits
A palindrome reads the same forward and in reverse. This tells me that at leastthe first digit and the last digit must be the same. So it's not possible to have a6-digit palindrome "with no same digits".The largest 6-digit palindrome, with just enough repetition of digits to make it apalindrome and no more, would be 987,789 .
12345 but if you can use a decimal, then 0.1234 would be the smallest possible number.
i would like a list all possible 4 digit combination using 0-9
I would have to say 10,000 possible combinations. (0000, 0001, 0002 through 9998, 9999)
For this type of "the largest number which..." questions, you need to advance from left to right, using the largest possible digit in each case. For the first two digits, that would be 9, for the third digit (the right-most digit), the largest digit which will make this possible is an 8.
There are 4 possible numbers if the digits are not repeated; 18 if they are. Those are 3-digit numbers, assuming that zero would not be a leading digit. If zero is allowed for a leading digit, then you can have 6 for the non repeated, and 27 if repetition.
0
Technically, that is not possible. A digit is another word for a number and it would be impossible for a single number to contain ten numbers.
Starting from the left, use the smallest possible digit for each position. Note that only four digits are given, so we can assume that we are free to choose the fifth digit. The first digit can't be "0", so use the next-smallest digit: "0". The next digits would be "169". For the final digit, add an additional zero.
14
12If you were using base 4 then a single digit number could have 4 possible values:0,1,2 & 3. To represent the next number (4) we would have to introduce a second digit to the left of the first (i.e. a 1) and reset the first digit back to 0 again (i.e. 10). Then 5 would be 11 and 6 would be 12.Another way to look at it is that in base 4 the number 12 means:(2 * 40) + (1 * 41) = 2 + 4 = 6.
it would be 0000.01
Without restrictions, it was would numbers 000-000-0000 through 999-999-9999. So that would be 9,999,999,999 + 1 = 10 billion different 10-digit phone numbers. Ex: If there existed single digit phone numbers, there would be 10, because the digits are 0 through 9. If there existed only double digit phone numbers, then it would be 00 through 99 which would be 100 total two-digit numbers. Therefore the total possible combinations for an X digit phone number would be: 10^X
If each digit has 10 different values i.e. 0,1,2,3,4,5,6,7,8,9 that makes it 10 * 10 * 10 possible combinations All the possible combinations would run from 0 0 0 to 9 9 9 so take your pick from 1000 :) its easy to just start from 000 and turn the last digit till you get to 009 trying to flick the lock at every turn. then change the digit to 010 and repeat until you reach 099 and do the same with the 1th digit making it 100... its long winded but always works when I've done it..sods law usually kicks in and puts the actual combination towards the end. shouldn't take longer than ten minutes - Jason MEng