ZCubes/Mersenne Primes and Perfect Numbers - Revision history

Jayaram: /* Code */

2021-03-11T06:19:34Z

Code

Swapna: /* Code */

2020-03-31T08:44:55Z

Code

Devika: /* Video */

2020-03-24T08:34:31Z

Video

Jayaram: Created page with "==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 som..."

2020-03-12T07:48:43Z

Created page with "==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 som..."

New page

==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==
 
{{#ev:youtube|31kQnKmji18|480|left|Mersenne Primes and Perfect Numbers}}
 

<<[[Learn_ZCubes | Learn ZCubes ]]
 
© Copyright 1996-2020, ZCubes, Inc.

@@ Line 26: / Line 26: @@
   [3,7,31,127,8191,131071].$("x*(x+1)/2")
 <br/>
-&copy; Copyright 1996-2020, ZCubes, Inc.
+*[[Z3 | Z3 home]]

@@ Line 13: / Line 13: @@
   a.$(x=>[x,x-1n,(ISPRIME(x<>n-1n))])
     .filter(r=>r[0][2])
 ..10000
     .filter(n=>SUM(PROPERDIVISORS(n))==n)
- [3,7,31,127,8191,131071].$(""x*(x+1)/2"")"
+<br/>Relationship between Mersenne Primes and Perfect Numbers:
 <<[[Learn_ZCubes | Learn ZCubes ]]
 <br/>
 &copy; Copyright 1996-2020, ZCubes, Inc.

← Older revision		Revision as of 08:34, 24 March 2020
Line 8:		Line 8:
	<br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/>		<br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/>

		+	==Code==
		+	a=2n^(1..700);
		+	units.on;
		+	a.$(x=>[x,x-1n,(ISPRIME(x<>n-1n))])
		+	.filter(r=>r[0][2])
		+
		+	1..10000
		+	.filter(n=>SUM(PROPERDIVISORS(n))==n)
		+
		+	[3,7,31,127,8191,131071].$(""x*(x+1)/2"")"

ZCubes/Mersenne Primes and Perfect Numbers - Revision history

Jayaram: /* Code */

Swapna: /* Code */

Devika: /* Video */

Jayaram: Created page with "==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 som..."

Jayaram: Created page with "==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 som..."