The answer is 1.
The smallest prime is 2 and the greatest prime (of however many digits) must be odd. The remainder of ANY odd number when divided by 2 must be 1.
0.5714
999 - 100 = 899
I would think 100 is the answer.
By the sum of its digits: 10. By each of its individual digits: 11.
799
0.5714
The smallest number that someone can get using the 91764 digits is 14679. The secret is to arrange the digits from the least number to their greatest number.
9876 and 1234
15
I think you're wanting a number of two digits, one of which is 3, that when divided by 7 gives a quotient and a remainder of 1 and when that quotient is divided by 2 it gives a remainder of 1: Answer: 36 36 ÷ 7 = 5 r 1 5 ÷ 2 = 2 r 1 If you want the number to be such that if it is divided by 7 the remainder is 1 and if it is divided by 2 the remainder is 1, then: Answer: 43 43 ÷ 7 = 6 r 1 43 ÷ 2 = 21 r 1
0.5714
The greatest 9-digit number using three different digits is 999888777, formed by using the digits 9, 8, and 7 in descending order. The smallest 9-digit number using three different digits is 100000000, created with the digits 1, 0, and 0. This arrangement ensures that the number starts with 1, followed by the zeros to maintain the smallest value.