Part I: Choose the best answer for each question: ⇱
Question 1. Who is Eratosthenes?
Question 2. In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all ________ up to any given limit.
Question 3. Which is an example of a prime number?
Question 4. How does the sieve of Eratosthenes work? Choose the correct order to explain. 1: Mark all the multiples of 2 (excluding 2)
2: Mark all the multiples of 3 (excluding 3)
3: Mark all the multiples of 5, 7,... (excluding 5, 7,...)
4: List all natural numbers from 2 to M
5: Continue the steps until there are no numbers that are not marked out.
2: Mark all the multiples of 3 (excluding 3)
3: Mark all the multiples of 5, 7,... (excluding 5, 7,...)
4: List all natural numbers from 2 to M
5: Continue the steps until there are no numbers that are not marked out.
Question 5. How many prime numbers are there from 2 to 10?
Question 6. How many prime numbers are there from 2 to 20?
Part II: Fill in the blanks (NO MORE THAN ONE WORD): ⇱
Question 7.
The of Eratosthenes is a method for finding all the prime numbers less than or equal to a given natural number. This algorithm was created by Eratosthenes - an ancient Greek mathematician (276 BC - 194 BC), who was also famous for near-accurately measuring the diameter of the Earth when space science had not developed yet.
Question 8.
To identify all numbers up to natural number M, we conduct the following steps:
Question 9.
Step 1: List all numbers from 2 to M;
Question 10.
Step 2: Mark all the of 2 (excluding 2);