readme.md

Number Theory

Fundamentals

• Binary Exponentiation
• Euclidean algorithm for computing the greatest common divisor
• Extended Euclidean Algorithm
• Factorial without recursion
• Fibonacci Numbers
• Linear Diophantine Equations

Prime numbers

• Sieve of Eratosthenes
• Sieve of Eratosthenes With Linear Time Complexity
• Primality tests

Number-theoretic functions

• Euler's totient function
• Number of divisors / sum of divisors

Modular arithmetic

• Modular Inverse
• Linear Congruence Equation
• Chinese Remainder Theorem
• Factorial modulo p
• Discrete Log
• Primitive Root
• Discrete Root
• Montgomery Multiplication

Questions related to Number Theory

• All Unique Prime Factors ----> C++ | Java
• Binary to Decimal Number Transformation ----> C++ | Java
• Check Prime Number ----> Java | Python
• Check Trimorphic number ---->C++
• Counting number of digits in factorial using Kamenetsky's Formula ----> Java
• Determining if a number is a prime number or not using Trial Division Algorithm ---> C++
• Factorial of a number without recursion ---->Python
• Fibonacci Series ----> Java
• GCD of two number using Euclidean Algorithm ----> Java | Python
• Geek-onacci Number----> C++
• Modular Exponentiation ----> C++
• Palindrome Number ---> C++ | Python
• Taylor's Series of e^x ----> Java
• To find all prime number from 2 to N ----> C++
• Counting Divisors Using Sieve ---->C++