GCD & LCMhard
0:00.0

When finding \gcd(35, 12) via the Extended Euclidean Algorithm, the steps are: 35=2(12)+1135 = 2(12) + 11 12=1(11)+112 = 1(11) + 1 11=11(1)+011 = 11(1) + 0 Working backwards to express 1=35x+12y1 = 35x + 12y, what is xx?