Why couldn't we reverse engineer this process to get an infinite chain going upwards?
-
-
-
I don't think you can go upward: the probability that the number is decomposable in factors smaller or equal to 9 is quite low.
- 1 more reply
New conversation -
-
-
wolfram suggests a 2001 result that 11 *is* the maximum (for base 10)?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I haven't put too much thought into it, but I'd say that the successive steps decrease to their final 1-digit result too quickly
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
function multiplicativePersistence(a,b){for(var d=0,f=a.toString(b);console.log(d+":"+f),!(1>=f.length);)f=[...f].map(h=>parseInt(h,b)).reduce((h,i)=>h*i,1).toString(b),d++;return d} multiplicativePersistence(277777788888899,10);
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
What is presistence in a number? Can someone explain?
-
You multiply all the digits together, and start again with the result. Persistence is the number of times you have to do it until you reach 0.
- 3 more replies
New conversation -
-
-
The little number that could.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.