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

It is probably true that h n = 3 for infinitely many n.

FormalConjectures/ErdosProblems/770.leanErdos770.erdos_770.variants.three1 lineExact file

1{n | Erdos770.h n = 3}.Infinite

OpenStatement only, no proof