- #1
cbarker1
Gold Member
MHB
- 349
- 23
Dear Everyone,
Here is the question:
"Prove that if divides the integers and , then divides for every pair of integers and for every pair of integers."
The attempted work:
Suppose divides and divides , where . Then, and , where (Here is where I am stuck).
Do I solve for ?
If I do solve for , then it yields the
. Then, . So . Then divides .
So is it right to the proof this way?
Here is the question:
"Prove that if
The attempted work:
Suppose
Do I solve for
If I do solve for
So is it right to the proof this way?