Perfect number¶

Classify a positive integer as perfect when the sum of all its proper positive divisors equals the integer itself, equivalently when its divisor-sum is exactly twice the integer.

Version: v2 · 2026-08-30 · History
Domain-specific #: 2467
Origin domain: number theory
Subdomain: divisor sums and multiplicative arithmetic

Core Idea¶

A perfect number is a positive integer \(n\) satisfying \(s(n)=n\), where \(s(n)\) sums the positive proper divisors of \(n\); equivalently, \(\sigma(n)=2n\).^[1]^[1] Prime factorization makes the divisor-sum function multiplicative, converting the balance condition into arithmetic restrictions; in the even case this yields exactly the Euclid-Euler form built from a Mersenne prime, while the odd case remains constrained but unresolved.

Its autonomous residual is the exact self-balance of one positive integer under the proper-divisor sum, not numerical aesthetic perfection, near equality, a multiperfect ratio other than two, an amicable cycle, or possession of many divisors. The identity fails when only a subset of proper divisors is summed, zero or negative divisors enter, the Euclid-Euler form is asserted for hypothetical odd cases, probable primality is treated as proof, an absence of found examples becomes nonexistence, or time-sensitive record counts are made definitional.

Recognition requires an analyst to factor the integer or otherwise certify every divisor contribution, state whether the number itself is included, check the exact equality, use the Euclid-Euler theorem only for even integers, and label the existence of odd perfect numbers as open. Once established, it supports studying multiplicative functions, linking even perfect numbers with Mersenne primes, organizing aliquot sequences, comparing deficient and abundant integers, and testing necessary conditions in the odd case without turning those uses into the definition.

Structural Signature¶

Carrier: a positive integer \(n\), its positive divisors, the proper-divisor sum \(s(n)\), and the divisor-sum function \(\sigma(n)\)
Inputs or antecedent state: integer, positive-divisor convention, inclusion or exclusion of the integer itself, prime factorization, divisor-sum function, parity, Mersenne-prime condition, and proof status of any existence claim
Constitutive operation: Prime factorization makes the divisor-sum function multiplicative, converting the balance condition into arithmetic restrictions; in the even case this yields exactly the Euclid-Euler form built from a Mersenne prime, while the odd case remains constrained but unresolved
Invariant: the complete set of positive divisors is accounted for under one convention and its sum satisfies the exact equality \(\sigma(n)=2n\)
Recognition test: factor the integer or otherwise certify every divisor contribution, state whether the number itself is included, check the exact equality, use the Euclid-Euler theorem only for even integers, and label the existence of odd perfect numbers as open
Output or consequence: studying multiplicative functions, linking even perfect numbers with Mersenne primes, organizing aliquot sequences, comparing deficient and abundant integers, and testing necessary conditions in the odd case
Failure boundary: only a subset of proper divisors is summed, zero or negative divisors enter, the Euclid-Euler form is asserted for hypothetical odd cases, probable primality is treated as proof, an absence of found examples becomes nonexistence, or time-sensitive record counts are made definitional

What It Is Not¶

It is not the whole field of number theory; many objects in that field do not satisfy its constitutive rule.
It is not its canonical example. The positive proper divisors of 6 are 1, 2, and 3, whose sum is 6; equivalently, all positive divisors sum to 12. That is an instance, not a definition.
It is not Abundant and deficient numbers. Those classes use the same proper-divisor sum but replace equality by greater-than or less-than comparisons. Perfect numbers occupy the exact boundary between the two inequalities.
It is not an unrestricted metaphor. No odd perfect number is known and nonexistence has not been proved; research establishes necessary factorization and size constraints, so every claim about the odd branch must preserve quantifiers and publication dates

Scope of Application¶

Perfect number applies when the analyst can specify a positive integer \(n\), its positive divisors, the proper-divisor sum \(s(n)\), and the divisor-sum function \(\sigma(n)\) and establish that the complete set of positive divisors is accounted for under one convention and its sum satisfies the exact equality \(\sigma(n)=2n\). The entry gives mathematical definitions and theorem status, not a search recipe. Counts of known examples, largest records, and computational lower bounds are time-indexed evidence rather than identity-bearing facts.^[2]

