AI Science Tracker

Erdős Problem #650 solved with ChatGPT strategy and Aristotle Lean proof

Southeast University; Xi'an Jiaotong University · 30 Mar 2026 · mathematics

Discovery

Erdős Problem #650 solved with ChatGPT strategy and Aristotle Lean proof

The authors prove f(m) = min(m, ceil(2 sqrt(m))) for all m, resolving Erdős Problem #650 on Bloom's site, where f(m) counts disjoint divisibility pairs in an interval for an m-element set. The detailed argument was formally verified in Lean by Harmonic's Aristotle, following a strategy proposed by ChatGPT. Caveat: arXiv preprint; the AI contribution is the strategy and formalization, not an independently checked autonomous solution.

Technology: ChatGPT (strategy) and Aristotle (Lean formalization)

Publication: Preprint · Test context: prospective or independent check. Catalog categories, not an evidence grade.

Result, AI contribution and limits

Evidence context (descriptions follow the cited sources; test type is a catalog classification):

  • Publication status: Preprint
  • Test type: prospective or independent check
  • Tested: The detailed argument for f(m) = min(m, ceil(2 sqrt(m))) was formally verified in Lean by Harmonic's Aristotle.
  • Still unknown: The abstract lists no explicit limitations; the authors state the exposition and final proofs are entirely human-written.
  • AI role: ChatGPT proposed the proof strategy and Aristotle produced the Lean formalization.

Evidence sources: https://arxiv.org/abs/2603.28636

Source checked · editorial details

The source page was checked against this entry. Independent confirmation is not assessed by this label.

Source type: paper. Paper: not linked in this catalog; this does not mean no paper exists.

Review scope and date are not recorded; source checked does not establish full-text review.

Editorial assessment: Impact 2/5 · Validation 4/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.

Follow-up and relationships

No follow-up recorded; this is not a claim that no follow-up exists.

Follow-up review scope and date are not recorded.

No source-supported relationships recorded.

Open in the full catalog for filters, charts and related discoveries.