"sssssssssfsssssssssssfssssssfssssssfssssssfssssssssssfssssssssfssssss +ssfssssssfssssssfssssfssssssssfsfssfssssssfsssssfssfsfssff"
I confirmed this answer with Math::Pari, and it is correct. The highest factorial required is 1861.
In reply to Re^3: Challenge: Chasing Knuth's Conjecture
by tall_man
in thread Challenge: Chasing Knuth's Conjecture
by kvale
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |