A multiple-choice quiz
by Matthew_07.
Estimated time: 5 mins.

Quiz Answer Key and Fun Facts

Answer:
**Neither**

Both 0 and 1 are not prime numbers. 0 is not considered as a prime number because 0 is not a natural number (counting number) itself, as natural numbers begin with 1. On the other hand, 1 is not a not a prime number because the number 1 only has 1 factor. The first few prime numbers are 2, 3, 5, 7, 11, 13...

Both 0 and 1 are not prime numbers. 0 is not considered as a prime number because 0 is not a natural number (counting number) itself, as natural numbers begin with 1. On the other hand, 1 is not a not a prime number because the number 1 only has 1 factor. The first few prime numbers are 2, 3, 5, 7, 11, 13...

Answer:
**997**

Any even integer greater than 2 is not a prime number, so this cross out 996 and 998. If you add up all the numbers in an integer and find that it can be divided by 3, then that integer is a multiple of 3 and hence it is not a prime number. So, 999 is also not a prime number.

Therefore, the answer we are looking for in this question is 997. The greatest 3-digit prime is 997. This follows by 991 and 983.

Any even integer greater than 2 is not a prime number, so this cross out 996 and 998. If you add up all the numbers in an integer and find that it can be divided by 3, then that integer is a multiple of 3 and hence it is not a prime number. So, 999 is also not a prime number.

Therefore, the answer we are looking for in this question is 997. The greatest 3-digit prime is 997. This follows by 991 and 983.

Answer:
**The composite number**

All non-prime integers that are greater or equal to 2 are composite numbers. Prime numbers are the building blocks for composite numbers, since a composite number can be expressed as a product of 2 or more prime numbers. For example, the number 100 can be expressed as 2x2x5x5. Notice that both 2 and 5 are prime numbers.

All non-prime integers that are greater or equal to 2 are composite numbers. Prime numbers are the building blocks for composite numbers, since a composite number can be expressed as a product of 2 or more prime numbers. For example, the number 100 can be expressed as 2x2x5x5. Notice that both 2 and 5 are prime numbers.

Answer:
**An even integer is definitely not a prime number.**

The first prime number is 2, which is also the only even prime number. Therefore, any even number that is greater than 2 is definitely not a prime number, because it can be divided by 2.

The first prime number is 2, which is also the only even prime number. Therefore, any even number that is greater than 2 is definitely not a prime number, because it can be divided by 2.

Answer:
**The Sieve of Atkin**

Both methods can be applied and used to create programming algorithms and the computer will do the rest of the job for you. The Sieve of Eratosthenes is a simple way. Let say you want to find out which numbers (from 1 to 100) are prime numbers. So, first of all you need to list all the 100 numbers down. Then, you start crossing out numbers that are not prime numbers.

First and foremost, 1 is crossed out because it is not a prime number. Next, 2 is circled since it is the smallest and the only even prime number. Cancel out any other even numbers because they are all multiples of 2. This will leave you with less numbers. Next, circle 3 and cross out any other numbers that are multiples of 3. The same routine is used and continued for the rest of the numbers until 100 and you will all the prime numbers you need.

Meanwhile, the Sieve of Atkin is a newer and faster way. It is revised from the Sieve of Eratosthenes. The Sieve of Atkin is used generally in an algoritm, because it is very tedious and troublesome to work out the list manually.

Both methods can be applied and used to create programming algorithms and the computer will do the rest of the job for you. The Sieve of Eratosthenes is a simple way. Let say you want to find out which numbers (from 1 to 100) are prime numbers. So, first of all you need to list all the 100 numbers down. Then, you start crossing out numbers that are not prime numbers.

First and foremost, 1 is crossed out because it is not a prime number. Next, 2 is circled since it is the smallest and the only even prime number. Cancel out any other even numbers because they are all multiples of 2. This will leave you with less numbers. Next, circle 3 and cross out any other numbers that are multiples of 3. The same routine is used and continued for the rest of the numbers until 100 and you will all the prime numbers you need.

