Paperlane

no. 7 · Tuesday 3 November 2026

Totient-based Identities for Integer Pairs with Equal Divisor Sums

Ali Reza Mavaddat and Saeid Alikhani

math.HO · v2 · 13 pp

Abstract

A pair of integers is called amicable if each number equals the sum of the proper divisors of the other. In this paper, we investigate a broader class of integer pairs $(A, B)$ that satisfy the weaker condition $σ(A) = σ(B)$, where $σ$ is the sum-of-divisors function. We focus on pairs whose greatest common divisor is a power of two and analyze their distinct prime factorizations. Specifically, we consider configurations of the forms $(A=2^n ab,\ B=2^n cd)$, $(A=2^n abc,\ B=2^n de)$, and $(A=2^n abc,\ B=2^n def)$, where the factors are odd primes. For each configuration, we derive explicit symmetric identities that must be satisfied. These identities relate the odd prime factors of $A$ and $B$ to the quantity $\varphi(A)+\varphi(B)$, where $\varphi$ denotes Euler's totient function. As a consequence, these relations provide necessary structural constraints for amicable pairs of these specific forms, while also revealing an underlying algebraic symmetry for any pair with equal divisor sums.

comments
13 pages
fields
History and Overview
pdf ↗ page arXiv:2512.22319 ↗