1 paper
Shisheng Li, Zhong Zhuang
Let h(x) be the number of pairs 1≤a<b<x with gcd(a,b)=1 and σ(a)=σ(b). Erdős Problem #824 asks whether h(x)>x2−o(1). By an argument of Pollack and Pomerance, this…