Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. The answer to [[problems/arithmetic_functions/E0051/_index|Problem 51]] is yes, with the set , over the first primes . The manuscript asserts that the least with is , so that by the divergence of the product over the primes. The manuscript, a little over a page long, was posted to the site's discussion thread on 2026-01-11 by the user colossal_noob, who wrote that ChatGPT (free version) had produced it in one attempt; the user could not say whether the argument was already in the literature. The claimant is the user who published it.
Refutation. The minimality step is false, so the ratio is not what the manuscript computes. Three replies in the thread on the same day say so: the first (14:27) observes that the proof of minimality is incomplete, since may itself be prime, as it is for , and (for that prime is a preimage smaller than ), and suggests that is in fact the largest preimage; the site's curator, Thomas F. Bloom (14:31), gives the counterexamples , so the least preimage of is and not , and, setting the factor aside, , so the least preimage of is at most , below both the claimed and its odd half ; the third (15:04) confirms that step 1, minimality, is wrong. Terence Tao recorded the attempt in the community wiki page "AI contributions to Erdős problems" (https://github.com/teorth/erdosproblems/wiki/AI-contributions-to-Erd%C5%91s-problems, Section 1(a), AI standalone) as a standalone AI attempt by ChatGPT free version on 11 Jan 2026 whose outcome the row gives as an incorrect proof found. The site's label is OPEN (page last edited 2025-09-30) and the problem's proof-claims tab carries no entry; the claim is recorded as rejected and decides nothing about the question.
Depends on. No page of this wiki.