|
|
| laziness, impatience, and hubris | |
| PerlMonks |
Re^3: Challenge: Chasing Knuth's Conjectureby tall_man (Parson) |
| on Mar 29, 2005 at 15:07 UTC ( [id://443242]=note: print w/replies, xml ) | Need Help?? |
This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.
I computed an answer for 38 with my modified version of hv's program, using logs. The result is:
I confirmed this answer with Math::Pari, and it is correct. The highest factorial required is 1861.
In Section
Meditations
|
|
||||||||||||||||||||||||||||