Sessin- 2022-4

bsoup- B
(9) State and prOve fundamental heorem o} Aritbmetic.
Ans. State ment au
Evey numbeL n> Can be exressed
product o prime 9he and only Ohe

OR,
bvey positive nteger greate han ! can be
product of primes
expressed umquely °k he factors
upto he ordos
OR
as
a can be expYess ed
Any positie integertoy all þi belng pri mes turther,
a= Pipe.ps - Py
is also given by
a 4:4 qo 4. for all qo being primes
They and
in haiY ordeYs
diffes ony
Proof:- Lot n be nadual nambes greate hcn I.
re n>
Scu p.
.n must haue tleast one pime tacto
Then ,here exist b, such ho
whee n>

T n, =1 hen n=P
’Tesult is po0 ved
n>I Jhen n, must baue atleast one pyime tactor

Then here exists n, ¬N Such hat

whese n>n (2)
from
(3)
h,=! then
is proved continued and ue
process is
h>lhen, abeve
where
he same pDRSS
Simillauly follovoing
o heheorem.
ce
Hee cueaot he existen ungueness oB he heose
haue to show he
Now, We pimes
possible let whese be another set
Such hat

n= 4et3 4s
hat S=S
how, we Shall get
Jhe too values o h we
Equatig and n=4243 - - s
4s

atleast @ne
’ b divides

pime numbe
but 4 is

so simillly we wll PoDWe

 Pi

(4)
T possible let +s
e. Y<S

numbess
Product o! (s) Prima
is a Contaciction , prpct o pimes can
neyer be I, is alucuys greata han I.

- (5)

Hence, we haue he vequred proef ef hehaem.

b) State and prove Gawss lemma
As. biuen 9-Cd ol ap is 1 i-e (9.p) =
Pa-)
irat o al we hele to prove dhat al hese intcqes
e incongurent odudo P.
Let if possible any teeo imteges
modelo
conguvent
Lat sa and ta be conguent numbe. in U)
Sa = ta (moP) I<s,ts P S+t.
 (P,a) J

S-t =0

Which is a contadicien
Theus, all integes ncong urent (mod p)
e diided by þ cnd nene
henefore ,dhey
Can be 2020 Also hone o es Can
esld
which is ot an integes beccuwe P is an
e,
pddl p ma
is obBauned nd dividing
vesicuue
Thes, loLst Positiue
('s eithes > <2
he inte ge -(i1)
2
e

A
Now,
= Va

Since
numbei = n+m
then total (V)
2

P-Y3 - P-Tn <

lot c = P- P-Yi,
Agciùn,
hae fo poue disjoint.
Let ( Posstble
P = t St
 ’ Uat Va =0mod P)

P/tu+vya
P

"Theathore oun C ae disgoint Sohathis unio

clement

Some byoley:

Smi(). edotrs)--ede)

|= a (mod p)
 P

Hene ,tee hae the seqçred poove Moh he gco,b

 C) State and prOve Mobius inveysion foY mula .
Ans- Mbius invex sion formula :
positive integc n
the mobious inuersion formula is dHaed a b
deneted and deined as
if h
if n= P, P P, .. P is he pibdu
Ok k distinct pime
sBatement s
Tf qu) td) toy each pesitive inteqer
then
Psoof:- We haue

Sfte) [twhee c-ConsBant g h-]

Ie haue to Proof

By ) taking RHs we hue

utdfe) Since,
n =dk,

whee nn>c oy n=c

when n>e when hc

 n>c
EE(d)fte) +ftn)x1

ftc) +fn
know by morten's lemma
fWe
= fe[o] +fun Eud) - 0 when h>I

=HS

Hence, ten) =
Yequred p f e heeDrem.
and we hawe he he
quadsatie Te sidue o7 29.
(d find he Prime numbe, P=29
Ans. biiven,
P-l = 4
uadrotie esidwe
then he
t2 (3 4
1P1 32, 4', 5 e 18} e1o;

Then = I,4 ,9,16,25,7,6,20,23, 13,5,23 24,2

Thus, ,456,7,9, |9,16 20, 22, 23,24 q 25,28
qadsotie
Le) Solue he ine Dioghantine eauadien in2z4204 looo.
s. briven equaton is
I12t204 equalion
We knon by lincal diaph eunten
2 a,b,c eI

get
b 20

Now, twe haue to find qcd ef I72 2 20by

Euciden algortham. o)12|3
|12 - 20 X8 +2 160

