On amicable tuples

Abstract

For an integer k2, a tuple of k positive integers (Mi)i=1k is called an amicable k-tuple if the equation \[ σ(M1)=·s=σ(Mk)=M1+·s+Mk \] 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 ω(MN)=K. Recently, Pollack (2015) obtained an upper bound \[ MN<(2K)2K2 \] for such amicable pairs. In this paper, we improve this upper bound to \[ MN<π2624K-2· 2K \] and generalize this bound to some class of general amicable tuples.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…