On amicable tuples
Abstract: For an integer $k\ge2$, a tuple of $k$ positive integers $(M_i)_{i=1}{k}$ is called an amicable $k$-tuple if the equation [ \sigma(M_1)=\cdots=\sigma(M_k)=M_1+\cdots+M_k ] holds. This is a generalization of amicable pairs. An amicable pair is a pair of distinct positive integers each of which is the sum of the proper divisors of the other. Gmelin (1917) conjectured that there is no relatively prime amicable pairs and Artjuhov (1975) and Borho (1974) proved that for any fixed positive integer $K$, there are only finitely many relatively prime amicable pairs $(M,N)$ with $\omega(MN)=K$. Recently, Pollack (2015) obtained an upper bound [ MN<(2K){2{K2}} ] for such amicable pairs. In this paper, we improve this upper bound to [ MN<\frac{\pi2}{6}2{4K-2\cdot 2K} ] and generalize this bound to some class of general amicable tuples.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.