12

D0, q:cd (i12,20) =4 ie d

Since hooo ie e
l000 4x250)

’ Equation U)is solvable.

Now, lat( ) be he paticul sotion o he

U) seducR to
So, eauati on
1t2 26+ 204 ()
e can wte A c
4 = 12
12-(20 -12x1)

:(2-20x8) x2-20
I12x2-20x16-20
 ’ 4 = (12x1 + 202)
250
(2x250) + 20(-1x250)
= 72x(500) + 20 (-4250) (iv)
) \oo0

Compaisig ando -4250

general Solution.
Let (ai y) be Jhe
e know ht
whereteT

=-4250-12 t
) 500t 20 t
A
431
2 y = -4250-
meed tue souion
take
New
-4250-43t >0
’500+5t> 4250 > 43t
5t> - 500
- 4250,t
[t>-loovi)
-98.83>t-(vi)
get 00 <t< -98-83
)t=-99
he value
putlin
Y =-42s0- 43x(99)
4250+4257

Hence, S 2yi-T is he tVe Selutien ek h

eqution O.
 Gsoup-C
) stade nd proue Chiese semainde Jheorem ud
golve 25% =lo (mod 29).
Ans Stadement
Let m,, m
numbeS Such hat
34 .. My be
vehtively prime
(mim)=1 , whete i*
Then he Uneas
E a, (mod m)
congvuencCes
-1)

t=ay (moc my)

has simultonepus Soltien which is tuniçue moculo

Nol dividing both siou by mg we

m
m

Mk
le knoi hat
k I,2,34 -

So that he in Conguence
M =I(mod m) Ltian CK=b(mod m)

Then Mk I(mod mk)

k i, 2,3, -
 Mi teko patieule poime numbe
Then
mMi
ly 0 (in) ee qet he
óuch ht Simltaneous equation

) (mod)

* Uni qae nesS

Let x,* and X be any too diff. Selution ol he
System
X,* = Ck (mod m)
X,* =ak (mod m) cl2,3,-

iv)
olmod n)

TRus cquaioh ) hes a simuttaneou sotien

tohich
Hence hae he vequired pof.
Now, 600 ho aoueti on eh the secoh peut o
he qes-ion.
Hiuen,
 hat
We kno w

Comyoiriag
b lo
m: 29

q.c-d (a,m) gC-d(2s,29) 1

One ADtotgaan Solution.
So, JheNe
ondy
Neo usina diophaunti ne e4uation ue ccn twrite )
as ( ) und c) as iv)
-(n)

25
x =(25- 1s) -(2g44)4.
25

