> Ah, GPT is right, there is a fatal sign error in the way I tried to handle small primes. There were no obvious fixes, so I ended up going back to Hildebrand's paper to see how he handled small primes, and it turned out that he could do it using a neat inequality ρ(u1)ρ(u2)≥ρ(u1u2) for the Dickman function (a consequence of the log-concavity of this function). Using this, and implementing the previous simplifications, I now have a repaired argument. TerenceTao
Fwiw, wiki Section 2(d): https://github.com/teorth/erdosproblems/wiki/AI-contribution...
Picture him as the star player on a basketball team. He may be the strongest player on the court, but he's still playing the same game as everyone around him.
Indeed, Tao himself has written criticism of the "cult of genius":
https://terrytao.wordpress.com/career-advice/does-one-have-t...
* I delude myself