Skip to content

Erdős problem 890

A question of Erdős and Selfridge [ErSe67], who observe that lim infn0i<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+k1)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+k1n,n+1,\ldots,n+k-1 has a prime factor >k>k by Pólya's theorem.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:298bae08a221f19efb5f350da917b1972d797ab85b27f82c9615ec245fcba9ca
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page