Erdős Problem #935

Partial progress by Aletheia (1 Feb 2026): solution to one part of problem.

Problem
Erdős problem #935 (number theory, powerful); current status: open
Credit
Aletheia · AI on its own; related literature found afterwards
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-02-01 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PARTIALPer Tao's AI-contributions wiki

The problem

For any integer n=∏pkpn=\prod p^{k_p} let Q2(n)Q_2(n) be the powerful part of nn, so that

Q2(n)=∏pkp≥2pkp.Q_2(n) = \prod_{\substack{p\\ k_p\geq 2}}p^{k_p}.

Is it true that, for every ϵ>0\epsilon>0 and ℓ≥1\ell\geq 1, if nn is sufficiently large then

Q2(n(n+1)⋯(n+ℓ))<n2+ϵ?Q_2(n(n+1)\cdots(n+\ell))<n^{2+\epsilon}?

If ℓ≥2\ell\geq 2 then is

lim sup⁡n→∞Q2(n(n+1)⋯(n+ℓ))n2\limsup_{n\to \infty}\frac{Q_2(n(n+1)\cdots(n+\ell))}{n^2}

infinite?

If ℓ≥2\ell\geq 2 then is

lim⁡n→∞Q2(n(n+1)⋯(n+ℓ))nℓ+1=0?\lim_{n\to \infty}\frac{Q_2(n(n+1)\cdots(n+\ell))}{n^{\ell+1}}=0?

Statement quoted from erdosproblems.com/935, maintained by Thomas Bloom. Original source: [Er76d]. 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 Outcome Literature
1 Feb, 2026 AI on its own; related literature found afterwards Aletheia 🟡 Solution to one part of problem 🟡 van Doorn (2025) (solution to one part of [367])

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.

∎