Difference between revisions of "ZCubes/How to Apply Mersenne Primes and Perfect Numbers"
Jump to navigation
Jump to search
(Created page with "==How to Apply 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...") |
(→Video) |
||
| Line 10: | Line 10: | ||
| − | |||
<br/> | <br/> | ||
| + | *[[Z3 | Z3 home]] | ||
| + | *[[Z^3 Language Documentation]] | ||
| + | *[[ZCubes_Videos | ZCubes Videos and Tutorials]] | ||
| + | *[[Main_Page | About ZCubes ]] | ||
| + | <br/> | ||
| + | <br/> | ||
| + | |||
© Copyright 1996-2020, ZCubes, Inc. | © Copyright 1996-2020, ZCubes, Inc. | ||
Latest revision as of 12:47, 14 September 2021
How to Apply 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
© Copyright 1996-2020, ZCubes, Inc.