Given:
A number when divided by 780 gives remainder 38.
To find:
The reminder that would be obtained by dividing same number by 26.
Solution:
According to Euclis' division algorithm,
...(i)
Where, q is quotient and
is the remainder.
It is given that a number when divided by 780 gives remainder 38.
Substituting
in (i), we get
![a=(780)q+38](https://tex.z-dn.net/?f=a%3D%28780%29q%2B38)
So, given number is in the form of
, where q is an integer.
On dividing
by 26, we get
![\dfrac{780q+38}{26}=\dfrac{780q}{26}+\dfrac{38}{26}](https://tex.z-dn.net/?f=%5Cdfrac%7B780q%2B38%7D%7B26%7D%3D%5Cdfrac%7B780q%7D%7B26%7D%2B%5Cdfrac%7B38%7D%7B26%7D)
![\dfrac{780q+38}{26}=30q+\dfrac{26+12}{26}](https://tex.z-dn.net/?f=%5Cdfrac%7B780q%2B38%7D%7B26%7D%3D30q%2B%5Cdfrac%7B26%2B12%7D%7B26%7D)
![\dfrac{780q+38}{26}=30q+\dfrac{26}{26}+\dfrac{12}{26}](https://tex.z-dn.net/?f=%5Cdfrac%7B780q%2B38%7D%7B26%7D%3D30q%2B%5Cdfrac%7B26%7D%7B26%7D%2B%5Cdfrac%7B12%7D%7B26%7D)
![\dfrac{780q+38}{26}=30q+1+\dfrac{12}{26}](https://tex.z-dn.net/?f=%5Cdfrac%7B780q%2B38%7D%7B26%7D%3D30q%2B1%2B%5Cdfrac%7B12%7D%7B26%7D)
Since q is an integer, therefore (30q+1) is also an integer but
is not an integer. Here 26 is divisor and 12 is remainder.
Therefore, the required remainder is 12.