I guess the expected answer is 97210.
Using factorials and exponents very much greater number can be obtained. For example, 97210 is a number with 6880 digits. And that is without using factorials.
22412
Assuming that 2356 is a different number to 2365, then: 1st digit can be one of four digits (2356) For each of these 4 first digits, there are 3 of those digits, plus the zero, meaning 4 possible digits for the 2nd digit For each of those first two digits, there is a choice of 3 digits for the 3rd digit For each of those first 3 digits, there is a choice of 2 digits for the 4tj digit. Thus there are 4 x 4 x 3 x 2 = 96 different possible 4 digit numbers that do not stat with 0 FM the digits 02356.
The greatest number that can be made by rearranging the digits is 75431 but, of course, 75314 is much larger and 75 to the power 314 is larger still.The greatest number that can be made by rearranging the digits is 75431 but, of course, 75314 is much larger and 75 to the power 314 is larger still.The greatest number that can be made by rearranging the digits is 75431 but, of course, 75314 is much larger and 75 to the power 314 is larger still.The greatest number that can be made by rearranging the digits is 75431 but, of course, 75314 is much larger and 75 to the power 314 is larger still.
The number of strings of four decimal digits that have exactly three digits which are nine is the number of ways to choose three places to choose the nines multiplied by the number of possibilities for the other digits (because you can put all of the possibilities in an array so that each column has a different way of arranging the nines and that each row has a different set of other digits (because they do not affect each other)). The number of ways to choose the three places to choose the nines is the same as the number of ways of choosing 4-3=1 spot for there not to be a nine. The number of ways of choosing 1 spot where there are 4 spots is 4 (the first, the second, the third, or the fourth). Since there are 9 digits that are not nine, the number of choices for the other digits is 9 (since there is only one digit). Thus, there are 4*9=36 strings of four decimal digits that have exactly three digits which are nine.
This is a question of permutations; the answer is equal to the factorial of 5 (number of digits) divided by the factorial of 3 (number used in each selection), written 5! / 3!. This equals 120 / 6, or 20 ways.
If the digits are only used once, each, the largest possible number would be 97,531
write the largest number you can make using each of the digits 7,1,0,2, and 9 just once
Assign the digits from left to right, using the largest possible digit in each case. Don't forget to reserve an even digit for the last position.
4^5827 which is approximately 1.597973114x103508
22412
87,542 is.
The smallest number is 5,789. The largest is 98,750. The difference is 92,961.
75431
That depends a lot on how often you may repeat each digit, and what operations are allowed. If you just want to write a four-digit number, using each digit once, start by writing the largest digit on the left, then continue with the second-largest, etc.
396510
The largest integer that can be formed by using the digits only once each and simply arranging them in some order is 8740. Otherwise, using exponents, much larger numbers are possible.
It could be: 54317