header.gif (7655 bytes)

 

 
























header_prime_numbers.gif

Prime numbers are numbers that are only divisible by themselves and one. Ancient Greek mathematicians first studied them. Euclid proved that there are infinite prime numbers. In the "Fundamental Theorem of Arithmetic", Euclid prooved that every integer can be written as a product of primes.

Prime NumbersDuring the beginning of the 17th century, Fermat proved that every prime number of the form 4n + 1 could be written as the sum of two squares. Fermat also stated that the numbers 2n + 1 are always prime if n is a power of 2. Numbers that have this property were called Fermat numbers. After 100 years, Euler prooved that this formula does not always work because 232 + 1 is equal to 4,294,967,297, which is not prime (it is divisible by 641).

Marin Mersenne studied numbers of the form 2n – 1. They were named after him. Mersenne numbers were not always prime. So far, 37 Mersenne numbers have been found. The largest prime number is 23,021,377 - 1, which was found by Ronald H. Clarkson, a sophomore at California State University Dominguez Hills. The 37th Mersenne prime has 909,526 digits.

Some questions are still unanswered that relate to prime numbers:

  1. The Twin Primes Conjecture that there are infinitely many pairs of primes only 2 apart.
  2. Goldbach’s Conjecture that every integer greater than two can be written as the sum of two primes.
  3. Are there infinitely many primes of the form n2 + 1?
  4. Is there always a prime between n2 and (n + 1) 2?
  5. Are there infinitely many prime Fermat numbers?
  6. Are there infinitely long progressions of consecutive primes?
  7. Are there infinitely many sets of three consecutive primes in arithmetic progression?
  8. n2 – n + 41 is prime for 0 £ n £ 40. Are there infinitely many primes of this form?
  9. Are there infinitely many primes of the form n# + 1?
  10. Are there infinitely many primes of the form n# - 1?
  11. Are there infinitely many primes of the form n! + 1?
  12. Are there infinitely many primes of the form n! – 1?
  13. If p is prime, is 2P – 1 always square free?
  14. Does the Fibonacci sequence contain an infinite number of primes?

quiz.gif (1419 bytes)

Abacus1.) What is the sum of the first 5 prime numbers?

ans_a.gif (943 bytes) 28
ans_b.gif (931 bytes) 18
ans_c.gif (938 bytes) 25

2.) Which of the following is a prime number?

ans_a.gif (943 bytes) 57
ans_b.gif (931 bytes) 49
ans_c.gif (938 bytes) 61

3.) How many primes are there that are less than 20?

ans_a.gif (943 bytes) 8
ans_b.gif (931 bytes) 12
ans_c.gif (938 bytes) 2

4.) Which is not a prime number?

ans_a.gif (943 bytes) 21
ans_b.gif (931 bytes) 37
ans_c.gif (938 bytes) 19

5.) A prime number is:

ans_a.gif (943 bytes) a number that is only divisible by itself and one
ans_b.gif (931 bytes) a number that is even and is divisible by 12 and 18
ans_c.gif (938 bytes) a number that is odd

6.) Who was (or were) the first to study prime numbers?

ans_a.gif (943 bytes) Euclid
ans_b.gif (931 bytes) Fermat
ans_c.gif (938 bytes) ancient Greek mathematicians

7.) Fermat numbers are:

ans_a.gif (943 bytes) prime numbers that are even
ans_b.gif (931 bytes) prime numbers that were discovered by Fermat
ans_c.gif (938 bytes) prime numbers that have the property of 2n + 1 when n is a power of 2

submit_a_quiz.gif (2421 bytes)