Skip to content

Erdős problem 961

It is conjectured that f(k)≪(log⁡k)O(1)f(k) \ll (\log k)^O(1).

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

961.lean

Retained formal statement2 of 6

Sylvester and Schur [Er34] proved that every set of kk consecutive integers greater than kk contains an integer divisible by a prime greater than kk, i.e. not (k+1)(k+1)-smooth.

FormalConjectures/ErdosProblems/961.leanErdos961.erdos_961.sylvester_schur1 lineExact file
∀ (k : ℕ), 0 < k → Erdos961.Erdos961Prop k k
SolvedStatement only, no proof