Recognition. factor the integer or otherwise certify every divisor contribution, state whether the number itself is included, check the exact equality, use the Euclid-Euler theorem only for even integers, and label the existence of odd perfect numbers as open
Comparison. Compare legitimate instances through divisor convention, parity, prime factorization, sigma value, aliquot sum, Mersenne exponent, primality certificate, odd-case necessary conditions, computational bound, and publication date.
Boundary. No odd perfect number is known and nonexistence has not been proved; research establishes necessary factorization and size constraints, so every claim about the odd branch must preserve quantifiers and publication dates
Use. Preserve every assumption when using the identity for studying multiplicative functions, linking even perfect numbers with Mersenne primes, organizing aliquot sequences, comparing deficient and abundant integers, and testing necessary conditions in the odd case.

Clarity¶

A clear claim names the carrier, governing rule, assumptions, and recognition test. This matters because perfect is evaluative in ordinary language, while divisor sums may include or exclude the integer and related literatures use multiply perfect, semiperfect, and unitary-perfect variants. The disciplined statement is that the object counts as Perfect number exactly when the complete set of positive divisors is accounted for under one convention and its sum satisfies the exact equality \(\sigma(n)=2n\)

Identity and measurement remain separate. For modest inputs, exact factorization and multiplicativity certify the equality; large claims require auditable primality and arithmetic certificates, and finite search cannot settle existence of an odd example. Approximation or noisy evidence may weaken a classification without changing its definition.

Manages Complexity¶

The abstraction compresses even perfect numbers, hypothetical odd perfect numbers, base representations, aliquot fixed points, semiperfect and multiperfect generalizations, Mersenne-prime constructions, and computational searches into a stable carrier, rule, invariant, and failure boundary. It makes comparison tractable while retaining the variables that control validity.

Compression can hide assumptions. A responsible use therefore declares divisor convention, parity, prime factorization, sigma value, aliquot sum, Mersenne exponent, primality certificate, odd-case necessary conditions, computational bound, and publication date and returns to the full diagnostic whenever a convention or boundary case changes.

Abstract Reasoning¶

Type the carrier. Establish a positive integer \(n\), its positive divisors, the proper-divisor sum \(s(n)\), and the divisor-sum function \(\sigma(n)\) and reject examples from a different problem.
Lock the rule. Express that the complete set of positive divisors is accounted for under one convention and its sum satisfies the exact equality \(\sigma(n)=2n\) independently of one notation or implementation.
Derive carefully. Infer studying multiplicative functions, linking even perfect numbers with Mersenne primes, organizing aliquot sequences, comparing deficient and abundant integers, and testing necessary conditions in the odd case only under the stated assumptions.
Stress-test. Contrast the legitimate boundary case—No odd perfect number is known and nonexistence has not been proved; research establishes necessary factorization and size constraints, so every claim about the odd branch must preserve quantifiers and publication dates—with this counterexample: twelve is abundant because its proper divisors sum to sixteen, so having many divisors and exceeding the target is not approximate membership in the exact perfect-number class.

Knowledge Transfer¶

Transfer within number theory is strong when new cases preserve the same carrier, mechanism, and diagnostic. The move from The positive proper divisors of 6 are 1, 2, and 3, whose sum is 6; equivalently, all positive divisors sum to 12. to The Euclid-Euler theorem states that every even perfect number, and only an even perfect number, has form \(2^{p-1}(2^p-1)\) with \(2^p-1\) prime. demonstrates that continuity.^[3]

Outside the domain, only the skeleton—select objects that remain exactly balanced when a declared aggregation rule is applied to all of their proper internal contributors—travels automatically. The terms proper divisor, aliquot sum, divisor-sum function, sigma, Mersenne prime, Euclid-Euler theorem, abundant, deficient, multiplicative function, and odd perfect number retain domain-specific meanings, so every role and inference must be revalidated.

Examples¶

Canonical¶

The positive proper divisors of 6 are 1, 2, and 3, whose sum is 6; equivalently, all positive divisors sum to 12. The example exhibits the equality directly and also matches the even form with exponent two because three is a Mersenne prime.^[2] It is canonical because the carrier, rule, invariant, and consequence are all inspectable.^[1]

Mapped back: a positive integer \(n\), its positive divisors, the proper-divisor sum \(s(n)\), and the divisor-sum function \(\sigma(n)\) → Prime factorization makes the divisor-sum function multiplicative, converting the balance condition into arithmetic restrictions; in the even case this yields exactly the Euclid-Euler form built from a Mersenne prime, while the odd case remains constrained but unresolved → the complete set of positive divisors is accounted for under one convention and its sum satisfies the exact equality \(\sigma(n)=2n\) → studying multiplicative functions, linking even perfect numbers with Mersenne primes, organizing aliquot sequences, comparing deficient and abundant integers, and testing necessary conditions in the odd case

Applied / In Practice¶

