Erdős problem 770

For odd `n`, the values of `h n` form an unbounded set. This is described as 'easy to see' in [Er74b].

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

770.lean

Retained formal statement1 of 6

For every prime p, does the density of integers with h n = p exist?

FormalConjectures/ErdosProblems/770.leanErdos770.erdos_770.parts.i1 lineExact file

1sorry ↔ ∀ (p : ℕ), Nat.Prime p → ∃ a, {n | Erdos770.h n = ↑p}.HasDensity a

OpenStatement only, no proof