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. 1

    Which ancient algorithm finds all prime numbers up to a specified integer by iteratively crossing out composite multiples of each found prime?

    Show answer

    Answer: Sieve of EratosthenesThe Sieve of Eratosthenes is an ancient Greek algorithm for finding all primes up to any given limit by sequentially eliminating multiples.

    Source: Sieve of Eratosthenes - Wikipedia
  2. 2

    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?

    Marianoju · CC BY-SA 4.0
    Show answer

    Answer: Fundamental Theorem of ArithmeticThe Fundamental Theorem of Arithmetic (also known as the unique factorization theorem) asserts the unique prime factorization of integers greater than 1.

    Source: Fundamental theorem of arithmetic - Wikipedia
  3. 3

    What is the smallest three-digit prime number?

    Political Calculations · CC BY-SA 4.0
    Show answer

    Answer: 101The number 100 is composite (divisible by 2 and 5), while 101 has no positive divisors other than 1 and itself.

    Source: List of prime numbers - Wikipedia
  4. 4

    What does Goldbach's conjecture state regarding every even integer strictly greater than 2?

    Show answer

    Answer: It can be expressed as the sum of two primesGoldbach's conjecture is one of the oldest unsolved problems in number theory, proposing that every even integer greater than 2 is the sum of two prime numbers.

    Source: Goldbach's conjecture - Wikipedia

Related topics

Make your own quiz

Describe any subject and get a complete quiz night with rounds, answers and sources.

Create my quiz
Quwizzy