Erdős problem 932 · problems.science

Let $p_k$ denote the $k$ th prime. For infinitely many $r$ there are at least two integers $p_r < n < p_{r+1}$ all of whose prime factors are $< p_{r + 1} - p_r$ .

Sources

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

2 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

932.lean

Retained formal statement1 of 2

Let $p_k$ denote the $k$ th prime. For infinitely many $r$ there are at least two integers $p_r < n < p_{r+1}$ all of whose prime factors are $< p_{r + 1} - p_r$ .

FormalConjectures/ErdosProblems/932.leanErdos932.erdos_9324 linesExact file

1{r |2    2 ≤3      {m ∈ Finset.Ioo (Nat.nth Nat.Prime r) (Nat.nth Nat.Prime r.succ) |4          m.maxPrimeFac < Nat.nth Nat.Prime r.succ - Nat.nth Nat.Prime r}.card}.Infinite

OpenStatement only, no proof

Sources

Search problems.science