Skip to content

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

Open selected source

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
{n | Erdos770.h n = 3}.Infinite
OpenStatement only, no proof