2. Let n₁,..., nk be pairwise relatively prime positive integers, and let n = n₁ ... nk. Recall we proved in class that for any integers a₁,..., ak, there exists a unique EZ such that x = ai (mod n₁) for all i E {1, ..., k}. In this problem we will learn how to find the solution à. (a) For each i = {1,..., k}, since gcd(ni, n/ni) 1, one can find (using the Eu- clidean algorithm) integers b; and c; such that bini +ci(n/ni) = 1. Let Show that - Mi = 1 bini= ci(n/ni). = x = a₁m₁ + + ak mk is the unique solution in Zn such that x =ai (mod nį) for all i = {1, ..., k}. (b) Solve the system of congruence equations x = a1 x = a₂ x = a3 ... (mod 3), (mod 5), (mod 7).

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 33EQ
icon
Related questions
Question
2. Let n₁,...,nk be pairwise relatively prime positive integers, and let n = N₁ ··· Nk.
Recall we proved in class that for any integers a₁,..., ak, there exists a unique
x € Zn such that
x = a (mod ni)
i
for all i = {1 k}. In this problem we will learn how to find the solution .
9 ... 9
(a) For each i = {1, ..., k}, since gcd (ni, n/ni) 1, one can find (using the Eu-
clidean algorithm) integers b; and c; such that bini + ci(n/ni) = 1. Let
ci(n/ni).
Show that
mį = 1 - binį
=
x = a₁
x = a₂
x = az
=
X x = a₁m₁ +
+ актк
is the unique solution in Zn such that x = a; (mod nį) for all i = {1,..., k}.
(b) Solve the system of congruence equations
(mod 3),
(mod 5),
(mod 7).
Transcribed Image Text:2. Let n₁,...,nk be pairwise relatively prime positive integers, and let n = N₁ ··· Nk. Recall we proved in class that for any integers a₁,..., ak, there exists a unique x € Zn such that x = a (mod ni) i for all i = {1 k}. In this problem we will learn how to find the solution . 9 ... 9 (a) For each i = {1, ..., k}, since gcd (ni, n/ni) 1, one can find (using the Eu- clidean algorithm) integers b; and c; such that bini + ci(n/ni) = 1. Let ci(n/ni). Show that mį = 1 - binį = x = a₁ x = a₂ x = az = X x = a₁m₁ + + актк is the unique solution in Zn such that x = a; (mod nį) for all i = {1,..., k}. (b) Solve the system of congruence equations (mod 3), (mod 5), (mod 7).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning