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 statement6 of 6

n + 1 is prime iff h n = n + 1. This is described as 'easy to see' in [Er74b].

FormalConjectures/ErdosProblems/770.leanErdos770.Nat.Prime.h_eq_add_one1 lineExact file

1∀ {n : ℕ}, 2 < n → (Erdos770.h n = ↑n + 1 ↔ Nat.Prime (n + 1))

TextbookStatement only, no proof