The Full Wiki

More info on Sieve of Eratosthenes

Sieve of Eratosthenes: Quiz


Question 1: In mathematics, the Sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους) is a simple, ancient ________ for finding all prime numbers up to a specified integer.
AlgorithmLogicAlan TuringAlgorithm characterizations

Question 2: A prime number is a ________ which has exactly two distinct natural number divisors: 1 and itself.
Natural numberReal numberCardinal numberInteger

Question 3: [2] It was created by ________, an ancient Greek mathematician.

Question 4: [4] Time complexity in ________ model is O(nloglogn) operations.
Counter machineRandom access stored program machineRandom access machineRegister machine


Got something to say? Make a comment.
Your name
Your email address