A

Intro
to
Congruences 4 2 Linear congruences (modm) solution

:linearcongruence oEXEbamnoncongrent
relation thm has a
equivalence
.

-
if i is , -

b(modm) m)/a b) iff olb

solutions o is
if
Ex-X/xw a3
-

a
[a] =
ax = b(modm)
34/mod 3) i pantine
*
49 = X Mlax-b axbimy ax-my b
. Not hold
=
partition of
equivalence classes form
/) ,

I
a
Xot , Xot
-
.

Xo ,
3) 49 34 proof : So X = Xo + -

Xotm
-

classes
ex) aEblmods) E 5 equir
3/15w
8-1

Y = Yo+ t
E = 0, 1
....,
= Xo(modm)
3 ex) 20 x 15 mod35 ↑G things

(
[O] = . ...
E -
10 , -5 , 0 ,5 , 10 =
1
...

proposition [T] = E -
4 1 , 6 , 17 , 16 3 3 mod 7
4x
...
...
, =
Eblmodm) iff JKET such that a = btkm .

[I] = 3 ..., -
3 , 2 , 7 , 12 3 modular inverses
4x 3 = Ty
....

find 42 (mod 155)

-

if a = b/modm) then
=> mla-b I f
there's XEL such that
4x -

Ty = 3
42 x = )(mod 155)
b MK
4/6) 7(3) 3
axElmoomX istheinvestore
a - = =
-

a= b+
Mk no overlap [5] [0] =
155142x -
I

only happen if go m =
X= 6
backwards
can
155y
-

42x 1 -
=

XE6 , 13 , 20 , 27 , 34 eve
42x- 155 y = 1 alg
relation (mod 35) ex) 7 "modll
thm :
Alb(modm)isanequivalence in
1 computer Science ,
-

42/48)+ 1557 13) 1

-
7 8 =

(on set a mod 7x /modI)

=
mod

rog
48 42 El
155
a lmodm)
Val
.

quiz 8 modll works

