Scribd
Upload
106 views2 pages

This Study Resource Was: For Each of The Following Equations, Find An Integer X That Satisfies The Equation

The document contains solutions to modular arithmetic equations and finding multiplicative inverses using the extended Euclidean algorithm. It first finds integer values of x that satisfy three equations of the form "ax ≡ b (mod c)". It then uses the extended Euclidean algorithm to find the multiplicative inverses of three numbers modulo other numbers. In each case, the algorithm yields the same numbers as the divisors.

Uploaded by

David Basa Halomoan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
106 views2 pages

This Study Resource Was: For Each of The Following Equations, Find An Integer X That Satisfies The Equation

The document contains solutions to modular arithmetic equations and finding multiplicative inverses using the extended Euclidean algorithm. It first finds integer values of x that satisfy three equations of the form "ax ≡ b (mod c)". It then uses the extended Euclidean algorithm to find the multiplicative inverses of three numbers modulo other numbers. In each case, the algorithm yields the same numbers as the divisors.

Uploaded by

David Basa Halomoan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CEIS210 Week 3 Assignment Brian

2.3 For each of the following equations, find an integer x that satisfies the
equation.
 5x≡4(mod 3)
Calculate D:
D= (5, 3)
GCF= (5, 3) =1
4/1 = 4
Diophantine equation:
GCF= 5x – 3y = 4
Using Euclid’s extended algorithm:
1-(1*1) = -1, 1-(1*-1) = 2 d = 1
A = -1, B = 2
Ax + By = GCD
5x + 3y = 1
X = 2, Y = -1

m
er as
 7x≡6(mod 5)

co
Calculate D:

eH w
D = (7, 5)
GCF = (7, 5) = 1

o.
6/1 = 6
rs e
ou urc
0-(1*1) = -2, 1-(1*-1) = 3
A = -2, B = 3
Ax + By = GCD
7x + 5y = 1
o

X= 3, Y = -2
aC s
vi y re

 9x≡8(mod 7)
D = (9, 7)
GCF = (9, 7) = 1
ed d

8/1=8
0-(3*1) = -3, 1- (3*1) = 4
ar stu

A = -3, B = 4
Ax + By = GCD
9x + 7y = 1
is

X = -3, y = 4
Th

2.16 Using the extended Euclidean algorithm, find the multiplicative inverse of:
a. 1234 mod 4321
C≡ A mode B
sh

A=1234, B=4321
4321 into 1234= 0
4321*0=0
1234-0=1234
1234mode 4321≡ 1234

This study source was downloaded by 100000796116386 from CourseHero.com on 09-07-2021 20:01:28 GMT -05:00

https://www.coursehero.com/file/23174725/CEIS210-Week03-Assignment-Brian/
CEIS210 Week 3 Assignment Brian

b. 24140 mod 40902


C≡A mode B
A=24140, B=40902
40902 into 24140=0
40902*0=0
24140-0=24140
24140 mode 40902≡ 24140

c. 550 mod 1769


C≡A mode B
A=550, B=1769
1769 into 550=0
1769*0=0
550-0=550
550 mode 1769 ≡ 550

m
er as
co
eH w
o.
rs e
ou urc
o
aC s
vi y re
ed d
ar stu
is
Th
sh

This study source was downloaded by 100000796116386 from CourseHero.com on 09-07-2021 20:01:28 GMT -05:00

https://www.coursehero.com/file/23174725/CEIS210-Week03-Assignment-Brian/
Powered by TCPDF (www.tcpdf.org)

You might also like