Explore BrainMass

# Application of Chinese Remainder Theorem (II)

Not what you're looking for? Search our solutions OR ask your own Custom question.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

Find the least positive integer that yields the remainders 1,3 and 5 when divided by 5,7 and 9 respectively.

https://brainmass.com/math/algebra/application-chinese-remainder-theorem-23512

#### Solution Preview

Linear Congruences
Application of Chinese Remainder Theorem (II)

Written by :- Thokchom Sarojkumar Sinha

Find the least positive integer that yields the remainders 1,3 and 5 when divided by 5,7 and 9 respectively.

Solution :- First of all we have to use the following congruences to solve the problem.

x ≡ 1 (mod 5)
...

#### Solution Summary

This solution is comprised of a detailed explanation for finding the least positive integer by using the Chinese Remainder Theorem.
It contains step-by-step explanation for finding the least positive integer that yields the remainders 1,3 and 5 when divided by 5,7 and 9 respectively.
Solution contains detailed step-by-step explanation.

\$2.49