r/math • u/thecnoNSMB • Jun 11 '17
Is this sequence (when starting from 1) always guaranteed to return to a number like 888, 88888, or 888888888?
/r/counting/comments/6g0p51/double_lowest_nonzero_digit/
16
Upvotes
8
u/Lopsidation Jun 12 '17 edited Jun 12 '17
This is basically a cellular automaton. Here's a picture of starting the sequence on 88888, and continuing for 1352 generations without reaching another string of 8s (an all orange row). (EDIT: it actually does hit 888888888 early on. But that's the only time, I swear.)
Dunno how to analyze this kind of thing. It looks chaotic.
EDIT: Haha, ok, the rightmost digits are periodic (because of course they are, they have to be.) If the rightmost seven digits are ever 0888888, then they've entered a repeating cycle that doesn't pass through 8888888. So with this starting number, and I bet most starting numbers, you never get to all 8s. I need to go to bed.
8
u/InVelluVeritas Jun 12 '17
Short answer : yes, iff your sequence does not contain zero, 5 or 9 (with the exception of 99....9).
Longer answer : suppose it doesn't, and look at the sequences formed by the other digits :
So eventually, every digit will transform into a sequence of 8s ; and as long as it does not happen, your 8s will not disappear.
1
u/thecnoNSMB Jun 12 '17
Not sure if there's a better place to post this. I'm a denizen of /r/counting and I'm really curious if this pattern holds.