# Application of Chinese Remainder Theorem (II)

Not what you're looking for?

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

##### Purchase this Solution

##### 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.

##### Solution Preview

Please see the attached file.

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)

...

###### Education

- BSc, Manipur University
- MSc, Kanpur University

###### Recent Feedback

- "Thanks this really helped."
- "Sorry for the delay, I was unable to be online during the holiday. The post is very helpful."
- "Very nice thank you"
- "Thank you a million!!! Would happen to understand any of the other tensor problems i have posted???"
- "You are awesome. Thank you"

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Probability Quiz

Some questions on probability

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.