Erdős problem 369 · problems.science

Let $\epsilon>0$ and $k\geq 2$ . Is it true that, for all sufficiently large $n$ , there is a sequence of $k$ consecutive integers in $\{1,\ldots,n\}$ all of which are $n^\epsilon$ -smooth?

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#369
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI collaborating with humans
Erdős AI contributions wiki · 26 Mar, 2026
Machine
GPT
People
Sky Yang
Open the source record
Formalization
Erdős AI contributions wiki · 27 Mar, 2026
Machine
Aristotle
Open the source record
Solved as stated, hidden constraints
GPT-Erdős
Open the source record
argument
VibeMathed
Machine
GPT
People
Sky Yang
Reported outcome
resolved
Open the source record

Reported activity

Search problems.science