Mersenne Primes

Determine whether m_13 = 2^13 - 1 = 8191 and m_23 = 2^23 -1 = 8388607 are prime.

A detailed solution explaining Euler's method of primality testing for Mersenne and Fermat numbers is given.

What is this?

By OTA - Overall OTA Rating

Purchase Cost Now

$2.19 CAD (was ~$3.99)

Included in Download

Why you can trust BrainMass.com

Combinatorial and Computational Number Theory Fermat's Little Theorem Greatest Common Divisor - See attached file for full problem description. ...
Euler Totient Function (Six Problems) - For this problem it helps to know that: 3x7x13 = 273 (a) Define the Euler Totient function, (SYMBOL) For (b) to (f) please see attached. (PLEASE SEE ATTACHMENT FOR COMPLETE PROBLEM AND PROPER SYM ...
Proof using the Euler Function - Use the formula for ø(n) to find all positive integers n such that ø(n)=6 .
Mobius Functions, Euler Functions and Carmicheal's Conjecture - 1) Prove that in is a positive integer. ( : is the Mobius function) Hint: one of the four argument is divisible by 4. 2) If is a prime and . Show that ( : is the Euler function) 3) ...
If R is a unique factorization domain and if a,b are in R, then a and b have a greatest common divisor (a,b) in R. - Modern Algebra Ring Theory (XLIV) Unique Factorization Domain Greatest Common Divisor Relatively Prime Elements Integral Domain Irreducible Elements If R is a unique factorization domain ...