Sieve Methods for Odd Perfect Numbers

Fletcher, S. A., Nielsen, P. P., & Ochem, P. (2012). Sieve Methods for Odd Perfect Numbers. Mathematics of Computation, 81(279), 1753-1776.

Type

Journal article

Intellectual base

Primary research

Year

2012

DOI

10.1090/s0025-5718-2011-02576-7

Link

https://doi.org/10.1090/s0025-5718-2011-02576-7

Cited by

1 citation across 1 artifact.

Domain-specific

• Perfect number
  • 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.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:6dc90e5386bf · see in the full table