Linear Congruences : Chinese Remainder Theorem
Not what you're looking for?
The idea of this problem is to investigate solutions to x2≡1(mod pq) where p and q are distinct odd primes.
(a) Show that if p is an odd prime, then there are exactly two solutions modulo p to x2≡1(mod p).
(b) Find all pairs (a,b) Є Zp x Zq such that a2≡1(mod p) and b2≡1(mod q).
(c) Let p=17 and q=23. For each pair (a,b) from part (b), compute an integer modulo such that and .
(d) Verify that each integer found in part (c) is a solution to .
Purchase this Solution
Solution Summary
Congruences and the Chinese Remainder Theorem are investigated. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.
Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Know Your Linear Equations
Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.
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.
Probability Quiz
Some questions on probability