Elementary Number Theory Problems 4.2 Solution (David M. Burton's 7th Edition) - Q18
My Solution for "If $a \equiv b \pmod {n_{1}}$ and $a \equiv c \pmod {n2}$, prove that $b \equiv c \pmod {n}$, where the integer $n = gcd(n_{1}, n_{2})$."
Background
All theorems, corollaries, and definitions listed in the book's order:
Theorems and Corollaries in Elementary Number Theory
All theorems and corollaries mentioned in David M. Burton’s Elementary Number Theory are listed by following the book’s order. (7th Edition) (Currently Ch 1 - 4)
I will only use theorems or facts that are proved before this question. So, you will not see that I quote theorems or facts from the later chapters.
Question
If $a \equiv b \pmod {n_{1}}$ and $a \equiv c \pmod {n_{2}}$, prove that $b \equiv c \pmod {n}$, where the integer $n = gcd(n_{1}, n_{2})$.
Solution
The rest is for Premium Members only
SubscribeAlready have an account? Log in
%20-%20Q18){kind=link}