When integer is divided by the remainder is . When integer is divided by the remainder is . What is the remainder when is divided by ?
Finding the remainder:
The remainder can be found by using the Division Algorithm theorem.
If ,where and are any integer with , then there exist unique integers such that
and
Here we say quotient and
remainder
Using the Division Algorithm theorem, When integer is divided by the remainder is and let be a quotient.
Using the Division Algorithm theorem, When integer is divided by the remainder is and let be a quotient.
Multiplying and we get,
[Let ]
Comparing and
Remainder
Hence, the remainder is .