Math 2.0

Number theory Definition

Perfect number

Builds on Sum of divisors

Definition

A positive integer nn is perfect if it is equal to the sum of its positive divisors other than nn. Equivalently, σ(n)=2n\sigma(n) = 2n, where σ\sigma is the sum of divisors.

Remarks

The first perfect numbers are 66, 2828, 496496 and 81288128. For example, 28=1+2+4+7+1428 = 1 + 2 + 4 + 7 + 14. The Euclid–Euler theorem describes all even perfect numbers by Mersenne primes. No odd perfect number is known, and it is an open problem whether one exists.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Arithmetic function definition
  2. Divisibility definition
  3. Divisors of a natural number definition
  4. Divisor function definition
  5. Sum of divisors definition
  6. Perfect number definition

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Perfect_number, lead section
About this page
Tag0SB7Q8SYSF
URIm2://0SB7Q8SYSF
Kinddefinition
WritingW1 stated
MSC11A25
DefinesPerfect number
UsesSum of divisors

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by