25 25
-(l- ly) -544y)
25
Let 5444 -V ) 1S+4s =25V
25 -25V-\5 eeek
-25V -15 -(v)
+3)
= 2441)v -(4x3
4
= btV-
4
3-3
4

: by-3 + V-3.
4
A
V 4-ut 3

Ahoy
V3
 4
y T5-5

get
|o-29x I5
25
lo- 435
25
-425
25

=-(1 (mod29)
X=2 (mo20)

Here Selutien ef Uhe guan

xo= (2 is he only
Hence
equation .
Wilson's theore.
Prove
tby tcle and
n's Theorem!

p)
Went:
p me number he (P-)|=-(mod
If P Is a
pime numbes..Suchhot |<as(P-)
let P (s a
lot a be cuny integes
hen
q:Cd (ap) =J
ence equatien Solutien.
dhe cangu has a
unique
=|(modp)
a7

’ aEI(mod p)
a = o(mod p)

P/ta-) (at)
latt
/a-1
be (2,3,4... P-)
each intege
be (23,4,---P-2)sueh
thottoy
IH foltows
is b int eg
nd hene
thot (mod P)
bb = (modP)
P-2) =I
’ (2,3,4,- I(mod P)
(P-2)
(P-)(e-2)! =P-)mod P)

(P-)! =-!(mod P)
sequred pof e he heorem.
haue he
 bobt) (mod 412s =
423 A=
bo6|) Cmod
X=34
433
22330+ l653+ =
1D450 7=3X551
+|0X 319X|4 5X + X
203X5
Hence,
re he
Seletion red qew
is
=5 g and (4
Cecc (3) and O,2)
haue
19) =5
o(m
2093
=
r9) (mod lb4S
I)=I(mod
mol tg) 55xl9( =
209a Seluing
houe
t9) (med (4 = Ay
3139
19) (mod 4465
mod9) 319xI4( E
(9) (mocl 319= I solving
=|4 2 haue ue (2)
19) (mod
5mod
(9)
7E3(modt)
cengryence- inea systemo heQelue
Hhs Ciuan, System o Lincm conguence
2=S (mpol t)
nE lo (mod 23)
his quoslion uth Uhe help el chincole
IWe can Solue
Remainsle heovem.
Hee
= 19
29

Now, ue heeo to have

|X19x 29 606

X M, =m_ : Ux9x29 - 19X29= 55|

m
= |X19 X29 ||X 29 =319
Mo =n
m 19
|9209
||y19x29 = llx
M3 29
We know (Ma m)=!
hat
m) ha niqe soutiou
e Myx I(mod
So, he si multaniow solions o
ue
U) 4 , =I(mod m,) 55|%, =I(mod u)
(2) MXy = |(mod m) 319 X, = | Cmbd(9)
(3) M3 l3 I (mod m) ) 209Xa| (mo2)
=lmod)
Bolvimg
35%,= I(mod )
550( mod t)
55|%, = 551 (mod |)
GE (mod )
 Sessien- 2021-2023
btoup-B
(a) The a andb axe laive pime if cnd
only if
integershee exists integ
Ais het a aund b ae velatvely pime so hat
Ihen by Euclidean Alqovitham thee exist
Such hat
two inteqes
axtby=1
Convexscly
fox some

intege

hue Jhe requred Prof.

Hence tee

(by find he possible soltion ot ll+5y =19.

(c) Tf P s he prime numbes
b) Pind he Pos sible so lutten of
AAns Uhiuen equaion is
lx + 5 7 9 - ) e4uation
imeas diophanten
We know by
Cx +bye get
Cnmpcisng
b= 5

Now, twe hae to fimd q.c-d o i & 5

solvable and dt hay only Ohe

Equatian it) is
soletien.
s4) be he pouticulas soletion of Uhe
Let (xe
equation u) educe to
equ ation U)
(U)
-4 hen he
pt o 9 and Ho
equation (u) Can be Sctis fiedas
|x9+ 5-4) = 19
g9 - 20
T9 19

4=-4 s he only solution of he

Hence 2=9 &
Sessien 20 22-2024 (Grup-e) )
(e) Dona ay Sessien 2022-2024 (roup-B) (e)
 Gseup-c
Ca) Proue that ineal diephantine cquatien
)

where a, bje ben."integers has inteqer solutieHs

and cwhose dg.cd of a and b,
d= (a b) meue Que
Poutiues sott on, hes any solutien (as be
where t is
written as

indege the Given question'-

First pet ef
iveng a, b) =d there exits
Let dc and

equtich (u) both sioe

muliply by & in

( ) + b() =c
a ) 2(() teeo get
New conpaising
and H
equatien U) is soluable cnd
hat
Tt fotlo ws
Solution

Cenuersy,
be a soltien of a+ by = C
Let
(v) must setisties ().
(a,b)
stien,

Yoz,tby
Hence, fist pat compleles -
Preot of Second paut ef he Given quostion :
Cti ven hat he linccw diophcunten equaticn
axtby
a,b,c Gz
and (Xoio) be he solattion o cquation)
(u)

-(u)
Nouw, (n)- (u),ue
(ax1+ bgt)- (axo t byo) = C-c

a ai-o) byo-y iv)

Since, (a,b) d

d=dti b dtn
t a
he vluos o agb in (lv) (ue haue
Put'ing
(V)

t/t(y-0)
 = ot tgt

+| -(vi)
Fom equatien (u) ceee hae.

)tige y) tez

y = Yo -tit
[: t

foom (vi) & U) tee get dhe required Gtenevel

