Hello Guys, I am stuck on deciding how should I practice Number Theory problems based on the concepts that I have learned. I recently came across the following algorithms on Number Theory.↵
↵
- **Prime Factorisation**↵
- **Binary Exponentiation**↵
- **Euclid's Algorithm**↵
- **Extended Euclid's Algorithm**↵
- **Sieve of Erathosene**↵
- **Euler's totient function**↵
- **Linear Diophantine Equation**↵
- **Chinese Remainder Theorem**↵
↵
↵
Could you guys please help me find the problems related to the above topics on codeforces?↵
↵
↵
- **Prime Factorisation**↵
- **Binary Exponentiation**↵
- **Euclid's Algorithm**↵
- **Extended Euclid's Algorithm**↵
- **Sieve of Erathosene**↵
- **Euler's totient function**↵
- **Linear Diophantine Equation**↵
- **Chinese Remainder Theorem**↵
↵
↵
Could you guys please help me find the problems related to the above topics on codeforces?↵
↵