Number Theory is used a lot for solving real world problems and for the same reason It’s asked most of the time in interviews. This article marks the beginning of series of articles over Number Theory. Today we will discuss following algorithms –

- Euclid’s Algorithm For Finding GCD
- Extended Euclid’s Algorithm
- Modular Exponenetiation
- Modular Multiplicative Inverse