CSE at UC Riverside

gcd(a,b) as a linear combination of a,b. Using Euclid's algorithm to compute α and β satisfying α a + β b = gcd(a,b). Modular arithmetic: computing sum, difference, multiplication, or powers modulo a number. ................
................