# reading questions #3 - However, that's not all true....

This preview shows page 1. Sign up to view the full content.

Paul Robison Read the rest of Chapter 1, pages 33-50, and send your answers to these questions before Monday, September 17. 1. If p is an odd prime, what can we say about 2^(p-1)-1 ? 2. What is a Mersenne prime? Look up the Mersenne prime search (GIMPS) online. Have there been any new developments since 1998? 3. The formula on p.49 should look familiar. Summarize how the technique of induction proves this result, and feel free to use dominoes as a metaphor. 1. If the answer is anything but 1, p cannot be prime.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: However, that's not all true. 2p-1_=1(mod p) whenever p is prime, also has some non-prime numbers that would answer this problem. 2. The Mersenne Prime is the largest prime number at the time of discovery. Since 1998 there have been seven new mersenne primes found, one every year, except in 2000, and two in 2005. 3. Establish a pattern with set stipulations and, if this pattern, such as P(n), works with any natural number, then the pattern is true for every computable natural number as well....
View Full Document

## This note was uploaded on 04/29/2008 for the course REL 100 taught by Professor Depends during the Spring '08 term at Augsburg.

Ask a homework question - tutors are online