1/ This isn't the *largest known* factorian. It's the *largest* factorian, period. It's very easy to establish a finite upper bound on any factorian, then check all numbers less than the bound.
-
-
-
2/ Here's a simple proof that any factorian must be less than 200,000. (a) Since 9! * 8 = 2,903,040 has only 7 digits (and 9! * N has less than N digits for all N > 8), any factorion must be less than or equal to 9,999,999.
- 5 more replies
New conversation -
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
import math i = 0 while True: sum_of_facs = sum([math.factorial(int(d)) for d in str(i)]) if sum_of_facs == i: print(i) i += 1
-
1 2 145 40585
End of conversation
New conversation -
-
-
Wow, I mean W! + o! + w!
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Wow, nothing more since 1964 what with all the new computing capacity. Is there a good theorem about these?
-
no its just that there are NO more factorions. There are only 4 numbers with that property...
End of conversation
New conversation -
-
-
Doesn't everyone know that ? tut... ;-)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
niiice
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.