Abstract
For an integer $k\ge 2$, a tuple of $k$ positive integers $(M_{i})_{i=1}^{k}$ is called an amicable $k$-tuple if the equation \begin{equation*}\sigma (M_{1})=\cdots =\sigma (M_{k})=M_{1}+\cdots +M_{k}\end{equation*} 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 (Über vollkommene und befreundete Zahlen (1917) Heidelberg University) conjectured that there is no relatively prime amicable pairs and Artjuhov (Acta Arith. 27 (1975) 281–291) and Borho (Math. Ann. 209 (1974) 183–193) 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 (Mosc. J. Comb. Number Theory 5 (2015), 36–51) obtained an upper bound \begin{equation*}MN<(2K)^{2^{K^{2}}}\end{equation*} for such amicable pairs. In this paper, we improve this upper bound to \begin{equation*}MN<\frac{\pi^{2}}{6}2^{4^{K}-2\cdot 2^{K}}\end{equation*} and generalize this bound to some class of general amicable tuples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.