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

Erdős Problem #1099

ChatGPT Deep research, Gemini and Gemini Deep Research found that the problem had already been solved in the literature (19 Oct 2025).

問題
Erdős problem #1099 (number theory, divisors); current status: proved
貢献
ChatGPT Deep research, Gemini and Gemini Deep Research · Literature search
検証
Listed in Tao's wiki
経緯
First AI contribution 2025-10-19 · 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 1=d1<⋯<dτ(n)=n1=d_1<\cdots<d_{\tau(n)}=n be the divisors of nn, and for α>1\alpha>1 let

hα(n)=∑i(di+1di−1)α.h_\alpha(n) = \sum_i \left( \frac{d_{i+1}}{d_i}-1\right)^\alpha.

Is it true that

lim inf⁡n→∞hα(n)≪α1?\liminf_{n\to \infty}h_\alpha(n) \ll_\alpha 1?

Statement quoted from erdosproblems.com/1099, maintained by Thomas Bloom. Original source: [Er81h,p.171]. Current status there: proved.

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
19 Oct, 2025 Literature search ChatGPT Deep research, Gemini, Gemini Deep Research 🟢 Full solution found

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.

∎