You're reading: Aperiodvent

Aperiodvent, Day 2: The Euclid-Euler Theorem

Today’s entry is a Theorem of the Day:

The Euclid-Euler Theorem:

An even positive integer is a perfect number, that is, equals the sum of its proper divisors, if and only if it has the form $2^{n−1}(2^n − 1)$, for some n such that $2^n − 1$ is prime.

This theorem describes the relationship between perfect numbers and Mersenne primes. For more information, see the full listing at Theorem of the Day: the Euclid-Euler Theorem.

This is part of the Aperiodical Advent Calendar. We’ll be posting a new surprise for you each morning until Christmas!

One Response to “Aperiodvent, Day 2: The Euclid-Euler Theorem”

  1. Avatar prof prem raj pushpakaran

    prof prem raj pushpakaran writes — let us celebrate eDay (Euler’s number or Napier’s constant) on February 7 !!!!


(will not be published)

$\LaTeX$: You can use LaTeX in your comments. e.g. $ e^{\pi i} $ for inline maths; \[ e^{\pi i} \] for display-mode (on its own line) maths.

XHTML: You can use these tags: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>