An inverse for .
The objective is to find an inverse for .
First. Find the greatest common divisor using the quotient remainder theorem as,
The greatest common divisor when we divide is the last non zero remainder.
Thus, the greatest common divisor is .
Now, express the greatest common divisor as a linear combination of .
The least positive solution for the following congruence:
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started