The Euclid-Euler theorem states that every even perfect number, and only an even perfect number, has form \(2^{p-1}(2^p-1)\) with \(2^p-1\) prime. The primality condition is load-bearing and the theorem classifies the even branch only; it neither proves infinitely many Mersenne primes nor settles odd perfect numbers.^[1] It qualifies only after the same diagnostic and failure boundary are checked.^[2]

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Exact identity vs. practical recognition. The constitutive condition may be exact while evidence is indirect. Diagnostic: Can the reviewer state both the condition and the warrant?
T2: Canonical form vs. variants. even perfect numbers, hypothetical odd perfect numbers, base representations, aliquot fixed points, semiperfect and multiperfect generalizations, Mersenne-prime constructions, and computational searches can preserve or change the identity. Diagnostic: Which named role is invariant across the variants?
T3: Compression vs. hidden assumptions. The label is useful only while prerequisites remain visible. Diagnostic: Can each downstream inference be traced to a declared assumption?
T4: Autonomy vs. reduction. The candidate uses broader structures but claims the exact self-balance of one positive integer under the proper-divisor sum, not numerical aesthetic perfection, near equality, a multiperfect ratio other than two, an amicable cycle, or possession of many divisors. Diagnostic: Does that residual still support independent recognition after the parent and neighbors are subtracted?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is select objects that remain exactly balanced when a declared aggregation rule is applied to all of their proper internal contributors; its identity-bearing terms are proper divisor, aliquot sum, divisor-sum function, sigma, Mersenne prime, Euclid-Euler theorem, abundant, deficient, multiplicative function, and odd perfect number. Those terms determine admissible objects, evidence, and consequences inside number theory.

Structural Core vs. Domain Accent¶

The structural core is a carrier governed by Prime factorization makes the divisor-sum function multiplicative, converting the balance condition into arithmetic restrictions; in the even case this yields exactly the Euclid-Euler form built from a Mersenne prime, while the odd case remains constrained but unresolved and tested by factor the integer or otherwise certify every divisor contribution, state whether the number itself is included, check the exact equality, use the Euclid-Euler theorem only for even integers, and label the existence of odd perfect numbers as open. The domain accent is constitutive rather than decorative, so an analogy that preserves only the skeleton is not another instance of Perfect number.

The proposed strict upward parent is prime:constraint. Perfection is literally the feasible class cut out from positive integers by the checkable equality sigma(n)=2n; divisor arithmetic and the even-odd theory provide the autonomous specialization. The edge is proposal-only and points to a frozen prior-baseline Prime.

The entry does not collapse into the parent because the exact self-balance of one positive integer under the proper-divisor sum, not numerical aesthetic perfection, near equality, a multiperfect ratio other than two, an amicable cycle, or possession of many divisors A thematic neighbor is declined whenever it does not literally subsume that rule.

The prospective workspace queue contains one strict upward edge to prime:constraint. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Perfect number Domain-specific

Parents (1) — more general patterns this builds on

Perfect number is a kind of Constraint Prime

The proposed strict upward parent is prime:constraint.

Hierarchy path (1) — routes to 1 parentless root

Perfect number → Constraint

Neighborhood in Abstraction Space¶

Perfect number sits in a crowded region of the domain-specific corpus (25^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Integer Functions & Special Numbers (13 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Semiperfect number. Equals a sum of some proper divisors; requiring all proper divisors gives the perfect special case.
Multiperfect number. Satisfies sigma(n)=kn for an integer k, with perfect numbers corresponding specifically to k=2.
Amicable numbers. Two different integers are each other's proper-divisor sums rather than one being its own.
Mersenne prime. A prime of form 2^p-1 that generates an even perfect number after multiplication by 2^(p-1), not itself generally a perfect number.

References¶

[1] G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6^th ed., revised by D. R. Heath-Brown and J. H. Silverman, Oxford University Press, 2008, theorem 276 and surrounding discussion, ISBN 978-0-19-921986-5. registry ↩a ↩b ↩c ↩d

[2] Euclid, Elements, Book IX, Proposition 36, in The Thirteen Books of Euclid's Elements, translated with commentary by Thomas L. Heath, 2^nd ed., Dover, 1956, ISBN 978-0-486-60089-5. registry ↩a ↩b ↩c

[3] S. Adam Fletcher, Pace P. Nielsen, and Pascal Ochem, 'Sieve Methods for Odd Perfect Numbers,' Mathematics of Computation 81(279), 1753–1776 (2012), DOI 10.1090/S0025-5718-2011-02576-7. registry ↩