Skip to content

Erdős problem 830

Start work

We say that a,b∈Na,b\in \mathbb{N} are an amicable pair if σ(a)=σ(b)=a+b\sigma(a)=\sigma(b)=a+b. If A(x)A(x) counts the number of amicable 1≤a≤b≤x1\leq a\leq b\leq x then one can show that A(x)≤xexp⁡(−(12+o(1))(log⁡xlog⁡log⁡x)1/2)A(x) \leq x \exp(-(\tfrac{1}{2}+o(1))(\log x\log\log x)^{1/2}).

Sources

The source's own material, retained exactly.

5 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

830.lean

Retained formal statement1 of 5

Erdos Problem 830, Part 1 We say that a,b∈Na,b\in \mathbb{N} are an amicable pair if σ(a)=σ(b)=a+b\sigma(a)=\sigma(b)=a+b. Are there infinitely many amicable pairs?

FormalConjectures/ErdosProblems/830.leanErdos830.erdos_830.parts.i1 lineExact file
sorry ↔ {(a, b) | IsAmicable a b}.Infinite
OpenStatement only, no proof