-
reflexive :
(a =
0 m
when you divide a
by m Show -=
x=
42 = 48 mod155
8 (modl) me
=
o
m//a-a) true
.

mo
a m 7 8 56
(modI)
* =/(modI)
=
3
.

(a b (mod m) > (
a(moom) TX =

ifXenegIm (moom
-
b= also
(TX) = 7 "3 /modi)
"
-

Symmetric : =
b a =M/ () - m((b a) - b = a(modm)
11 M 3 = 2
8 =
T(modI) +
b = mk =
-

m((a b) a
(model(
-
-

x= 8 3
.

CImodm) 7x + ly = 1
-transitive : (a = blmoom) and bEclmodul = a
ex) 48 = 14 modK ? yes
= 2
X = 24 (modIl
(modll) x= -

3y =
2

k I
a-b = mt t zl
b - c=

b +b
MS

c=
SETL

m(t + S) = a -
C
-
7
Emi
=
-

a -

so mla-c so clmodm)
inse
a

remainder thm

* a+ cibtc(modm) find smallest post that has a remainder of 1 after

of I when
dividing by 4 ,
dividing by by 7
5 - rem
a c
-
b c(modm)=
- a remainder of 3 after ,

. 1Z.mode
bc(modm) z
Method

-
ac =

(
-el(mod 4)
-
-
>
no canceling ! X 4 ++ 1 tELL
4(mod3)
-
=

gol,he
ifacbemodmIad
2(mob7) " b(moda)
=
1= =
Hm : 4 + += 3/mods) 2/mods) 13 +20 z =
x= 3 (mods) 4t =

. 2(mod) 44t) = 4 -. 2 (mods) 6 + kz = 2(mod) 36 = /modT

b(moom) and cel x=

·
thm : If
67 = 4 (model

GFBalmore
a
Proof 4(mod5) 2(mod5)
: tE 4
.
-

4 = -

c=btC (modm) ac-b = M + mods

66z = 3(madL) 6t
a+ , 3
t

&Tbmoom
=

b c(modm)
.

a c =
-

acd-bid = mot
4(mod 7)
e
-

L
acEbllmodm)
ab(modm) m) (a b&
(a b) c' = a c'-bc'
- = m't
50+=3 +5 z = 1 + 20z
z=

Proof #3 -
>
m'/ac'-bc z 4+7
more
: V
92d(i m)
-
=
1

c'mila- Eblmod
=
mdc dcel
(a b) Emb -(a b(c
, a
-
> -
=
m'lla-b) d 13 + 20/4 +7v)
>
-
-
=
X
de ac-bc = mdc
aside X = B + 80
+ You
> m(ac bc
- -
-

E)(modm)
ac = bc(modm)
Proof.LetMRmeme Mi
3 M
,

Y M,
= Olmodma
, x = 93 + 140

XE93modI
1

=1 Eblmode)
Ebc(modm) + gcd(c m)
then a ,

(modm ) 0(mod Ms)

, ,
if a<
corollary: T: if x= G ,
.

1 1
y M
=
cEbt6(modm) ged(Mi mi =
,
b (moom) + Cdmodm)
then at
*= az(modm2) , ,

thm : if a -ncbdlmodm) i
*
aijmodmie) So Mid mi exists , Yi
↓ a = b (modm) x =

with the (9(6(Mi Mj) 1( =

M +AzBzMz 32Mz = 0(modmi)

exponenticia
pairwise rel prime

Roa n
mi -

Y,
,
A
take X = , , ....

then there's solution modmime MK) (

YzMzEllmod
...

a
unique (modmil M2
-

0 + o
X =
a+ ...

+ 64 + 32 + 16 + 4
9512 Y2MzE0(mod ms)
628
X= o + az +0 (Modmal
2
= ...

i = 4(mod624) =256 . . .
8
.

Suppose X+
y Satisfy System
2 = 44(
- I y
0(modm )
..

mi
-
X
y x=

28Eli
,
2
-

mely - X Method
120 (mod629 y X = 0(modmz)
- -
i Y , =35 (mod4) = 3 (mod4) = 3(mod 4)
562(mod 629) M()/y M1 = 5 2 35
2 =

232 = 120 =
- (m , Mz x
Mk(y
-

MEGT28 &28!moOSE modsa

x
...
-

764 = 86
&

228 = 477 3= X(mod m M ...

Mr)
gcd/m M2) =
- ,

lemma : if
2256 468 ,
=
&

Fmila mala them

Me
2512 = 256 a
13 35 +3 2 28 . .

. +26 20 .

not
, Mz
M
ja .

= 513 (mod 140) = 93(mod 140)

on
Polynomial congruences (mod m)
tes+ Mid
,- 1 Proof : a=
* a exists
Solving e
-

Malmid-mald

Toft
gcda m) =
Y
iff
x3 2x + 4 = 0(mod)
,

+ -
Eomo d M2q

<
so =

XElmodY
only solution
-
a = m M2 q
ex) x =
-

M2 3 = 7 11 = 23
mod5
, . .

I
+ 4 = 0(Mod 7 4
X=
X3 + 2 x
M , Mz
la G modT M3 = 3
.
5 11 .
= 165 Z
,
x=
X = 1 +7t
+7t) + 4 =
0(mod7Y Modll
5 My = 3
.
57
(1+ it) 2) +

4 = 0(mod +Y
*I

iii
+2 +7t + 2 + 2 7t +
1 + 37t + 372 231" = 1 mod5
2x + y ((mod)
.

+++termody
=

- "
Mod]
-
T( 385 =
3x + 5ye 4(mod
-

+ 2tHEOmodT -

5(modt) = L mod3
10x + 5y
-
=
105 = - Mod II

<X = /(mod) 165 =- mod 7 6 modll

=
X= 1 + 74 = 29 (mod 74) o = 1)modi 4
- E modT
Check
no solution
1(1)(231) 6(z)(165)
+ 5)2)(lost)
2(1)(385)
+
+
over reals x=
I f -
-

= 4031 mod (3
5 7 11)
5 systems of linear congruences

=d=Ole oldrane
. .
.

1 ax +
by e(modm)
=4031mod(115t,
=

X
.

By EZ (mod 7)
-

by f(modm)
5 x+

-
+ =
Cx
ex d() 3 x + 4y = 6 ( mod)
-

3y = 4/mo
(3x
2 x+ -

bdy ed(modm)
G15x+age
a e

= 5(mod 1)
=
adx +
+
y
! x3 Goe
30(modT)
-

boxtboy =
bf(modm) y
det)a

Emo
-

= -

·
(ad bf(modm)
y bx)x =
curc -b) Ja d
ed-
24(mod 7)
-

= -

lly 24(mod)
=
we're guaranteed unique solution
inverses

*-bc (abcobbe ad
= 3(mod) (4 )
m) =
(4)4y gcd(ad-bc claim
over
%

if , :

y = 3 2(mod 7)
.
if r= gcd > 1 ,
+ rIRHS
,
(it)
-
I
-

ad-be
(a) =
(bi)
y = 6 (mod 7) is
Youcan dividethem
X=0 y = 5

(ad-be)"))(madm)
"

y C (38)
=
=

5x + 3(b) = 2(modT)
gcd(ad be , m) = 1
16 (mode
if
-

(s
5X = -

5 '[5x =
x=
5/mod7)]
((mod
(38)(5) =

solve 2x + 3g = 5/modt)
G(mod
(f)(modm) 3x + 2y
=

(2i)(6) mook
152)(5) (5)(mod)(zi)(52)(i)
=
=

132)" *
↑ molt by (i) (i) (2) = =

EE) (ii