{"id":225928,"date":"2026-05-22T22:34:45","date_gmt":"2026-05-22T22:34:45","guid":{"rendered":"https:\/\/teknomers.com\/en\/ai-outperforms-experts-on-80-year-old-mathematical-problem\/"},"modified":"2026-05-22T22:34:46","modified_gmt":"2026-05-22T22:34:46","slug":"ai-outperforms-experts-on-80-year-old-mathematical-problem","status":"publish","type":"post","link":"https:\/\/teknomers.com\/en\/ai-outperforms-experts-on-80-year-old-mathematical-problem\/","title":{"rendered":"AI Outperforms Experts on 80-Year-Old Mathematical Problem"},"content":{"rendered":"\n
\n

In 1946, Hungarian mathematician Paul Erd\u0151s posed a deceptively simple question: if you place ( n ) points in the plane, how many pairs can exist at an exact distance of 1 from each other? This intriguing dilemma, known as the unit distance problem in the plane<\/strong>, has captivated mathematicians in geometry for over 80 years.<\/p>\n

Understanding the Problem<\/h2>\n

In attempts to solve the unit distance problem, researchers often resorted to using a square grid as their foundational model. Initially, they discovered that the number of point pairs at unit distance grows at least as quickly as ( n^{(1 + C\/loglog(n))} ), where ( C ) is a constant reflecting the efficiency of specific configurations compared to a standard grid. While this might sound complex, let\u2019s break it down further.<\/p>\n

A basic square grid yields approximately ( 2n ) pairs of points at unit distance. However, mathematicians realized that if they adapted the grid\u2014by utilizing a scale factor characterized by numerous divisors (a property known in number theory)\u2014they could generate more pairs that fulfilled the distance requirement. The constant ( C ) plays a crucial role in quantifying this enhancement, which is pivotal for grasping the problem.<\/p>\n

AI Breakthrough: Defying Long-held Conclusions<\/h2>\n

The question posed by Erd\u0151s, while straightforward in its wording, remains extraordinarily complex to resolve. Historical attempts suggested that pairs of points could have an upper bound of approximately ( n^{(1+o(1))} ), indicating only a slight increase over ( n ). This conjecture has now been challenged and refuted\u2014not by a contemporary mathematician, but by a general-purpose inference model developed internally at OpenAI.<\/p>\n

\n
\n
\n
<\/div>\n<\/p><\/div>\n<\/p><\/div>\n<\/div>\n
\n
\n

This milestone was achieved by a general-purpose inference model that OpenAI was testing internally.<\/p>\n<\/p><\/div>\n<\/div>\n

The Significance of the AI’s Findings<\/h2>\n

This AI has revealed an infinite array of configurations that demonstrate polynomial improvement. Specifically, it has shown that it\u2019s possible to create arrangements with at least ( n^{(1+delta)} ) pairs at unit distance, where ( delta ) is a positive constant that persists as ( n ) increases. Following this revelation, OpenAI enlisted Princeton mathematicians to evaluate the AI’s findings, and their outcome was decisive: the AI was correct.<\/p>\n

This success marks the first substantive advancement regarding the lower bound of the unit distance problem in eight decades. Interestingly, the AI employed advanced engineering tools from algebraic number theory<\/strong> to tackle what was considered merely an elementary geometry problem. Esteemed mathematicians like Fields Medalist Tim Gowers and number theorist Arul Shankar have lauded this AI achievement as a major milestone, opening pathways for further investigation into other mathematical challenges.<\/p>\n

In summary, the collaboration of human intellect and modern AI is reshaping the landscape of mathematical problem-solving. This breakthrough not only challenges traditional views but also highlights the potential of AI as a valuable ally in mathematical research.<\/p>\n

Image | Jeswin Thomas<\/a><\/p>\n

For more in-depth information, visit OpenAI’s official page<\/a>.<\/p>\n

In Xataka, it has been noted that these challenging issues continue to perplex mathematicians, yet the innovative solutions brought forth by advancements in AI may herald a new era of mathematical exploration and discovery.<\/p>\n<\/div>\n


\n
General News – 2<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

In 1946, Hungarian mathematician Paul Erd\u0151s posed a deceptively simple question: if you place ( n ) points in the plane, how many pairs can exist at an exact distance of 1 from each other? This intriguing dilemma, known as the unit distance problem in the plane, has captivated mathematicians in geometry for over 80 […]<\/p>\n","protected":false},"author":1,"featured_media":225929,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[36399],"tags":[18599,1911,35956,26855,1142],"class_list":["post-225928","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-technology","tag-80yearold","tag-experts","tag-mathematical","tag-outperforms","tag-problem"],"_links":{"self":[{"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/posts\/225928","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/comments?post=225928"}],"version-history":[{"count":1,"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/posts\/225928\/revisions"}],"predecessor-version":[{"id":225930,"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/posts\/225928\/revisions\/225930"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/media\/225929"}],"wp:attachment":[{"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/media?parent=225928"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/categories?post=225928"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/teknomers.com\/en\/wp-json\/wp\/v2\/tags?post=225928"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}