AWESOME AI PROOFS
← Problems
Research / May 2026

Erdős #1196: primitive sets of large integers

For primitive A ⊂ [x, ∞), is the sum of 1/(a log a) at most 1 + o(1)?

Model / AI: GPT-5.4 Pro

verified
May 2026

Erdős #1196: primitive sets of large integers

Model / AI: GPT-5.4 Pro

verified

The paper proves a quantitative bound using a Markov-chain method suggested by GPT-5.4 Pro.

Source read 2026-09-08. Read the linked source to identify this individual result and its attribution; proofs were not independently checked.