Skip to content

Erdős problem 890

A question of Erdős and Selfridge [ErSe67], who observe that lim inf⁡n→∞∑0≤i<kω(n+i)≥k+π(k)−1\liminf_{n\to \infty}\sum_{0\leq i < k}\omega(n+i)\geq k+\pi(k)-1 for every kk. This follows from Pólya's theorem that the set of kk-smooth integers has unbounded gaps - indeed, n(n+1)⋯(n+k−1)n(n+1)\cdots (n+k-1) is divisible by all primes ≤k\leq k and, provided nn is large, all but at most one of n,n+1,…,n+k−1n,n+1,\ldots,n+k-1 has a prime factor >k>k by Pólya's theorem.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:7d54533d783a5ca33d6e7873a2fea6d3b40f16908a6c291d45b7bcbd867c7e2e
Metadata
sha256:4bc9745fa9fdb6b4dd124c6bbf1a1b164e977c7054ff379ade6073e0bd38a5c7
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:298bae08a221f19efb5f350da917b1972d797ab85b27f82c9615ec245fcba9ca
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb