I tried a little, and do not suspect that there will be divergent iteration paths. Your n can get very large, but at some point S will occur. For instance: 40062 == iterates through to => 976200916319385723503493316038614249639873240694051292718856754096211045630423774741352023551475091793731140062197965609358688923382818769366925026993506948953505871733381059899567689455415900405062511604318167475296027905546290725360596882056439591659161763891764302469992483666812846548653571820681381743276092122748897102914875593020174786488445372054822379913313001077048773640353934213252658674841283250428789972853918339756834075468433109966160362533771653442514407855024004136237902745086814358284484786175724944332404665912118262072079671036143560540231213912882068250165636506591856408109566983761557968901249105519412776586973901486640896064429047416946301622571621428728095854627052526635009452457269789871520345691671478595288627128029299217161601855041604699680636342927382357978889127784616681490849054923308228996173964828833611399177303586160304340409389918797526573671184327474658477413496603622032004296218138753630208 Cheers, Frank On Sat, Jan 4, 2020 at 8:40 AM Éric Angelini <eric.angelini@skynet.be> wrote:
Hello Math-Fun, Start with n, then let n=2n and iterate. When the string n reappears, stop the iterations and restart the procedure with the smallest integer not yet in S.
S = 1,2,4,8,16,stop,3,6,12,24,48,96,192,384,stop,5,10,20,40,80,160,320,640,1280,2560,stop,7,14,28,56,112,224,448,896,1792,stop,9,18,36,72,144,288,576,1152,2304,4608,9216,stop,11,22,44,88,...
Question: is there a new n that will restart S at some point and _not_ lead to a new stop? Best, É.
à+ É. Catapulté de mon aPhone
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun