##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
When GCD equals 1
Two numbers are coprime if gcd(a, b) = 1. They share no common factors other than 1.
Example: gcd(8, 15) = 1. They are coprime even though neither is prime. Coprime means relatively prime, not actually prime.
Coprime numbers appear in modular arithmetic and number theory problems. If a and b are coprime, then a has a modular inverse mod b.
