The symmetric 4-term amicable-pair conjecture

From papers

Let A=2nabcdA=2^n abcd and B=2nefghB=2^n efgh be a symmetric higher-order amicable pair, with a,b,c,d,e,f,g,ha,b,c,d,e,f,g,h denoting the relevant prime factors. Define xx and yy through the normalized expressions associated with AA, BB, and the sum φ(A)+φ(B)\varphi(A)+\varphi(B) described in the preceding results. Symmetric 4-term conjecture. The relationship between the symmetric polynomials in the prime factors is hypothesized to satisfy

y1=[ef(g+h)+gh](a+b+c+d),y-1=[ef(g+h)+gh]-(a+b+c+d), x1=[ab(c+d)+cd](e+f+g+h).x-1=[ab(c+d)+cd]-(e+f+g+h).

This proposes a higher-order symmetric extension of the factorization patterns established earlier for amicable pairs whose greatest common divisor is a power of two.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Ali Reza Mavaddat and Saeid Alikhani, “Amicable numbers and their connection to the Euler totient function”, arXiv:2512.22319 (2025).

Solutions 0

No solutions have been posted yet.