Erdős problem 1139
Let be the sequence of integers with at most prime factors. Is it true that
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/1139.leanTrue ↔ Filter.limsup (fun k => (↑↑(Nat.nth (fun n => 0 < n ∧ ArithmeticFunction.cardFactors n ≤ 2) (k + 1)) - ↑↑(Nat.nth (fun n => 0 < n ∧ ArithmeticFunction.cardFactors n ≤ 2) k)) / ↑(Real.log (↑k + 1))) Filter.atTop = ⊤OpenStatement only, no proof
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
AI collaborating with humans
- Machine
- People