Meanwhile, the Sieve of Atkin is a newer and faster way. It is revised from the Sieve of Eratosthenes. The Sieve of Atkin is used generally in an algoritm, because it is very tedious and troublesome to work out the list manually.

Answer:
**Isaac Newton**

The earliest poof was given by Euclid in his book "Elements". Apart from that, Euler showed that the sum of the reciprocals of all prime numbers is divergent, so this supported the fact that there is an infinite number of prime numbers. Moreover, by using general topology method, Harry Furstenberg also proved this statement.

Another method of proving this is by using mathematical induction method.

The earliest poof was given by Euclid in his book "Elements". Apart from that, Euler showed that the sum of the reciprocals of all prime numbers is divergent, so this supported the fact that there is an infinite number of prime numbers. Moreover, by using general topology method, Harry Furstenberg also proved this statement.

Another method of proving this is by using mathematical induction method.

Answer:
**A Mersenne prime**

It is named after a French monk, Marin Mersenne. On 4 September 2006, Dr. Curtis Cooper and his partner, Dr. Steven Boone of Central Missouri State University (CMSU) have found the largest prime number known currently. This prime number, 2^32582657 - 1 is also a Mersenne prime (44th Mersenne prime).

It has as many as 9808358 digits! The 43rd Mersenne prime, which contains 9152052 digits, was also discovered by the pair on 15 December 2005.

It is named after a French monk, Marin Mersenne. On 4 September 2006, Dr. Curtis Cooper and his partner, Dr. Steven Boone of Central Missouri State University (CMSU) have found the largest prime number known currently. This prime number, 2^32582657 - 1 is also a Mersenne prime (44th Mersenne prime).

It has as many as 9808358 digits! The 43rd Mersenne prime, which contains 9152052 digits, was also discovered by the pair on 15 December 2005.

Answer:
**Electronic Frontier Foundation**

In 2000, the Electronic Frontier Foundation (EFF) gave USD 50,000 for a 1 million digit prime. There are also other awards, including USD 150,000 (for finding a prime number that has more than 100 million digits) and USD 250,000 (for finding a prime number that has more than 1 billion digits).

In 2000, the Electronic Frontier Foundation (EFF) gave USD 50,000 for a 1 million digit prime. There are also other awards, including USD 150,000 (for finding a prime number that has more than 100 million digits) and USD 250,000 (for finding a prime number that has more than 1 billion digits).

Answer:
**The Prime Number Theorem**

For example, you want to know how many prime numbers are there from 1 to 10. In order to do so, you divide 10 by In 10 to get 4.32, which is close to 4. Indeed, there are 4 prime numbers (2,3,5,7) from 1 to 10.

For example, you want to know how many prime numbers are there from 1 to 10. In order to do so, you divide 10 by In 10 to get 4.32, which is close to 4. Indeed, there are 4 prime numbers (2,3,5,7) from 1 to 10.

Answer:
**True **

Prime numbers are used widely in rotor machines. They are used as some kind of "passwords" to protect some very important details.

Prime numbers are used widely in rotor machines. They are used as some kind of "passwords" to protect some very important details.

This quiz was reviewed by FunTrivia editor crisw before going online.

Any errors found in FunTrivia content are routinely corrected through our feedback system.

Related Quizzes

This quiz is part of series
1. **Composite Numbers** Average

2.**Consecutive Numbers** Average

3.**Fibonacci Numbers** Average

4.**Palindromic Numbers** Average

5.**Perfect Numbers** Average

6.**Prime Numbers** Tough

7.**Square Numbers** Average

8.**Triangular Numbers** Average

2.

3.

4.

5.

6.

7.

8.

Referenced Topics

General
Science
Math
Computers
French Language
Organizations
Names
Specific Math Topics
Missouri
Mathematicians
Machines
Theorems
French: Famous & Historical
Isaac Newton
Other Destinations

Explore Other Quizzes by Go to

More

FunTrivia