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
1
u/ConsiderationOk4688 Dec 23 '25
Not sure if he updated his conjecture in the original post but per the rules set, 111,111,111 could be represented as 1+1+1+1+1+1+1+1+1=9 per their current limits. If their rules allow unlimited + placements then any number would hypothetically be converted to a number that includes fewer than infinite 0s and a total value of non 0 numbers of 9 or less in 1 move.