この記事の日本語版はまだありません。英語版を表示しています。

Erdős Problem #694

Full solution by GPT-5.5 Pro (1 May 2026).

問題
Erdős problem #694 (number theory); current status: solved (Lean)
貢献
GPT-5.5 Pro · AI on its own
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-05-01 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
完全解Per Tao's AI-contributions wiki

The problem

Let fmax⁡(n)f_{\max}(n) be the largest mm such that ϕ(m)=n\phi(m)=n, and fmin⁡(n)f_{\min}(n) be the smallest such mm, where ϕ\phi is Euler's totient function. Investigate

max⁡n≤xfmax⁡(n)fmin⁡(n)\max_{n\leq x}\frac{f_{\max}(n)}{f_{\min}(n)}

(where the maximum is restricted to those nn of the form n=ϕ(m)n=\phi(m) for some mm.)

Statement quoted from erdosproblems.com/694, maintained by Thomas Bloom. Original source: [Er79e,p.80]. Current status there: solved (Lean).

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 Outcome
1 May, 2026 AI on its own GPT-5.5 Pro 🟢 Full solution

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.

∎