Extended Euclidean Algorithm

What is the smallest possible positive integer value of \(x\) such that \(9x \equiv 1 \pmod {41}?\)

×

Problem Loading...

Note Loading...

Set Loading...