ZCubes/Mersenne Primes and Perfect Numbers

From ZCubes Wiki
Revision as of 02:48, 12 March 2020 by Jayaram (talk | contribs) (Created page with "==Mersenne Primes and Perfect Numbers== <br/> Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form 2n − 1 for som...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Mersenne Primes and Perfect Numbers


Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form 2n − 1 for some integer n. There are also connected to perfect numbers. The largest known prime number, 282,589,933 − 1, is a Mersenne prime. Finding Mersenne prime and validating it is a computation intensive task. This video demonstrates how to generate Mersenne primes using ZCubes, and will also explore the relationship with Perfect numbers.

Video


Mersenne Primes and Perfect Numbers















<< Learn ZCubes
© Copyright 1996-2020, ZCubes, Inc.

Retrieved from "http://wiki.zcubes.com/index.php?title=ZCubes/Mersenne_Primes_and_Perfect_Numbers&oldid=213160"