Erdős problem 456

Erdős [Er79e] writes it is 'easy to show' that for infinitely many $n$ we have $m_n < p_n$ .

Sources

The source's own material, retained exactly.

7 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

456.lean

Retained formal statement2 of 7

Does $p_n/m_n \to \infty$ for almost all $n$ ?

FormalConjectures/ErdosProblems/456.leanErdos456.erdos_456.parts.ii4 linesExact file

1True ↔2  ∃ A,3    Filter.Tendsto (fun N => ↑(Nat.count A N) / ↑N) Filter.atTop (nhds 1) ∧4      Filter.Tendsto (fun n => ↑(Erdos456.p n) / ↑(Erdos456.m n)) (Filter.atTop ⊓ Filter.principal A) Filter.atTop

OpenStatement only, no proof

Source providers

Erdős Problems1
locator only
Formal Conjectures7
statement retained
VibeMathed0
not observed here
PLBY Lean proofs0
not observed here
Jayyhk Erdős Lean0
not observed here
William Blair Lean proofs0
not observed here
Erdős AI contributions wiki1
no statement retained
GPT-Erdős0
not observed here

Referenced paths

FormalConjectures/
- ErdosProblems/
  - 456.lean7