##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
What you'll learn
Here's what you'll learn:
Euler's totient counts integers coprime to . Use it for counting and modular inverse.
Chinese Remainder Theorem combines modular constraints into a single equation.
Prime factorization via GCD between numbers.
Diophantine equations: has solutions iff divides .