Solutien o the equati on )
(b) Done Session 2022-24 (youp-) )
Sesion 202-24 eup-) (b)
(d) Stote and prgue ule's iterian
R
TF p is ay odd Prime and a is any Itege
Syeh that (ap) =| then proue ha a is a
quadratc residue (mod p) i4 and enly if.
a l(nod P).
A Statement - Tf P is an odd pime anda is an
integer Suchhat (apP)=l hen pouc hat c is a
quedtatie Teside (mod p) iff
E1(mod e)
Pnuf: Given Uhoit is quad cic eside ncol p)
eLe bave
then by cegiitien ohe so lution
x=a (mod p has

Then a (mod P)
Now, e h a to poue thot
a | (modp)
New, (aip)=| ( , P) =!

) a =o (mod p) (by i)]

his is a contadiion
Thuy (p)=
aboue Cengruence aEI(mod p) holes.
Hence the
Conuays y
btiven-hat a |(mod P)
We hae to pove that a is
quadratie vesidue(mcd p)
that
1o > be dhe pmmtie Tot eh puch

ie ( , 2 , , P-i) and (9,p) =1

whee aell,23, --. P-1)
whe
a=yk (mocl p)
Then
Now, (yky = a =I(mod e)
( y k = l(medP)
) mod P)
 kPl pe).

k 2l.

Noto,

abue cenguehce a4(no P) is

Hence he
quadvtic >eiclee medp)
e) Enplas Pinite contimued fractian. Proue that uuy
Tatianal numbe Coun be wnten s Airite csntinud
fractin.
tn finite Contmu ed fraction expressj0n tom

+1

Is Caled finite ContieLed foetion, whene

Qo4as an eR and t is denoted by

Fimte Simple Centiucd fraclien'

A continel ed faetien
[aoiaia24- h] is couled. fiit simple fsntiud
fsctian cund c ant
toy eruple
A Repses ent 25 asfcetinued raction o S.f. cf.
Any.
25 2t )2s (2
9
2)31
342

22
=2+
[2,3,2
which is afiute
Centind Froetis.
Preof of the second pat'
be
tet a Rational numbeL b0

By Eucicts heosem b) a (a,

ba

a- ba,+ -O

fom e! Cautinued tection

Now, in

Com (u)]

[Prom

ao t
[Foo m
 a2t

3t 4

Oneit

Hence , we Con Soy hot eLey tationel mumbes

Can be expycsed a fiite continue Fraction.
 S0ssion 2020 -22

Group-B
(9) Dene Sessih ’ 2022-24 (treup-c) (b
(b) Frnd gcd e 256 aund l66 and express 3.C
256 and |66
Unea combintien ot
baue to find q.c.d by Euci dean methoc
fins. He, ee
HG6 = 4 (256) + 142 956) G6(4
1024
256 = I l4 2)+14 *(42)256l!
142
|42 = |04) +23 (A) |42(!
|(4 = 4(2s)+2 (4
23)114l4
28 = |4 (e)+0

Thus, qcd (256, Ib6)=2 28

isnea Conbinatien form

Now,to change it s
2s
We can ote
2= |4 - 4(28)
|4- 4[142-I14]
4(14)
= |14 - AU42)+
5(|4)- 4(142)
(42)
= 5 [a56 -(42] - 4
=5(056) - 5 (42) 4 ((42)
= 5(256)-9 ((42)
(256)]
= 5(256)- 9[|66 - 4
= 5(256) - 9 W66)+ 36256)
= 41(256)9(66)

Thus,
he xequired Lineas Combinaticn
Hence, this is
(e) Define Legendye Symbo ls. Tf P is an odd poime
Und a nd b re
then Preue composite to
hat
()=+)
Leqendse Symbols let be an odd pime numbe,
ny inte ge Such hat cap)=!,The
cund daimed a
if a s quatsatie Residue mod P)
. \t a is quadetie non-Roside (modP)

for exam ple '

3(mod t3) Tf4hiu is solal

o 4- is solution ef aboue.

þ13 ia 2
(e)
Eule': Gi teie
?=2modts)
Not Solvable

64=-(mod
) 9is mot quouie
Ryeo escdd t o he restiten
Basie propes tes
Th eoyem' let p- bdd psinme and ut ged (ap)!.
qed (ojP) =1- hen he bgcndse symbol hau the
follewing opetiel:

