Prime numbers
4 quiz questions about Prime numbers, each with the answer, a short explanation and a confirmed source. Add any question to your own quiz.
Difficulty
- 1
Which theorem states that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors?
- Fundamental Theorem of Arithmetic
- Fundamental Theorem of Algebra
- Prime Number Theorem
- Fermat's Little Theorem
- 2
Which ancient algorithm finds all prime numbers up to a specified integer by iteratively crossing out composite multiples of each found prime?
- Sieve of Eratosthenes
- Euclidean Algorithm
- Newton-Raphson Method
- Dijkstra's Algorithm
- 3
What does Goldbach's conjecture state regarding every even integer strictly greater than 2?
- It can be expressed as the sum of two primes
- It can be expressed as the product of two primes
- It is the difference between two consecutive primes
- It has an odd number of prime factors
- 4
What is the smallest three-digit prime number?
Related topics
Make your own quiz
Describe any subject and get a complete quiz night with rounds, answers and sources.
Create my quiz