Skip to content

Erdős problem 369

Let ϵ>0\epsilon>0 and k≥2k\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?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ca354484215cae7bda28946cfde76b04da617d48281e7df01e65338b37b148f8
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb