Perfect number
Builds on Sum of divisors
Definition
A positive integer is perfect if it is equal to the sum of its positive divisors other than . Equivalently, , where is the sum of divisors.
Remarks
The first perfect numbers are , , and . For example, . 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
- no evidence level
- Arithmetic function definition
- Divisibility definition
- Divisors of a natural number definition
- Divisor function definition
- Sum of divisors definition
- Perfect number definition
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Perfect_number, lead section
About this page
| Tag | 0SB7Q8SYSF |
|---|---|
| URI | m2://0SB7Q8SYSF |
| Kind | definition |
| Writing | W1 stated |
| MSC | 11A25 |
| Defines | Perfect number |
| Uses | Sum 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.