Counting barrier for Erdős 624: $n\le 2^{H(n)}$, i.e. $H(n)\ge\lceil\log_2 n\rceil$ · Prove2Me

P

Initializing...

Counting barrier for Erdős 624: $n\le 2^{H(n)}$, i.e. $H(n)\ge\lceil\log_2 n\rceil$ · Prove2Me