Calculate the following gcds using the Euclidean algorithm.
Using the Euclidean algorithm, we find
Using the Euclidean algorithm, we find
Using the Euclidean algorithm, we find
For each of the following linear Diophantine equations, find a
solution where
Since
Since
From part (a), we know that
This is equivalent to solving the linear Diophantine equation
From Problem 1, we know that
Therefore, a solution to
Since
Since
Can
This problem is equivalent to asking if there is there a solution to
the linear Diophantine equation
We know that there is a solution only if
Using the Euclidean algorithm,
We begin by first finding a solution to the linear Diophantine
equation
Multiplying both sides of this equation by
Therefore,
Can
This problem is equivalent to asking if there is a solution to the
linear Diophantine equation
We know that there is a solution only if
By inspection,
Therefore,
Use the Euclidean algorithm to find a solution to
When solving a linear Diophantine equation, our first step is always
to find the gcd of the coefficients using the Euclidean algorithm:
Does
Since our algorithm ended so quickly, it is easy to see that
By multiplying both sides of this equation by
The answer does not make sense in the context of the problem. This
answer suggests that we should use
What we are really looking for is a solution to the linear
Diophantine equation
One way to rectify this problem is the following: for every
Find an integer
Since
If we can find a solution to this linear Diophantine equation, we can
use equation
Our first step is to find
Thus we know that
We end the Euclidean algorithm to find that
From
Multiplying both sides of the equation
Hence, a solution to the linear Diophantine equation
We may now use either equation
Suppose
Suppose
Yes, this must be true. Suppose it is not true. That is, suppose
No, this is not necessarily true. Consider when
Use the division algorithm and the important fact to show that
Use the division algorithm and the important fact to show that
Recall from the important fact, that if
Well, we can write
We’re going to try an approach similar to that in part (a).
First, let’s use the division algorithm once to write
Again, we’ll apply the division algorithm to our new pair to get
From part (a), we know that
Putting this all together, we get