Fact-checked by Grok 2 weeks ago

Perfect number

A perfect number is a positive integer equal to the sum of its proper positive divisors, where proper divisors exclude the number itself.^[1] Equivalently, the sum of all positive divisors of such a number n, denoted \sigma(n), satisfies \sigma(n) = 2n.^[2] The smallest perfect numbers are 6 (with proper divisors 1, 2, 3) and 28 (with proper divisors 1, 2, 4, 7, 14).^[3] These examples illustrate the rarity of perfect numbers, a concept originating in ancient Greek mathematics. Around 300 BCE, Euclid described in his Elements a construction for even perfect numbers: if $2^p - 1 is prime (a Mersenne prime), then $2^{p-1}(2^p - 1) is perfect.^[4] In the 18th century, Leonhard Euler proved the converse—that every even perfect number must take this form—establishing a one-to-one correspondence between even perfect numbers and Mersenne primes.^[5] As of November 2025, 52 Mersenne primes are known, yielding exactly 52 known perfect numbers, all even.^[6] The largest, corresponding to the Mersenne prime $2^{136279841} - 1 (discovered by Luke Durant on October 12, 2024), is $2^{136279840} (2^{136279841} - 1), a number with over 41 million digits.^[6] No odd perfect numbers are known, and their existence remains an open problem in number theory; if any exist, they must exceed $10^{1500} and have at least ten distinct prime factors.^[7]^[8] Euler further showed that any odd perfect number must be of the form p^k m^2, where p is a prime congruent to 1 modulo 4, k \equiv 1 \pmod{4}, and \gcd(p, m) = 1.^[9] Extensive computational searches and theoretical bounds continue to constrain possible candidates, but the question persists as one of the oldest unsolved problems in mathematics.^[10]

Fundamentals

Definition

A perfect number is a positive integer that equals the sum of its proper divisors, where proper divisors are the positive divisors of the number excluding the number itself.^[11]^[12] For example, the proper divisors of 6 are 1, 2, and 3, and their sum is $1 + 2 + 3 = 6.^[11] Similarly, the proper divisors of 28 are 1, 2, 4, 7, and 14, summing to $1 + 2 + 4 + 7 + 14 = 28.^[11] The first few perfect numbers are 6, 28, 496, and 8128.^[11] An equivalent formulation uses the divisor sum function \sigma(n), which denotes the sum of all positive divisors of n including n itself; a number n is perfect if \sigma(n) = 2n, or equivalently, if the sum of its proper divisors equals n.^[11]^[13] The term "perfect" originates from the Greek word teleios, meaning complete or finished, reflecting ancient views of these numbers as embodying mathematical harmony; this nomenclature is attributed to early Greek mathematicians such as Euclid and Nicomachus.^[12] All known perfect numbers are even.^[11]

Divisor Sum Function

The divisor sum function, denoted σ(n), is defined as the sum of all positive divisors of a positive integer n, including both 1 and n itself.^[14] This function is a fundamental arithmetic function in number theory, capturing the total "divisibility measure" of n.^[14] The function σ(n) is multiplicative, meaning that if m and n are coprime positive integers (i.e., gcd(m, n) = 1), then σ(mn) = σ(m) σ(n).^[14] For a general n with prime factorization n = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}, where each p_i is a distinct prime and a_i \geq 1, the multiplicativity yields

\sigma(n) = \prod_{i=1}^k \left(1 + p_i + p_i^2 + \cdots + p_i^{a_i}\right) = \prod_{i=1}^k \frac{p_i^{a_i + 1} - 1}{p_i - 1}.

This formula allows efficient computation of σ(n) from the prime factors of n.^[14] A positive integer n is perfect if and only if σ(n) = 2n.^[11] Equivalently, the abundance (or abundancy index) of n, defined as h(n) = \frac{\sigma(n)}{n}, equals 2.^[3] For example, the smallest perfect number is 6, since its divisors are 1, 2, 3, and 6, so σ(6) = 1 + 2 + 3 + 6 = 12 = 2 × 6.^[11] Similarly, for 28, the divisors are 1, 2, 4, 7, 14, and 28, giving σ(28) = 1 + 2 + 4 + 7 + 14 + 28 = 56 = 2 × 28.^[11] No prime number p is perfect, as σ(p) = 1 + p < 2p for any prime p > 1.^[14] This follows directly from the definition, since the only positive divisors of p are 1 and p.^[14] The divisor sum function relates closely to the concept of aliquot parts, where the sum of proper divisors s(n) is defined as s(n) = σ(n) - n (excluding n itself).^[11] Thus, n is perfect if s(n) = n.^[11]