(mod )

(d) (ab)- (4)()

(a) To prove ablmod þ)

Lat us Consiol y a(modp)
=b(med )
qbmop)

Sclvable
Not selyeole Mot Sol
eithee
(A)-)
Conidee a (melp)
 Second pat e} he questi on'
odd paime numbe
Cund a & b
They ee
ue
any -toe integes.
baue to show hot

Vsing euler's criteign we haue

()= tabmod p)
= (mocl )
= (mode).bmodp)

Aise, since he Legendse Symbol Aekes he volue

-! nd ! enly , hecfore

(dcisT n> ond P, P1-Pn Ne the distint

poue that
psime tacBors ot n then

know by fundamentel heoreis Aitbmeie

Pm m
dm ae þostte intoges
Sine P,, Pa1 - Pm ae sulotiely paime to
each oter þoursHhus

P*(-) * - ) - - (
 Henee , tee houe dhe equistd poco.
) Pind he emoùnde when +2+ --. (00 Is
divided by
ohen k>5,hn kI is diisible by (5.
Simce ee is
Taetoy n each

=I+ 2+ bt 94 (med t5)

Hence,he remounde is 8twhen Uhe Sum

is dividod by 5.
diy Rost Eule funcion -
"The Eule funcien os Euley
& funeion is epresendecd by n
hen Ou)
and uhen n! tee doine pen) to be the
numbe o tve inteqes less than n and
selatively pa þ to n
becauge he only tue inteqe less hch 2- R
Telattuely þoime to 12 ae I, 5,7,I|
35-9t = 243-8| =l62
 Group-c
(Q) Deine Gucidis Algorith mlat a an b be posiive
Such hat a b and let 0
integer
Eucid's algorith m hen p®n that 7 (s he
q-c of a aund b.
A Eucids Algorthm - q and b
iniegers
The q-cd of teoo which is
Can be cetexmincd by a poCPSS known
Eucids Algorith m. Move importenty Eucids
algorithm is a teapetod dppi cation of division
algorith n. he g:ct ie Whe Laugest Numbesthot
divcu tuo umbers a temaindo.
Pscof oh he secohol Peut
let a nd b ae two posrti ve (ntegess:
-e
nd b
division lqorthm on a,b 41
Then applging
Such hot

If T=0

b/a
’ (a,b) =b

agoun applying divisian alqeithm oh h.

Then, s.tchhat
b42t
Tf 0
 a a=q2414= (414t)|
So, 1 commen diisor Ok az b
Lat a
a-bq
[: abtit
2 i s 9:d of (b, ).

cgaun Applging divisioh algos ithm oh y2

Ihen

Proceeding Li ke his
negotive
heue a decyeasir8
number
Seqonce

contiue thiu to Xk fènite tems

then we haue dk-k-tk
asb>r>>*3
Hee, Tf divisi en algoith m
Such that

(Gi van)

Bo. Tt is commgn diviso ai

 GBe0 Hence, by he equctien to 4) e haue

b) done bak Gs up-B (a)

Solue

logx=51(mo 2 ) -)
ale knew hot

Compaing
b= 51

Ohe selti en
So,hee is enl
Now, usi diaphatine equation ue can wite (0)

to34 -(u)
(03x =57-24
ST-2x(3
(03
l03-46 -Qx03+ 5) l03
-216

1-2- Syt46)
 5yt4G. ) 5H t46 T03
