Scribd
Upload
9 views

Modular Arthimetic - 11

Uploaded by

akhilgudella
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Modular Arthimetic - 11

Uploaded by

akhilgudella
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 84

Definition:

Remark:
For
fractional
part read
the output
from top to
bottom.
Means Top
part is
MSB and
bottom part
is LSB.
For
existen
ces of
multipl
icative
inverse
, (a, m)
should
be
relative
ly
prime.
Examples Problems
1. Find the solution of the congruence 6 x 3 (mod 9)
Solution: Fro1n the given congruence relation one can check that 2, 5, 8 are
the solutions. The sa1ne solution can be obtained by another method by the
theore1n ( stated in the previous slide/ page).
Since gcd( 6, 9) = 3 and 3 divides 3, hence the congruence has three
s_olutions. The solution of the given congruence can be obtained by solving
linear congruence 2 x 1 (rnod s).
By Choosing X = 0 , 1, 2 and testing the congruence, vve get X = 2.
Thus the first solution to the given congruence is x 0 = 2.
Comparing the given congruence relation vvith ax b (mob m),
we have a = 6, b = 3, m = 9.
Thus the other solutions are
m m
x1 = x0 + -d = 2 + 3 = 5 and x2 = x0 + 2 -d = 2 + 6 = 8
Thus, the solutions are 2,5 and 8.
Explanation: Here
gcd of (3,7) is 1 so its
inverse will exist. We
have
3x≡1(mod 7) which
implies:
3x-7y=1.

By Euclid theorem,
1=(-2)*3+7*1. Here
multiple of 3 is -2 so
the inverse of 3
modulo 7 is -2.
Remarks:
b is the residue of a≡b mod(m) if m|(a-b).

Example:
1. 89≡ 25 (mod 4)

2. 157≡ -7 (mod 4)

3. -28≡ 2 (mod 4)
Remainder vs Residue

You might also like