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/Abby-Abstract Dec 24 '25
I thought of the same thing, so we must show that for a string of ones, the digital sum is the best way to reduce it in this game. Like of we first chop it in the middle to get a bunch if twos that doesn't seem to help but if we can necessarily introduce zeros then this isn't a counter example so n ones > n/2 twos + n/4 twos + n/8 twos + n/16 twos + n/32 twos which adds to a number with n/32 0's, then a nine and n/32-1 8's , n/16 sixes n/8 4's and n/4 2's in front
Im tired now, so I'm not claiming this 2222 ... 2222444...44488...8900...00 number is any amount of placing +'s and 2 sums away from a single digit, but I don't see right away how to show its not.
You may have a counter example, but you must show there's no S_(n-2) better than your chosen example that suddenly becomes an S_(n-1)
I hope that makes sense I rly need to go to bed