|03 ’ y l08v -46
= (03V 46

=(5X?0 t3)V -454|

20V + BV-9+

2ov t 3V-l
Let Bv-lu 3U 5u
8V= 5U+|

(3+2)u +-(3-2)

3u + 2u t3-2

3
fo
cet 2u2=3o
U= 3 wt2
67
=135

So, 2E-216 (mode

(46 (haoden
U= 4 -
Seletie

-276
thun prene that
 d) peine Quadrahe sesidues aund Jacobi Symbol
If he congruehce y=a(mogp) is solvable hoh
Poue hat t has exaety ewo solutions.
Ans: Quasaic Residue !
The congux ehce =a (mop)
and ta, p)! ie g-cd of is solvcble
hen a is alled quadrctie eside emod p),
otherteise is Cal ed quadsoie nen-resice (nedp)
Jacobi S mbol !
Tf PSL is an odd integes and
Py is e its pime fectoisation. Then
fos an mnteqe Ja cobi Symbelis denoted
by ( and detined

Lwhene
(J(JA)-- (a) legendse's Sgmbofs.
Prnf e he second pant!- Giwen n
Ea(moopJ
Let Xe be a
solution e he given conguence -
We haue
ro=a (modp)
Hlso, Cp-Xe) satisty yhe gien conguehee
(p-x)? = almed p) (p-x) xo (modp)
nd (P-X ) are tce0 Solutions ef he gien
Conguence
Pess1ble x, be he -therd sotuticn ef Hhe
eonguence Then
 x=amod p)
get
=X?(mod P)

The eBoe erthas p divides (x,-) or p ivies

U Hhe first CaUse tece haue

2=Xo (mod p)
nd in he Second Coye cee hoe
o,= P-X,(modp)
di'stimet solution
a(modp ay
Hence Whe gien conqstehce
Solutions .
exactly
(e) Explaun infiite cantinui fra cion. Poue th et
the kth Convesgen ot he simple eontinued
fsartien

Avs Tnfinite coninued tractio '

An expessien o} he

.to o
is ccled ntinte continad fsactien , ohee
an e R and
Tríiute Simple Continuecd fraction :A Contiuod fracdie
(ao-aq2)-J is callod Infite simple continuco
fsactian if oe2 ahd an a,
er!- C, 2,1,2,l, 2 , ]
Poorf of he second pont
Gjien,
kth Con uerqent o he FSCF (ao i,1-- an] has
he uale
hat Vhe heoren
The previouu semk inicote
is toue fos k =0,A,2

Let us assume hat it is tsue tos km :

tohere 2<msn that is fo hiu o)
Ch = Pm mPm-t t Pm -2 -()
m 4 m 4m- m-2

Note hat he integers Pm-1 qm Pm-1tm

depends on he first m- pcuuti ol deheminators
and
hence hey
independont o, Cne lhus equation emaun
value am is Toplated by he vale
Cm t
amt

Am- mt.
Qm+1
(amt amtl
4m-tm
As bas becn ex plamed ealie he effect ef
thu
Subsition iu to ahnge Cm in to the
Conuesgc.
Cmam
tPrne amtl

t
am m +m-2
am

((m Pm-t 4Pm-z) + Pmt

Cm41 am m-4t m-2)+ am-l

couplefe
 () find Whe sem aunde when 3287 is dividad by29
Ans. bii ven
3237 = x (mod 2) .0)
he ye4uined emund tohich co
whee Y is
hae to find:
let g'= 3mod 23)
32 = 3 (mod 23)
3=2(mod23)
3*= 4 (mod 23)
3t = I(mod23)
>3+ =-| mod 23) both sie
= |
mod3) ( squcuabee Conguance)
38 b (mpd23)
3l6
=36 (mod23)
0 (mod 23)
g32 = l0 (mod 23)
332

36t = G4 (nod 23)

364 = -5 (mod23)
=2s (mod23)
2 (modn3)
3256 4 (mbol 23)
 3287 =3256x 3lb x8x3x3x?
=4x\-1o) x6x( )x9X3 (mod 23)
E-40 X(-66)-27 (mod23)
6x3X4 (mod23)
=t2 (mod23)
3(mod23)

Compering vequed semaint

Henee, remanole is g=3 when 387 is dliviclod

tb) Solue he SysBe % Congy ence

X 2(mod 3)
XEamod s)
=2(med?)
Aa btiven X=2(mod s)
=3 (meos)
X=2l moo )
We can solue hu question tith he help e7
hinecye Remaund heoYem.
Heze
a2 3

mg
Now tue need to hauo
 Hence he equued Solution s

