[Math] the largest positive integer such that each digit is at least the sum of all the digits to its left

elementary-number-theory

What is the largest positive integer such that each digit is at least the sum of all the digits to its left?

Can someone point me in the right direction with this problem? Don't give me the answer, please. I don't know where to start, the wording confuses me.

Best Answer

The largest such number is

$11259$

(i) If the first digit were $\ge 2$, we could profitably replace it by $11$. So the first digit is $1$.

(ii) If the second digit were $\ge 2$, then the next two digits would be at least $3$ and $6$, ruling out a 5-digit number.

(iii) If the third digit were $\ge 3$, then the next digit would be at least $5$, ruling out a 5-digit number.

Answer:

A 6-digit number is clearly impossible: minimum digits are $11248$. So $11259$ is the best we can do.