Papers
Topics
Authors
Recent
2000 character limit reached

On amicable tuples

Published 18 Nov 2017 in math.NT | (1711.06847v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.