E 35X1X2 t 2x(X3 + ISX 2 X1 (mod 05)

X= 233 (mod ios)

Hence, the eqeined Limeou cengurenee

(c) dauQ
3x+5N+9 D(mod 1)
(ds Sotue Uhe conguence
Ag biiven,
Bx2+5ntg=0 (modu) -O
mulipying by 4.3 both side we qet
36 4 60x+|08 = 0 (mod )

(6)2+ 265x + 5 E S'-10s (mod )

(o+5) = (25-tos) (mo t)
(6x45)² = -g3 (mb 1)
(6x+5)2 =5 (mpd 1)
(6x +5)2
) (Gx+5)2 = 42 (mod)
6t5 =t4 (modu)
67 = -5t4 (modu)
Since he cengeuénce is quadie.
So, has both tve and negative vaues.
fox t valuey b =-|(modu)
 We kne o hot (Me )
ie M Xe =T(nod me) hes (unique solution:
Se,he Zi multanieu Solti on eh D ae
35, = I(m ed 3)
2Ky = (mod s) Max,= I (md m,)

hae, X,=2(moda)
Selving
35x, L(mod3)
O= 69 (mod3)

E2(mod3)
Selving we houe,
2|X1 =I(mod s)
= 20 mods)
211 = 2 | Cmos)
I(mod5)
(4) ee houe
Solving
= |4 (me?)
 0 4 4 (modl)
G=54 (mod )

fox -ve values,

0 = 2 (mod)
6 = 24 (mod )

Hence, two solutions ok equad ion OCULe

2=9 (mocl t) 4 (mod)

e) done
 Gt reup-c
(a) Done
) Detine congruence o} highe degree and tf p
Ohd 2p+1 au both primes ad hetphen
show hat
Avs. le hate he qeheval tosm of a conguence
aith prime Pmoelo cs
-0
ttx) = q,x4-- .. tan =0 (mod P), ,
To Pind he sulien of 0 tee procced a follag
TF Some CD- thicients of fo n e greate
han P. We seduce hem to less then P. Also
It he cegree of foy is not less thon P.
We get emaindes (x) Such hat

Iwhere, he degree of Is lesshan P by using

-x to divide fex)
that ,
is less
e can recuce tyto x) hose degree
such hat
Hhen fP) = r )(mod )
y=x (mod PJ Noo he Prpblem ok
by sing becomes hat ok sclvinq Y()=0 (mo dP)
sclving
Since he degree of ) is less than that ef
fx he calculation is easg
furthe. if fo e f(wf) modP.
e f(X) is a tactoy et fo mocetlo Phen to
Bolue a) is o scluc

Agaun if xa (mod P) is a Solut ion ol (u)-then tc

 We hue

Y=0 (mod P)
"The nayore Cx-a) g) Cmodp)
a facto o4 Foy moduto P.
Hence he prcblen 5clving (1) beco met hat oSolving
g)0 (mod p)
Aqaun, To preue
n+2) pn)+2
Lel, LH:s n+2)
=(4P42)
-[2(2p+1)]
= (2-1) 2P+1-)
2P

Further
R-Hs : D) +2
= (4p) +2
(22p)42.
g(2) p(P) +2
#(2) (P-)42
2P-2t2
2P
and (n) tee haue
jehce, by (u)
Ø(nt2) = p ) 422
tes Tf P is an odd piMe and a is y integ Such
that (aip)=l hen he conqryence =atmopk),
soution iff ()-!
A Gtiven Conguence be
= a (mod Pk) ks!
let x be he solution of he qien congruence.
Then tue ha
xo= a (mod ky

p/-a)
P

) 22 a (mpd ) has a solutian

Thew by Eler's eriterion ( )
Conuersy ( E less oilerian

Thus he givcn stetement is ts ue tos kj.

Now .assume hat Ea Cnod p) has a sotion.
And tee haue to shoo hat
=a (med pmt) alio hcLs a soludion
Lat o be he soltien eh = (mod pm)
Then Ko =a+tp foy Some ntege t.
Thus he Linea Conguenc
Solutien scy Yo
)oyo =J tP tor Some intege tË
Then
 =at pmt (5ome inteqer)
= a (od pmti)
solutien ol =a(mod pm)
mthe maical induction tue
Hence , by principle o
have solution fox k>!.
=a(mod pk) has

(d) dane
(9) done
 Session’ 2028-9020

(a) Define qreatest comman di visoy (g.cd). find he Least

