solution of
Theorem 1.
Given an integer , if there exist integers and such that
then one has
where and are integers such that divides .
Proof.
To begin, cross multiply to obtain
Since this involves setting a product equal to another product, we can think in terms of factorization. To clarify things, let us pull out a common factor and write and , where is the greatest common factor and is relatively prime to . Then, cancelling a common factor of , our equation becomes the following:
This is equivalent to
Since and are relatively prime, it follows that is relatively prime to and that is relatively prime to as well. Hence, we must have that divides ,
Now we can obtain the general solution to the equation. Write with and relatively prime. Then, substituting into our equation and cancelling a and a , we obtain
so the solution to the original equation is
Using the definition of , this can be rewritten as
∎
Title | solution of |
---|---|
Canonical name | SolutionOf1x1y1n |
Date of creation | 2013-03-22 16:30:44 |
Last modified on | 2013-03-22 16:30:44 |
Owner | rspuzio (6075) |
Last modified by | rspuzio (6075) |
Numerical id | 13 |
Author | rspuzio (6075) |
Entry type | Theorem |
Classification | msc 11D99 |