Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 1.3.49* (Divisors of $ab, cd$ and $ac+bd$.)
Exercise 1.3.49* (Divisors of $ab, cd$ and $ac+bd$.)
If is a divisor of each , and , prove that it is also a divisor of and , where are integers.
Answers
Notation: If is prime and an integer, denotes the higher power of which divides . Therefore, if is an integer,
Proof. Suppose that , and , where is the decomposition of in prime factors.
It is sufficient to prove for .
Assume that for some prime and exponent .
Then
Define
Then there are integers such that
Therefore
Since , where is prime, , thus so
Similarly, using
Moreover
-
If , then
where , and .
Since , and ,
Then (3) implies . Since , we obtain also .
-
If , then similarly
where , and .
Since , where , we obtain .
Then (4) implies . Since , we obtain also .
I both cases, and .
I we apply this result to every for , we conclude that and . Therefore is a divisor of and . □