Historical Development

Ancient and Medieval Contributions

The concept of perfect numbers emerged in ancient Greek mathematics as numbers equal to the sum of their proper divisors. Euclid, in his Elements (c. 300 BCE), provided the earliest systematic characterization in Book IX, Proposition 36, stating that if $2^p - 1 is prime, then $2^{p-1}(2^p - 1) is a perfect number.^[15] This formulation implicitly generates the first two known perfect numbers, 6 and 28, through the cases p=2 and p=3, respectively, where 3 and 7 are Mersenne primes.^[16] Around 100 CE, Nicomachus of Gerasa expanded on these ideas in his Introduction to Arithmetic, listing the first four perfect numbers—6, 28, 496, and 8128—as exemplars of numerical harmony between abundance and deficiency.^[12] He emphasized their rarity, noting that they occur infrequently and always even, a pattern observed empirically from Euclid's construction.^[3] Nicomachus's work influenced subsequent generations by framing perfect numbers within Pythagorean classifications of numerical properties, portraying them as balanced and self-sufficient.^[12] Iamblichus of Chalcis (c. 245–325 CE), drawing from Nicomachus, further elaborated on perfect numbers in his Theology of Arithmetic, associating them with cosmic harmony and completeness.^[17] He described the perfect numbers within the decad (1 through 10) as embodying proportional equality, linking 6 to the synthesis of unity and multiplicity in a balanced whole, and viewing their structure as reflective of divine order and musical concords like the fourth and octave.^[17] Ancient thinkers also imbued perfect numbers with mystical significance, connecting 6 to the six days of creation in Judeo-Christian and Pythagorean cosmogonies, symbolizing the world's perfected formation before rest.^[3] Similarly, 28 was tied to the lunar cycle of approximately 28 days, representing celestial completeness and rhythmic harmony in the natural order.^[3] These associations underscored the Pythagorean view of numbers as archetypal principles underlying reality.^[12] In the medieval Islamic world, scholars built upon Greek foundations; Thābit ibn Qurra (c. 836–901 CE) generalized Euclid's form for perfect numbers to derive amicable pairs, where two distinct numbers are each the sum of the proper divisors of the other, using expressions like $3 \cdot 2^{n-1} - 1 for prime factors when n > 2.^[18] This extension, detailed in his astronomical and mathematical treatises, highlighted interconnections between perfect, amicable, and deficient numbers within divisor sum theory.^[19] European medieval mathematics revived interest through Leonardo of Pisa (Fibonacci, c. 1170–1250 CE), who referenced perfect numbers in his Liber Abaci (1202), illustrating their generation via Euclid's method and including 496 as an example to demonstrate computational techniques with Hindu-Arabic numerals.^[20] Fibonacci's inclusion helped disseminate ancient Greek arithmetic to the Latin West, integrating perfect numbers into practical and theoretical instruction.^[20]

Modern Formulations

