Ononot — Using the extended Euclidean algorithm, find the smallest po

Guest Session: 1 Question Remaining. Create Account to save progress.

GCD & LCMhard

0:00.0

Using the extended Euclidean algorithm, find the smallest positive integer $x$ such that $13x \equiv 1 \pmod{17}$ .