4 ms·

Tao agrees with you: https://terrytao.wordpress.com/2025/03/26/decomposing-a-factorial-into-large-factors/#comment-687607 https://terrytao.wordpress.com/2025/03

• btilly 2y ago
  In the same thread Tao commented https://terrytao.wordpress.com/2025/03/26/decomposing-a-factorial-into-large-factors/#comment-687574 https://terrytao.wordpress.com/2025/03/26/decomposing-a-fact... which shows work from Andrew Sutherland that got the 100k limit after about a day. As impressed as I am with this solution, it didn't get to be the first to solve the problem.
  • gus_massa 2y ago
    I did't notice it. It's using a different method, but it's interesting that it also uses the primes in N! ordered from bigger to smaller.
    • adgjlsfhk1 2y ago
      the primes bigger than ~sqrt(t) have an "obviously" best matching so it's not too surprising.