In the 18th century, Leonhard Euler advanced the understanding of even perfect numbers through his correspondence with Christian Goldbach, proving that every even perfect number must be of the form $2^{p-1}(2^p - 1), where $2^p - 1 is a Mersenne prime.^[12] This result, published posthumously in Euler's Opera Omnia (Volume 3, 1921), provided a complete characterization of even perfect numbers, building on Euclid's earlier generation method and confirming that no other forms exist for even cases. Euler's proof relied on analyzing the divisor sum function for numbers with exactly two distinct prime factors, one of which is 2, demonstrating that deviations from this structure lead to abundance or deficiency.^[12] Advancements continued into the early modern period with computational efforts verifying Mersenne primes and corresponding perfect numbers. In 1726, French mathematician Pierre de Lagny computed and confirmed the perfect number $2^{30}(2^{31} - 1) = 2,305,843,008,139,952,128, associated with the Mersenne prime $2^{31} - 1, extending the known list beyond Cataldi's earlier claims.^[12] By the 19th century, manual calculations yielded further discoveries, such as the perfect number $2^{88}(2^{89} - 1) found by American mathematician R. E. Powers in 1911, highlighting the growing reliance on systematic prime testing despite the labor-intensive nature of the work.^[12] The 20th century marked a shift toward mechanized computation in Mersenne prime searches, directly impacting perfect number verification. In the 1930s, American mathematician Derrick Henry Lehmer used desk calculators to confirm the compositeness of $2^{257} - 1 (one of Mersenne's conjectured primes) and verify even perfect numbers up to exponents around 100, establishing early computational benchmarks that ruled out smaller undiscovered cases.^[21] These efforts linked perfect number theory to broader primality testing, with the Lucas-Lehmer test—refined by Lehmer in 1930—enabling efficient checks for Mersenne primality. As of November 2025, 52 even perfect numbers are known, all generated from Mersenne primes discovered primarily through the Great Internet Mersenne Prime Search (GIMPS), with the largest corresponding to the Mersenne prime $2^{136279841} - 1 found in 2024.^[6] Theoretical progress on odd perfect numbers includes Jacques Touchard's 1953 result that any such number, if it exists, must be congruent to 1 modulo 12 or 9 modulo 36, severely restricting possible forms and implying a sparse distribution among odd integers.^[22] Recent constraints, such as those by Pascal Ochem and Michael Rao, establish that an odd perfect number must exceed $10^{1500}, based on exhaustive checks and structural inequalities involving prime factors.^[7]

Even Perfect Numbers

Euclid-Euler Theorem

The Euclid–Euler theorem states that an even positive integer is perfect if and only if it is of the form $2^{p-1}(2^p - 1), where p is a prime number and $2^p - 1 is a Mersenne prime.^[21] In Book IX, Proposition 36 of the Elements, Euclid established the forward implication: if $2^p - 1 is prime for prime p, then n = 2^{p-1}(2^p - 1) is perfect.^[15] To see this, note that the divisor sum function \sigma is multiplicative, so

\sigma(n) = \sigma(2^{p-1}) \cdot \sigma(2^p - 1) = (2^p - 1) \cdot ( (2^p - 1) + 1 ) = (2^p - 1) \cdot 2^p = 2 \cdot 2^{p-1}(2^p - 1) = 2n,

as required for perfection.^[21] Euler completed the characterization in 1747 by proving the converse: every even perfect number has Euclid's form.^[23] To outline the proof, suppose n is an even perfect number, so \sigma(n) = 2n. Write n = 2^a m with m > 1 odd. Multiplicativity of \sigma yields

\sigma(2^a) \cdot \sigma(m) = 2^{a+1} m,

and since \sigma(2^a) = 2^{a+1} - 1,

(2^{a+1} - 1) \sigma(m) = 2^{a+1} m \implies \sigma(m) = \frac{2^{a+1} m}{2^{a+1} - 1}.

Let r = a + 1, so $2^r - 1 divides m (as it is coprime to $2^{a+1} and divides the right side). Thus, m = (2^r - 1) k for some odd integer k \geq 1. Substituting gives

\sigma(2^r - 1) \cdot \sigma(k) = 2^r k \implies \sigma(2^r - 1) \cdot \frac{\sigma(k)}{k} = 2^r.

Here, \sigma(k)/k \geq 1 with equality if and only if k = 1, so \sigma(2^r - 1) \leq 2^r. But \sigma(2^r - 1) \geq 1 + (2^r - 1) = 2^r, forcing equality: k = 1 and \sigma(2^r - 1) = 2^r. The latter holds if and only if $2^r - 1 is prime (for if composite, it has at least four divisors, yielding \sigma(2^r - 1) > 2^r). Finally, r must be prime, as composite exponents yield composite Mersenne numbers. Thus, m = 2^r - 1 is a Mersenne prime, a = r - 1, and n = 2^{r-1}(2^r - 1) with r prime.^[21]

Properties and Generation

Even perfect numbers are generated using Mersenne primes q = 2^p - 1, where p is a prime number, via the formula N_p = 2^{p-1} q.^[11] This pairing, established by the Euclid-Euler theorem, produces all known even perfect numbers.^[11] As of November 2025, 52 such Mersenne primes are known, yielding 52 even perfect numbers, with the largest corresponding to p = 136{,}279{,}841.^[6] The number of digits in N_p is approximately p \log_{10} 4, or roughly $0.60206 p; for the largest known, this exceeds 82 million digits.^[24] All even perfect numbers possess several distinctive properties. They are triangular numbers, expressible as N_p = T_{2^p - 1}, where the k-th triangular number is given by

T_k = \frac{k(k+1)}{2}.

^[11] Additionally, due to their form, even perfect numbers are hexagonal numbers, satisfying the equation for the m-th hexagonal number H_m = m(2m - 1) with m = 2^{p-1}.^[11] Each even perfect number is even and has exactly two distinct prime factors: 2 (with multiplicity p-1) and the Mersenne prime q.^[11] They end in either 6 or 8 in base 10; for example, 6 ends in 6, 28 in 8, 496 in 6, and 8128 in 8.^[3] The sum of the digits of even perfect numbers lacks a general closed-form formula. Representative examples include N_2 = 6 (digit sum 6) and N_3 = 28 (digit sum 10).^[11] No three even perfect numbers can be consecutive integers, as they are all even; the gaps between successive even perfect numbers grow exponentially with increasing p.^[11]

Odd Perfect Numbers

Existence and Impossibility Attempts

The existence of odd perfect numbers remains one of the most enduring open problems in number theory, with a prevailing conjecture that none exist, though this has neither been proven nor disproven.^[25] In the 18th century, Leonhard Euler made significant progress by demonstrating that if an odd perfect number exists, it must take the form N = p^k m^2, where p is a prime congruent to 1 modulo 4, k \equiv 1 \pmod{4}, and m is a positive integer not divisible by p.^[26] This structural constraint, known as the Eulerian form, has guided subsequent research by imposing necessary conditions on any potential odd perfect number.^[9] Early efforts to construct or refute odd perfect numbers included René Descartes' 1638 example of a "spoof" odd perfect number, $3^2 \cdot 7^2 \cdot 11^2 \cdot 13^2 \cdot 22021, which would be perfect if the composite factor 22021 (equal to $61 \cdot 19^2) were prime, highlighting the challenges in verifying such forms.^[27] In the 20th century, Jacques Touchard advanced the impossibility side by proving in 1953 that any odd perfect number must be congruent to 1 modulo 12 or 9 modulo 36, a result that underscores their rarity compared to even perfect numbers.^[28] Further heuristic arguments against existence emerged in the 1970s from Carl Pomerance, who developed a probabilistic model suggesting that no odd perfect number exists below $10^{300}, based on the expected distribution of the divisor sum function.^[29] Partial impossibility proofs have ruled out specific forms, such as Rudolf Steuerwald's 1937 demonstration that no odd perfect number can have all even exponents equal to 2 in its prime factorization.^[30] More recent theoretical work includes Pascal Ochem and Carl Pomerance's 2012 analysis, which established that any odd perfect number must have at least eight distinct prime factors, tightening constraints through sieve methods and bounds on the abundancy index. This was later improved to at least 10 distinct prime factors by Pace Nielsen in 2015.^[13]^[31] Additional attempts have explored implications from broader conjectures, such as connections to the ABC conjecture, which could impose further restrictions on the prime factors and growth of the divisor sum, though these remain conditional.^[32] Heuristically, if odd perfect numbers exist, results like Leonard Eugene Dickson's 1913 theorem imply there would be only finitely many with a fixed number of distinct prime factors, suggesting infinitely many overall but with density zero in the natural numbers.^[10] Computational searches have verified the absence of odd perfect numbers in ranges up to extremely large values, supporting these theoretical improbabilities.^[29]

Computational Bounds and Constraints

Extensive computational efforts have established stringent lower bounds on the magnitude of any odd perfect number. As of November 2025, no odd perfect number exists below $10^{2200}, with ongoing efforts targeting $10^{2300}, improving upon earlier bounds such as $10^{1500} established by Ochem and Rao in 2012 through systematic sieving and branching algorithms that rule out candidates by their prime factorizations.^[33]^[29] Structural constraints further limit the possible forms of odd perfect numbers, assuming Euler's form N = p^k m^2 where p is a prime congruent to 1 modulo 4 and k \equiv 1 \pmod{4}. Odd perfect numbers cannot be prime powers, as the abundancy index \sigma(N)/N = 2 would require incompatible divisor sums for powers of a single prime. Moreover, they must have at least 115 prime factors counting multiplicity (\Omega(N) \geq 115) and at least 10 distinct prime factors (\omega(N) \geq 10), with these bounds derived from inequalities on the abundancy via the multiplicativity of the divisor function \sigma; if not divisible by 3, the number of distinct primes rises to at least 12. Additionally, any odd perfect number must include a prime factor exceeding $10^8, ensuring significant sparsity in small factors.^[33]^[8]^[34] Computational searches have exhaustively verified the absence of odd perfect numbers up to extraordinarily large limits using the multiplicativity of \sigma to test candidates by decomposing them into potential Euler components and checking divisor sums. In the 1990s, Brent, Cohen, and te Riele pushed the bound beyond $10^{300} via tree-search algorithms that enumerate and eliminate forms incompatible with perfection. More recent distributed computing efforts, including the ongoing work documented on the LIRMM Odd Perfect Numbers page, have extended verifications to beyond $10^{1000}, with targets reaching $10^{2300} by November 2025 through parallel sieving of composite factors and abundancy bounds.^[35]^[29] Specific modular and divisibility constraints provide additional computational filters. Odd perfect numbers cannot be divisible by 105 ($3 \times 5 \times 7), a result stemming from exhaustive case analysis on small prime combinations that force the abundancy to deviate from 2. Recent advances, including 2023 preprints and unpublished extensions, have tightened unconditional bounds to over $10^{2000} in some sieving frameworks and conditional bounds approaching $10^{3000} assuming restrictions on the Euler prime, while confirming at least 10 distinct primes as a baseline. These results rely on optimized implementations of \sigma's multiplicativity to prune search spaces efficiently.^[36]^[37]^[38]

Broader Concepts

Classification of Numbers by Divisor Sums

Positive integers are classified according to the relationship between the sum of their divisors, denoted σ(n), and twice the number itself, 2n. A number n is deficient if σ(n) < 2n, perfect if σ(n) = 2n, and abundant if σ(n) > 2n. This classification positions perfect numbers as the boundary case in the spectrum of divisor sum abundance. For example, all prime numbers p are deficient since σ(p) = p + 1 < 2p, while 12 is the smallest abundant number with σ(12) = 28 > 24, and 6 and 496 are even perfect numbers satisfying σ(6) = 12 = 2×6 and σ(496) = 992 = 2×496.^[39] The abundance index, defined as h(n) = σ(n)/n, provides a normalized measure of this relationship, where deficient numbers have h(n) < 2, perfect numbers have h(n) = 2, and abundant numbers have h(n) > 2.^[40] Among abundant numbers, a primitive abundant number is one whose proper divisors are all deficient. The smallest primitive abundant number is 20.^[41] For instance, 18 is abundant with σ(18) = 39 > 36 but not primitive, as it has the perfect proper divisor 6.^[39] A related concept is the primitive pseudoperfect number, which belongs to the subset of abundant numbers known as pseudoperfect: those expressible as the sum of some (but not all) of their proper divisors. A primitive pseudoperfect number is pseudoperfect but has no proper divisors that are themselves pseudoperfect. The smallest such number is 6.^[42] Regarding distribution, nearly all positive integers are deficient, while the set of abundant numbers has a positive natural density bounded between 0.2474 and 0.2480, implying a density of approximately 0.2476.^[43] This density underscores that abundant numbers, including multiples of perfect numbers, form a substantial but minority portion of the integers.

Generalizations and Extensions

Multiperfect numbers generalize perfect numbers by requiring the sum of divisors function σ(n) to equal k n for some integer k > 1, where k=2 recovers the perfect case.^[44] For k=3, these are called triperfect numbers; the smallest is 120, with σ(120) = 360 = 3 × 120.^[45] As of 2023, exactly six triperfect numbers are known: 120, 672, 523776, 459818240, 1476304896, and 51001180160, all even and discovered through exhaustive computation up to bounds exceeding 10^{18}.^[46] For k=4, known as quadruperfect numbers, 36 are known, with the smallest being 30240, where σ(30240) = 120960 = 4 × 30240; these were fully enumerated by 1929.^[46] Higher k yield more examples: 65 quintuplerfect (k=5) numbers are known, starting at 14182439040, and the counts increase rapidly, with over 2000 for k=9, reflecting computational searches that have identified thousands across k up to 11.^[46] Hyperperfect numbers extend the divisor sum concept iteratively, defining a k-hyperperfect number n as one satisfying n = 1 + k (σ(n) - n - 1), which for k=1 reduces to the perfect number condition σ(n) = 2n.^[47] Unlike multiperfect numbers, which scale the total divisor sum linearly, hyperperfect numbers involve a specific adjustment accounting for proper divisors excluding 1 and n. All even perfect numbers are 1-hyperperfect, but hyperperfect numbers are more abundant; for example, 21 is 2-hyperperfect since σ(21) = 32 and 21 = 1 + 2(32 - 21 - 1). Infinite families exist, such as for odd k where n = p^{k} (p prime) or products of primes, and computations have identified millions below 10^{12}.^[47] Harmonic divisor numbers, also known as Ore numbers, generalize perfect numbers through the harmonic mean of divisors: a number n is harmonic divisor if the harmonic mean d(n) n / σ(n) is an integer, where d(n) is the number of divisors. For perfect numbers, this mean equals d(n)/2, which is integer since even perfect numbers have an even number of divisors. The smallest non-trivial examples include 6 and 28 (perfect), but also 140, where the harmonic mean is 6; over 10,000 such numbers are known below 10^6, often sharing properties with abundant or deficient numbers but unified by this mean condition.^[48] Weird numbers provide a contrasting extension, defined as abundant numbers (σ(n) > 2n) that are not pseudoperfect, meaning no subset of their proper divisors sums exactly to n. The smallest is 70, with proper divisors summing to 74 > 70 but no combination equaling 70; unlike pseudoperfect numbers (which include all perfect and some abundant), weird numbers resist subset sums to their value. Only even weird numbers are known, with 29 primitive weird numbers below 10^8, and it remains open whether odd ones exist.^[49] Sociable numbers extend amicable pairs (2-cycles in aliquot sequences, where σ(a) - a = b and σ(b) - b = a) to longer cycles of length greater than 2, where the aliquot parts cycle through a sequence returning to the start. The smallest sociable cycle of length 4 is 1264460 → 1547860 → 1727636 → 1305184 → 1264460; longer cycles, up to length 28, have been discovered computationally, with all known examples even and abundant on average. No odd multiperfect numbers greater than 1 are known, and partial results establish stringent lower bounds: any odd perfect number (k=2) must exceed 10^{1500} and have at least 9 distinct prime factors if it exists.^[50] These bounds arise from constraints on the Euler prime factor and overall abundancy, with no odd examples found despite extensive computational searches.

References

[1]
[PDF] Perfect Numbers
Jun 20, 2008 · A perfect number n is a number whose positive divisors (sans the number itself) sum to n. Equivalently, if we consider n to be a divisor of ...
[2]
[PDF] Perfect Numbers and Mersenne Primes
Important Definition: A perfect number is a a positiv integer that equals to the sum of its proper divisors. (Or half the sum of all its divisors, i.e. σ(n) = ...
[3]
[PDF] The oldest open problem in mathematics
Dec 2, 2007 · A natural number n for which the sum of proper divisors is n is called a perfect number. So, 6 is a perfect number. All presently known perfect ...
[4]
The Mysterious Math of Perfection | Quanta Magazine
Mar 15, 2021 · Euclid laid out the basics of perfect numbers over 2,000 years ago, and he knew that the first four perfect numbers were 6, 28, 496 and 8,128.
[5]
A Perfect Collaboration - Science News
Jan 13, 2003 · In 1747, Euler proved the partial converse of Euclid's theorem: All even perfect numbers must have the form specified by Euclid's formula.
[6]
List of known Mersenne prime numbers - PrimeNet
List of all known Mersenne prime numbers along with the discoverer's name, dates of discovery and the method used to prove its primality.
[7]
[PDF] Euler and the Ongoing Search for Odd Perfect Numbers
Euler established a basic factorization pattern that every odd perfect number must have, and mathematicians have expanded upon this Eulerian form ever since.
[8]
[PDF] odd perfect numbers have at least nine distinct prime factors
Abstract. An odd perfect number, N, is shown to have at least nine distinct prime factors. If 3 \ N then N must have at least twelve distinct prime divisors. ...
[9]
Perfect Number -- from Wolfram MathWorld
Perfect numbers are positive integers n such that n=s(n), (1) where s(n) is the restricted divisor function (i.e., the sum of proper divisors of n), ...
[10]
Perfect numbers - MacTutor History of Mathematics
It is not known when perfect numbers were first studied and indeed the first studies may go back to the earliest times when numbers first aroused curiosity.
[11]
Spoof odd perfect numbers - American Mathematical Society
Oct 25, 2013 · Notice that σ1(n) = σ(n) is the usual sum of divisors function, and n is a perfect number if and only if σ(n)=2n, or equivalently σ−1(n) = 2.
[12]
Divisor Function -- from Wolfram MathWorld
The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k.Missing: authoritative source
[13]
Euclid's Elements, Book IX, Proposition 36 - Clark University
The four smallest perfect numbers, 6, 28, 496, and 8128, were known to the ancient Greek mathematicians. The Mersenne primes 2p – 1 corresponding to these four ...
[14]
[PDF] Section 8. Perfect Numbers
Apr 3, 2022 · In. 1732 Euler was the next to give a new perfect number (the first in 125 years); he proved that 230(231 − 1) = 2,305,843,008,139,952,128 is ...
[15]
[PDF] Iamblichus - The theology of arithmetic
the four perfect numbers which subsist within the decad and are progressively equal to the numbers which run in unbroken se- quence from the monad to the ...
[16]
[PDF] NOTE Notes On Thabit ibn Qurra and His Rule for Amicable Numbers
Two numbers n and m are called amicable if n is the sum of the proper divisors of m and at the same time m is the sum of the proper divisors of n.
[17]
[PDF] On a Proof of the Th¯abit Ibn Qurra's Generalization of the ...
A remarkable formula for amicable numbers (see [20]) is attributed to him. In Euclidean geometry, among other investigations, the researcher presented different ...
[18]
[PDF] Fibonacci's Liber Abaci - mifami.org
another perfect number, namely 496, and always doing thus you will be able to find perfect numbers without end. How Many Pairs of Rabbits Are Created byOne ...
[19]
[PDF] Perfect numbers and Mersenne primes - Keith Conrad
Feb 15, 2025 · The verification by Lehmer in 1930 that Mersenne's last example 2257−1 is composite, but without factoring it, took hundreds of hours with a ...
[20]
[PDF] On prime numbers and perfect numbers - OEIS
JACQUES TOUCHARD. 39. THEOREM: If odd perfect numbers exist, they are of the forms 12m +1 or 36m+9. 4. Consequences of Eq. (7). The results of the theorem are ...Missing: probabilistic estimate density
[21]
[PDF] Odd perfect numbers are greater than 101500 - LIRMM
This paper provides a unified framework to obtain lower bounds on three pa- rameters of an odd perfect number. The most useful new tool is the way to get ...
[22]
[PDF] An Extension of the Euclid-Euler Theorem to Certain α-Perfect ...
Oct 14, 2022 · Abstract. In a posthumously published work, Euler proved that all even perfect numbers are of the form 2p-1(2p −1), where 2p −1 is a prime ...Missing: sources | Show results with:sources
[23]
Mersenne Prime Number discovery - 2 136279841 -1 is Prime!
Mersenne Prime Number discovery - 2136279841-1 is Prime! · GIMPS Discovers Largest Known Prime Number: 2136,279,841-1.
[24]
[PDF] Odd perfect numbers are divisible by at least seven distinct primes
Odd perfect numbers are divisible by at least seven distinct primes. No odd perfect numbers are known, but no proof of their non-existence has been found.
[25]
[1706.02144] On Dris Conjecture about Odd Perfect Numbers - arXiv
Jun 7, 2017 · The Euler's form of odd perfect numbers, if any, is n=\pi^{\alpha}N^2, where \pi is prime, (\pi,N)=1 and \pi\equiv \alpha \equiv 1 \pmod{4}.
[26]
[2006.10697] Odd, spoof perfect factorizations - arXiv
Jun 18, 2020 · These solutions generalize the example, found by Descartes in 1638, of an odd, ``spoof'' perfect factorization 3^2\cdot 7^2\cdot 11^2\cdot 13^2 ...<|separator|>
[27]
A Theorem of Touchard on the Form of Odd Perfect Numbers - jstor
a(n)= d + 0(mod4). used to prove Touchard's theorem. 36m + 9. It is worth emphasizing how simple Touchard's theorem really is.
[28]
Odd perfect numbers - LIRMM
We consider an odd perfect number ... 2025) t1600 (2/2025) t2300 (2/2025) tXXXX contains composite numbers encountered when targetting the lower bound 10XXXX.
[29]
[PDF] on the nonexistence of odd perfect numbers - John Voight
We define the abundance of n to be h(n) = σ(n)/n. Proposition 2.2. Suppose p, q are prime. The function h satisfies: Page 3. ODD PERFECT NUMBERS. 3. (a) h is ...
[30]
Algebraic Attacks on the Odd Perfect Number Problem - MathOverflow
Sep 20, 2010 · The only compelling argument I've seen on this front is "Pomerance's heuristic" (also described on oddperfect.org). Worse, and maybe this is ...What is the latest progress in the research on Odd Perfect numbers?Conjecture on odd perfect numbers - MathOverflowMore results from mathoverflow.net
[31]
odd perfect numbers are greater than 101500
Jan 30, 2012 · Theorem 2. The total number of prime factors of an odd perfect number is at least 101. We use the following contradictions: - The abundancy of ...
[32]
[PDF] odd perfect numbers, diophantine equations, and upper bounds
We obtain a new upper bound for odd multiperfect numbers. If N is an odd perfect number with k distinct prime divisors and P is its largest prime divisor, we ...
[33]
[PDF] On the number of prime factors of an odd perfect number - LIRMM
For an odd perfect number N, the total prime factors (Ω(N)) are proven to be greater than or equal to (18ω(N) - 31)/7 and 2ω(N) + 51.Missing: Pomerance | Show results with:Pomerance
[34]
[PDF] improved techniques for lower bounds for odd perfect numbers
If N is an odd perfect number, and qk k N, q prime, k even, then it is almost immediate that N >q2k . We prove here that, subject to certain conditions veri ...Missing: 2023 Ochem
[35]
odd perfect numbers have at least nine distinct prime factors
May 9, 2007 · Abstract. An odd perfect number, N, is shown to have at least nine distinct prime factors. If 3 N then N must have at least twelve distinct ...
[36]
[PDF] Lower bounds on odd perfect numbers - LIRMM
Lower bounds on odd perfect numbers. Pascal Ochem, Michaël Rao. Montpellier 02/07/2014. Page 2. Perfect numbers. • A number equal to the sum of its proper ...
[37]
A Note on Odd Perfect Numbers[v4] - Preprints.org
This paper makes significant progress on this ancient conjecture by presenting a rigorous proof by contradiction that odd perfect numbers not divisible by 3 ...Missing: implications | Show results with:implications
[38]
[PDF] The distribution of abundant numbers - Paul Pollack
Oct 24, 2013 · Among simple even numbers, some are superabundant, others are deficient: these two classes are as two extremes opposed one to the other;.
[39]
[PDF] Measuring the Abundancy of Integers
Measuring the Abundancy of Integers. Author(s): Richard Laatsch. Source: Mathematics Magazine, Vol. 59, No. 2 (Apr., 1986), pp. 84-92. Published by ...
[40]
On primitive abundant numbers
An a-nondeficient number is said to be primitive if all its proper divisors are a-deficient. The basic result of this paper is a lemma giving new necessary and ...Missing: definition | Show results with:definition<|control11|><|separator|>
[41]
[PDF] On Weird and Pseudoperfect Numbers
It is primitive pseudoperfect if it is pseudoperfect but none of its proper divisors are pseudoperfect. An integer n is called weird if n is abundant but not ...
[42]
Bounds for the density of abundant integers - Project Euclid
We say that an integer n n is abundant if the sum of the divisors of n n is at least 2n 2 n . It has been known [wall71] that the set of abundant numbers ...
[43]
Multiperfect Number -- from Wolfram MathWorld
A number n is k-multiperfect (also called a k-multiply perfect number or k-pluperfect number) if sigma(n)=kn for some integer k>2, where sigma(n) is the ...Missing: smallest | Show results with:smallest
[44]
A005820 - OEIS
3-perfect (triply perfect, tri-perfect, triperfect or sous-double) numbers: numbers such that the sum of the divisors of n is 3n. (Formerly M5376). 114. 120, ...
[45]
The Multiply Perfect Numbers Page
A multiply perfect number is called proper if its abundancy is > 2. For example consider the divisors of the number 120: 1+2+3+4+5+6+8+10+12+15+ ...
[46]
Hyperperfect Number -- from Wolfram MathWorld
If is an odd integer, and and are prime, then is -hyperperfect. McCranie (2000) conjectures that all -hyperperfect numbers for odd are in fact of this form. ...Missing: definition | Show results with:definition
[47]
Harmonic Divisor Number -- from Wolfram MathWorld
A number n for which the harmonic mean of the divisors of n, i.e., nd(n)/sigma(n), is an integer, where d(n)=sigma_0(n) is the number of positive integer ...
[48]
Weird Number -- from Wolfram MathWorld
A "weird number" is a number that is abundant (ie, the sum of proper divisors is greater than the number) without being pseudoperfect.
[49]
Odd Perfect Number -- from Wolfram MathWorld
To this day, it is not known if any odd perfect numbers exist, although numbers up to 10^(1500) have been checked without success.