Today, I learnt the concept behind the Sieve of Eratosthenes and tried a few applications of it like finding all the prime numbers between 1 and N
Then, I saw the inclusion-exclusion Principle and the Euclid Algorithm to find the GCD of two numbers A and B.
Leave a comment