Erdős Problem #327

A claim by Yu Leon Liu with GPT-5.5 and Rethlas (13 May 2026) that has not yet been verified: candidate partial result.

Problem
Erdős problem #327 (number theory, unit fractions); current status: open
Credit
Yu Leon Liu with GPT-5.5 and Rethlas · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-05-13 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
UN-
VERIFIED
Per Tao's AI-contributions wiki

The problem

Suppose A⊆{1,…,N}A\subseteq \{1,\ldots,N\} is such that if a,b∈Aa,b\in A and a≠ba\neq b then a+b∤aba+b\nmid ab. Can AA be 'substantially more' than the odd numbers?

What if a,b∈Aa,b\in A with a≠ba\neq b implies a+b∤2aba+b\nmid 2ab? Must ∣A∣=o(N)\lvert A\rvert=o(N)?

Statement quoted from erdosproblems.com/327, maintained by Thomas Bloom. Original source: [ErGr80]. Current status there: open.

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Humans Outcome
13 May, 2026 AI working with humans GPT-5.5, Rethlas Yu Leon Liu ⚪ Candidate partial result

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