Sieve of Eratosthenes: An efficient method to find a set of prime numbers up to a certain point.

[Reset] Day 5 [March 22nd, 2026]

Goals:
"Day 3-4: Control structures (if-else, loops)" (Meta AI, personal communication, August 8, 2025)

Notes:
Python for Software Development' textbook by Halvorsen (n.d.):

• To solve, the current task: "Create a Python Script where you find all prime numbers between 1 and 200", I learnt that an efficient method that can be used is the Sieve of Eratosthenes (Geeksforgeeks, 2025; Loucka, 2023). I will study this better in my next session.

Summary:
I learnt that an efficient method that can be used to find a set of prime numbers up to a certain point is the Sieve of Eratosthenes.

References:

1. Geeksforgeeks. (2025, July 23). Sieve of Eratosthenes. https://www.geeksforgeeks.org/dsa/sieve-of-eratosthenes/

2. Loucka, T. (2023, October 30). What are prime numbers? Doodlelearning. https://doodlelearning.com/maths/skills/numbers/prime-number-guide

3. Halvorsen, H. (n.d.)._ Python_. https://halvorsen.blog/documents/programming/python/python.php#python4