Verified65% confidenceFactExact time
Terence Tao collaborated with Ben Green to prove the Green-Tao theorem, which states that the prime numbers contain arbitrarily long arithmetic progressions.
3
Sources
65%
Confidence
Long-term
Relevance
7/13/2026
First Seen
Sources
Terrence Tao on AI Coding Agents: How a Mathematician Sees the Transformation of App Development
hackernewshackernews7/12/2026
Related Claims
VerifiedAt the end of 2023, Terence Tao and collaborators used Lean and LLM assistance to prove an important special case of the polynomial Freiman-Ruzsa conjecture70% similarUnverifiedThe classical theorem by Blumer et al. proves that in the realizable case, sample complexity is linearly related to VC dimension d, i.e., samples on the order of Θ(d/ε) are sufficient to guarantee a generalization error of ε.69% similarUnverifiedIn 2005, Goldston, Pintz, and Yıldırım used sieve methods to obtain the GPY theorem, proving that there exist infinitely many prime pairs with a gap smaller than C·lnP (where C can be arbitrarily small).68% similarUnverifiedIn 2019, Griffin, Ono, Rolen, and Zagier published work linking the Riemann Hypothesis to the hyperbolicity of Jensen polynomials, proving that Jensen polynomials associated with the Riemann ξ function are hyperbolic for sufficiently large degrees.67% similarUnverifiedThe Taniyama–Shimura conjecture, which was the core tool Andrew Wiles used to prove Fermat's Last Theorem, is a special case of the Langlands program.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/500739API
curl https://kongchang.com/api/v1/knowledge/claims/500739MCP
get_claim(id=500739)