common multiple (Le-M) of ,l2,20 nd 25
ins. byyeate st Common divisoy O: C-D) '
Let a numbeg
d' which divides a and bboth and clivisibla by
all Common diviso ef a und bhen ? ts
Called geatest commen divisor ie Co.c D]
H-cf ef Cab) is callec c-d
Ex- h-CD elk 2 and 15
Hee, Yi5 ie
12 21S.

3 is a 0 Com moh
divise of 22|.
bt, 3 is the qseatest commen divisor.
s0, O-c-D et 2 nd 15 ’ 02115)= Bg
Becond paut of he quetion -
We knon het
Pyoduct ot nunbers is cqual to he prodct ef haiy

i-e if a 2 be he numbers hen

ab = Ca,b] (a,b)
) L·c-M. e} a gb
i-e, [a,b] axb
(a,b)

firstly (12,8) 4
Then, L.c M. ck 12 2 8
Ci2,8] x8 -24 )
 hat integes
-H
nonsuch unique
emnde
poue
ven given
-(u) ti
andr
have6oo
is and ist os<b
to
hene
and an ex and
(20X25* lwe 4,
algotham Hhere
16 20 60O
u)&1) a Intege For quoient
2 posstb
mot
is
24
20
20 24X
8 120
i20 25
O 25
= imtegeren b>o
|20
Ca|(2,20125]
Algorith
4= 2
(24,20) 812,20
o 24 ek 5 divisien
erist
called
oheLe
= = = 20,25]
Ciie ,
9-cd: k 24,20] q:cd
(120,25) U)
ven
asb
L-CM By a Division
thee
4b+r b Y Such
hat
t
LC-M
o
i
Define
Thivdly. Hence, andnd
Secondlly tb)e(c) any
iei Dene
L-C:M
Then, i-e
e Then, b Poaf
td) a
ns
 ceT,bac
(:4 niqu
)6.
(q+
qb,- of
bomuiple set .hae is
-0
b teo if
o} tue Henc
multiple eriste
o 4b, blq+) <b Ii-|<b
but
set hee b(4-4i)=
E4
3b, b tY
a-bq posstble
qreatest 0sa-where
he , a< Possible
b,2b b(4-4)
3-=
consice) sb not =0
ba=abqitbqit
=
bqt
he +Y 6-Y 0 (3
(nputlimq
blo
sis
tohich hat
Such
Lot
a-bq
=Y b4+a Tf
’ is
b/ 0t
Such
hot ss.
Uniquene
eso -b4,
b
is hat
let
Noto o
atbq tohee So
Hhon
Goup
(8)
d) but
da
and
2020-22
Sessian C=an+by
Giroup-c
if
thatdthen
b.
(e)
as
Done
Proue
(0) Hna
ideges
consecie
hree
auay
divisible
by
tthat
6hos
(b)
 FIl=o(moda)
hoy ()
13)
-44
(mod on
e b, equati
sides (Q43)
=9-44
(modrs) mod3) 1s)
(mbd
-3t2quadhotc.
valuas.
negative
and
mt8a (modia)
(2+3)
=-35 (2a43)
13) Dd13) 1s) he
both+440(mo
(mod -|(mo|3)
2x= s)
(n 1a)
(med
27=l2ed e
ce -44(2%)
+9.2(-8
43 4 ts (m seution
And
=smbd
29)
Congmeh 4
4XI= conquence 26
= -5
(2%43) 243 2=
utiplyimg
y 122x12x yalues
Troo
An4 t
che
Solue
(d 42 he
Fience,
done.
(c) Given, Simce
etoy
) both
Ans
 vodues
aticnegative
() quoco
(bd29)
29)
x(5+ (mod29)
=tl|
2 (moda9)
taterin
tutot
se
clh 4
number
pine 28= 29)29) (mod9) 29)
quesfion! Citeu quadotie
isSince (mbl
(mnpd
is and 29)
Conpuenee
(nod29) od hoe
ee ed
vcle
Aue heue(m (m
Euless 34
69 1=12!
-|
24-1 hous le||
both
oL E = =
vale E
odal
îs
pt by he
Then,
iven, -29 ) )
imee, te
He
t
Ond These
Foy for
 intcge
odd
an
Q
TP
Symbol.
cobi
Ta
Def(e)ine
hen