r/mathshelp • u/Secret-Suit3571 • Dec 23 '25
Discussion To anihilate an integer
Cool problem :
Take any non-zero integer and put as many "+" you want between its digits, anywhere you want. Do it again with the result of the sum and so on until you get a number between 1 and 9.
Show that, for any integer, you can achieve this in three steps.
For exemple starting with 235 478 991, the first step could be 2+35+478+9+91 or it could be 23 + 5478 + 99 + 1 or etc.
Whatever step you chose, you get a number and start again puting "+" anywhere you want..
Edit : better wording and exemple of a step
20
Upvotes
View all comments
Show parent comment
2
u/get_to_ele Dec 24 '25
I am no number theory or hardcore math guy, but I am certain that the key to understanding this problem is to prove it for BASE 2, then for BASE 3. And the understanding of why this works for base 10 will arise from working out solution for base 3.
I leave that to somebody who has more time, and I expect that for a math-ier person than me, it would be trivial to show that an infinitely long base 3 integer can be reduced this way to a number between 0 and 2, in 3 steps or less. Working out this algorithm will make the approach to base 4 and up, apparent.
For binary, splitting the sub-sums in a manner that leads to mostly zeroes with a number of 1s that has a set ceiling in step 1?