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.

Sources

Browse retained paths and inspect the exact material available for this Problem.

4 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

890.lean

Retained formal statement1 of 4

If ωk(n)\omega_k(n) counts the number of distinct prime factors of nn which are >k>k, then is it true that, for every k1k\geq 1, lim infn0i<kωk(n+i)k?\liminf_{n\to \infty}\sum_{0\leq i < k}\omega_k(n+i)\leq k?

FormalConjectures/ErdosProblems/890.leanErdos890.erdos_890.parts.a1 lineExact file
sorry ↔ ∀ k ≥ 1, Filter.liminf (fun n => ∑ iFinset.range k, ↑(Erdos890.omegaGt k (n + i))) Filter.atTop ≤ ↑k
OpenStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page