01What is the time complexity of the Euclidean Algorithm for GCD?
02The Sieve of Eratosthenes is used for:
03What is the complexity of the Sieve of Eratosthenes?
04How do you calculate LCM(a, b) using GCD?
05What is 'Exponentiation by Squaring'?
06What is the result of 17 mod 5?
07A prime number is only divisible by:
08What is the complexity of trial division primality testing?
09The 'Catalan Numbers' are used to count:
10What is 'Modular Inverse'?