Arithmetic modular composite numbers (4 marks). carry out the following calcula- tions by hand by using the chinese remainder theorem to split each operation into two operations modulo smaller numbers. you must show your work to receive full credit (a) 23 x 36 mod 55 (b) 29 x 51 mod 91

a) 23 x 36 (mod 55) = 3 (mod 55)

b) 23 x 36 (mod 55) = 23 (mod 91)

Step-by-step explanation:

The Chinese Remainder Theorem lets us split a composite modulo into its prime components and solve for smaller numbers.

a) Using the Chinese Remainder Theorem, we have that 55 = 11 x 5

Since 11 and 5 are relatively prime numbers, we can use the Theorem and rewrite 23 x 36 mod 55 as: 23 x 36 (mod 11) and 23 x 36 (mod 5).

First we will work with 23 x 36 (mod 11)

(Since 23 is congruent to 1 modulo 11 and 36 is congruent to 3 modulo 11)

Now we do the same with 23 x 36 (mod 5)

Now we will use the Chinese Remainder Theorem to solve this pair of equations:

x = 3 (mod 11) and x = 3(mod 5)

b) We are going to use the same procedure from a)

91 = 13 x 7

29 x 51 (mod 91) = 29 x 51 (mod 13) and 29 x 51 (mod 7)

29 x 51 (mod 13) = 3 x 12 (mod 13) = 36 (mod 13) = 10 (mod 13)

29 x 51 (mod 7) = 1 x 2 (mod 7) = 2 (mod 7)

Our pair of equations is x = 10 (mod 13) and x = 2 (mod 7)

hello from mrbilldoesmath!

answer:

the domain is the set { -2, 0, 2, 3}

discussion:

the domain is the set of x values in the ordered pairs (x,y). taking the x, or first component, of each ordered pair gives   -2, 0, 2, 3.

you,

mrb