Multiply perfect number

Demonstration, with Cuisenaire rods, of the 2-perfection of the number 6

In mathematics, a multiply perfect number (also called multiperfect number or pluperfect number) is a generalization of a perfect number.

For a given natural number k, a number n is called k-perfect (or k-fold perfect) if and only if the sum of all positive divisors of n (the divisor function, σ(n)) is equal to kn; a number is thus perfect if and only if it is 2-perfect. A number that is k-perfect for a certain k is called a multiply perfect number. As of 2014, k-perfect numbers are known for each value of k up to 11.^[1]

It is unknown whether there are any odd multiply perfect numbers other than 1. The first few multiply perfect numbers are:

1, 6, 28, 120, 496, 672, 8128, 30240, 32760, 523776 (sequence A007691 in the OEIS)

Example[edit]

The sum of the divisors of 120 is

1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 20 + 24 + 30 + 40 + 60 + 120 = 360

which is 3 × 120. Therefore 120 is a 3-perfect number.

Smallest known k-perfect numbers[edit]

The following table gives an overview of the smallest known k-perfect numbers for k ≤ 11 (sequence A007539 in the OEIS):

k	Smallest known k-perfect number	Factors	Found by
1	1		ancient
2	6	2 × 3	ancient
3	120	2³ × 3 × 5	ancient
4	30240	2⁵ × 3³ × 5 × 7	René Descartes, circa 1638
5	14182439040	2⁷ × 3⁴ × 5 × 7 × 11² × 17 × 19	René Descartes, circa 1638
6	154345556085770649600 (21 digits)	2¹⁵ × 3⁵ × 5² × 7² × 11 × 13 × 17 × 19 × 31 × 43 × 257	Robert Daniel Carmichael, 1907
7	141310897947438348259849402738485523264343544818565120000 (57 digits)	2³² × 3¹¹ × 5⁴ × 7⁵ × 11² × 13² × 17 × 19³ × 23 × 31 × 37 × 43 × 61 × 71 × 73 × 89 × 181 × 2141 × 599479	TE Mason, 1911
8	826809968707776137289924...057256213348352000000000 (133 digits)	2⁶² × 3¹⁵ × 5⁹ × 7⁷ × 11³ × 13³ × 17² × 19 × 23 × 29 × ... × 487 × 521² × 601 × 1201 × 1279 × 2557 × 3169 × 5113 × 92737 × 649657 (38 distinct prime factors)	Stephen F. Gretton, 1990^[1]
9	561308081837371589999987...415685343739904000000000 (287 digits)	2¹⁰⁴ × 3⁴³ × 5⁹ × 7¹² × 11⁶ × 13⁴ × 17 × 19⁴ × 23² × 29 × ... × 17351 × 29191 × 30941 × 45319 × 106681 × 110563 × 122921 × 152041 × 570461 × 16148168401 (66 distinct prime factors)	Fred Helenius, 1995^[1]
10	448565429898310924320164...000000000000000000000000 (639 digits)	2¹⁷⁵ × 3⁶⁹ × 5²⁹ × 7¹⁸ × 11¹⁹ × 13⁸ × 17⁹ × 19⁷ × 23⁹ × 29³ × ... × 583367 × 1609669 × 3500201 × 119782433 × 212601841 × 2664097031 × 2931542417 × 43872038849 × 374857981681 × 4534166740403 (115 distinct prime factors)	George Woltman, 2013^[1]
11	251850413483992918774837...000000000000000000000000 (1907 digits)	2⁴⁶⁸ × 3¹⁴⁰ × 5⁶⁶ × 7⁴⁹ × 11⁴⁰ × 13³¹ × 17¹¹ × 19¹² × 23⁹ × 29⁷ × ... × 25922273669242462300441182317 × 15428152323948966909689390436420781 × 420391294797275951862132367930818883361 × 23735410086474640244277823338130677687887 × 628683935022908831926019116410056880219316806841500141982334538232031397827230330241 (246 distinct prime factors)	George Woltman, 2001^[1]

Properties[edit]

It can be proven that:

For a given prime number p, if n is p-perfect and p does not divide n, then pn is (p+1)-perfect. This implies that an integer n is a 3-perfect number divisible by 2 but not by 4, if and only if n/2 is an odd perfect number, of which none are known.
If 3n is 4k-perfect and 3 does not divide n, then n is 3k-perfect.

Odd multiply perfect numbers[edit]

It is unknown whether there are any odd multiply perfect numbers other than 1. However if an odd k-perfect number n exists where k > 2, then it must satisfy the following conditions:^[2]

The largest prime factor is ≥ 100129
The second largest prime factor is ≥ 1009
The third largest prime factor is ≥ 101

Bounds[edit]

In little-o notation, the number of multiply perfect numbers less than x is $o(x^{\varepsilon })$ for all ε > 0.^[2]

The number of k-perfect numbers n for n ≤ x is less than $cx^{c'\log \log \log x/\log \log x}$ , where c and c' are constants independent of k.^[2]

Under the assumption of the Riemann Hypothesis, the following inequality is true for all k-perfect numbers n, where k > 3

\log \log n>k\cdot e^{-\gamma }

where $\gamma$ is Euler's gamma constant. This can be proven using Robin's theorem.

The number of divisors τ(n) of a k-perfect number n satisfies the inequality:^[3]

\tau (n)>e^{k-\gamma }

.

The number of distinct prime factors ω(n) of n satisfies:^[4]

\omega (n)\geq k^{2}-1

If the distinct prime factors of n are $p_{1},p_{2},\ldots ,p_{r}$ , then:^[4]

r\left({\sqrt[{r}]{3/2}}-1\right)<\sum _{i=1}^{r}{\frac {1}{p_{i}}}<r\left(1-{\sqrt[{r}]{6/k^{2}}}\right),~~{\text{if }}n{\text{ is even}}

r\left({\sqrt[{3r}]{k^{2}}}-1\right)<\sum _{i=1}^{r}{\frac {1}{p_{i}}}<r\left(1-{\sqrt[{r}]{8/(k\pi ^{2})}}\right),~~{\text{if }}n{\text{ is odd}}

Specific values of k[edit]

Perfect numbers[edit]

A number n with σ(n) = 2n is perfect.

Triperfect numbers[edit]

A number n with σ(n) = 3n is triperfect. There are only six known triperfect numbers and these are believed to comprise all such numbers:

120, 672, 523776, 459818240, 1476304896, 51001180160 (sequence A005820 in the OEIS)

If there exists an odd perfect number m (a famous open problem) then 2m would be 3-perfect, since σ(2m) = σ(2)*σ(m) = 3*2m. An odd triperfect number must be a square number exceeding 10⁷⁰ and have at least 12 distinct prime factors, the largest exceeding 10⁵.^[5]

Variations[edit]

Unitary multiply perfect numbers[edit]

A similar extension can be made for unitary perfect numbers. A positive integer n is called a unitary multi k-perfect number if σ^*(n) = kn where σ^*(n) is the sum of its unitary divisors. (A divisor d of a number n is a unitary divisor if d and n/d share no common factors.).

A unitary multiply perfect number is simply a unitary multi k-perfect number for some positive integer k. Equivalently, unitary multiply perfect numbers are those n for which n divides σ^*(n). A unitary multi 2-perfect number is naturally called a unitary perfect number. In the case k > 2, no example of a unitary multi k-perfect number is known till now. It is known that if such a number exists, it must be even and greater than 10¹⁰² and must have more than forty four odd prime factors. This problem is probably very difficult to settle. The concept of unitary divisor was originally due to R. Vaidyanathaswamy (1931) who called such a divisor as block factor. The present terminology is due to E. Cohen (1960).

The first few unitary multiply perfect numbers are:

1, 6, 60, 90, 87360 (sequence A327158 in the OEIS)

Bi-unitary multiply perfect numbers[edit]

A positive integer n is called a bi-unitary multi k-perfect number if σ^**(n) = kn where σ^**(n) is the sum of its bi-unitary divisors. This concept is due to Peter Hagis (1987). A bi-unitary multiply perfect number is simply a bi-unitary multi k-perfect number for some positive integer k. Equivalently, bi-unitary multiply perfect numbers are those n for which n divides σ^**(n). A bi-unitary multi 2-perfect number is naturally called a bi-unitary perfect number, and a bi-unitary multi 3-perfect number is called a bi-unitary triperfect number.

A divisor d of a positive integer n is called a bi-unitary divisor of n if the greatest common unitary divisor (gcud) of d and n/d equals 1. This concept is due to D. Surynarayana (1972). The sum of the (positive) bi-unitary divisors of n is denoted by σ^**(n).

Peter Hagis (1987) proved that there are no odd bi-unitary multiperfect numbers. Haukkanen and Sitaramaiah (2020) found all bi-unitary triperfect numbers of the form 2^au where 1 ≤ a ≤ 6 and u is odd,^[6]^[7]^[8] and partially the case where a = 7.^[9]

The first few bi-unitary multiply perfect numbers are:

1, 6, 60, 90, 120, 672, 2160, 10080, 22848, 30240 (sequence A189000 in the OEIS)

References[edit]

^ ^a ^b ^c ^d ^e Flammenkamp, Achim. "The Multiply Perfect Numbers Page". Retrieved 22 January 2014.
^ ^a ^b ^c Sándor, Mitrinović & Crstici 2006, p. 105
^ Dagal, Keneth Adrian P. (2013). "A Lower Bound for τ(n) for k-Multiperfect Number". arXiv:1309.3527 [math.NT].
^ ^a ^b Sándor, Mitrinović & Crstici 2006, p. 106
^ Sándor, Mitrinović & Crstici 2006, pp. 108–109
^ Haukkanen & Sitaramaiah 2020a
^ Haukkanen & Sitaramaiah 2020b
^ Haukkanen & Sitaramaiah 2020c
^ Haukkanen & Sitaramaiah 2020d

Sources[edit]

Broughan, Kevin A.; Zhou, Qizhi (2008). "Odd multiperfect numbers of abundancy 4" (PDF). J. Number Theory. 126 (6): 1566–1575. doi:10.1016/j.jnt.2007.02.001. hdl:10289/1796. MR 2419178.
Guy, Richard K. (2004). Unsolved problems in number theory (3rd ed.). Springer-Verlag. B2. ISBN 978-0-387-20860-2. Zbl 1058.11001.
Haukkanen, Pentti; Sitaramaiah, V. (2020a). "Bi-unitary multiperfect numbers, I" (PDF). Notes Number Theory Discrete Math. 26 (1): 93–171. doi:10.7546/nntdm.2020.26.1.93-171.
Haukkanen, Pentti; Sitaramaiah, V. (2020b). "Bi-unitary multiperfect numbers, II" (PDF). Notes Number Theory Discrete Math. 26 (2): 1–26. doi:10.7546/nntdm.2020.26.2.1-26.
Haukkanen, Pentti; Sitaramaiah, V. (2020c). "Bi-unitary multiperfect numbers, III" (PDF). Notes Number Theory Discrete Math. 26 (3): 33–67. doi:10.7546/nntdm.2020.26.3.33-67.
Haukkanen, Pentti; Sitaramaiah, V. (2020d). "Bi-unitary multiperfect numbers, IV(a)". Notes Number Theory Discrete Math. 26 (4): 2–32. doi:10.7546/nntdm.2020.26.4.2-32.
Kishore, Masao (1987). "Odd triperfect numbers are divisible by twelve distinct prime factors". J. Aust. Math. Soc. Ser. A. 42 (2): 173–182. doi:10.1017/s1446788700028184. ISSN 0263-6115. Zbl 0612.10006.
Laatsch, Richard (1986). "Measuring the abundancy of integers". Mathematics Magazine. 59 (2): 84–92. doi:10.2307/2690424. ISSN 0025-570X. JSTOR 2690424. MR 0835144. Zbl 0601.10003.
Merickel, James G. (1999). "Problem 10617 (Divisors of sums of divisors)". Amer. Math. Monthly. 106 (7): 693. doi:10.2307/2589515. JSTOR 2589515. MR 1543520.
Ryan, Richard F. (2003). "A simpler dense proof regarding the abundancy index". Math. Mag. 76 (4): 299–301. JSTOR 3219086. MR 1573698.
Sándor, Jozsef; Crstici, Borislav, eds. (2004). Handbook of number theory II. Dordrecht: Kluwer Academic. pp. 32–36. ISBN 1-4020-2546-7. Zbl 1079.11001.
Sándor, József; Mitrinović, Dragoslav S.; Crstici, Borislav, eds. (2006). Handbook of number theory I. Dordrecht: Springer-Verlag. ISBN 1-4020-4215-9. Zbl 1151.11300.
Sorli, Ronald M. (2003). Algorithms in the study of multiperfect and odd perfect numbers (PhD thesis). Sydney: University of Technology. hdl:10453/20034.
Weiner, Paul A. (2000). "The abundancy ratio, a measure of perfection". Math. Mag. 73 (4): 307–310. doi:10.1080/0025570x.2000.11996860. JSTOR 2690980. MR 1573474.

External links[edit]

[fl-1] Flammenkamp, Achim. "The Multiply Perfect Numbers Page". Retrieved 22 January 2014.

[HBI105-2] Sándor, Mitrinović & Crstici 2006, p. 105

[3] Dagal, Keneth Adrian P. (2013). "A Lower Bound for τ(n) for k-Multiperfect Number". arXiv:1309.3527 [math.NT].

[HBI106-4] Sándor, Mitrinović & Crstici 2006, p. 106

[5] Sándor, Mitrinović & Crstici 2006, pp. 108–109

[HS2020a-6] Haukkanen & Sitaramaiah 2020a

[HS2020b-7] Haukkanen & Sitaramaiah 2020b

[HS2020c-8] Haukkanen & Sitaramaiah 2020c

[HS2020d-9] Haukkanen & Sitaramaiah 2020d

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

v t e Divisibility-based sets of integers
Overview	Integer factorization Divisor Unitary divisor Divisor function Prime factor Fundamental theorem of arithmetic
Factorization forms	Prime Composite Semiprime Pronic Sphenic Square-free Powerful Perfect power Achilles Smooth Regular Rough Unusual
Constrained divisor sums	Perfect Almost perfect Quasiperfect Multiply perfect Hemiperfect Hyperperfect Superperfect Unitary perfect Semiperfect Practical Erdős–Nicolas
With many divisors	Abundant Primitive abundant Highly abundant Superabundant Colossally abundant Highly composite Superior highly composite Weird
Aliquot sequence-related	Untouchable Amicable (Triple) Sociable Betrothed
Base-dependent	Equidigital Extravagant Frugal Harshad Polydivisible Smith
Other sets	Arithmetic Deficient Friendly Solitary Sublime Harmonic divisor Descartes Refactorable Superperfect

Search This Blog

anhduc wiki 4