Erdős problem 770 · problems.science

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

Sources

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

6 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

770.lean

Retained formal statement3 of 6

Is it true that if p is the greatest prime such that p - 1 ∣ n and p > n ^ ε, then h n = p?

FormalConjectures/ErdosProblems/770.leanErdos770.erdos_770.parts.iii5 linesExact file

1sorry ↔2  ∀ ε > 0,3    ∀ᶠ (n : ℕ) in Filter.atTop,4      have p := sSup {m | Nat.Prime m ∧ m - 1 ∣ n};5      ↑p > ↑n ^ ε → Erdos770.h n = ↑p

OpenStatement only, no proof