Alex has before him some positive whole numbers, each consisting of a single digit, which may be repeated. The digit is different for each number, and the number of times it is repeated is also different for each number.
The sum of Alex's numbers is a number in which each digit is larger than the digit on its left, and it is the largest number for which this is possible, given the constraints described above.
What is the sum of Alex's numbers?
Note: Adapted from Enigma number:1765 which appeared on "New Scientist" in 2013.
Determine all possible pair(s) (M, N) of positive integers such that:
N[√N] = MM-1
Prove that these are the only possible pair(s) that exist.
Note: [x] denotes the greatest integer ≤ x.
Latest: 