Skip to content

Erdős problem 369

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

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:a1d53d7d8847e6e740fa6817f02657cc6c5df97c00055c030010a3653287bc39
Metadata
sha256:00e85ce1445c82dc3c940a1586d176925938ccbf2847a3fb15e307aaf81613f6
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:ca354484215cae7bda28946cfde76b04da617d48281e7df01e65338b37b148f8
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page