Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

In the same thread Tao commented 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.



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.


the primes bigger than ~sqrt(t) have an "obviously" best matching so it's not too surprising.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: