Number theory

① Divisibility
② GCD & LCM

③ Congruence modulo
① Chinese remainder theorem

⑤ Diophantine equation
⑥ Fermat 's theorem

① Fermat 's little theorem

② Ender 's theorem
⑨ Wilson theorem

Divisibility

Jf ✗
/ y then there exist ✗ =/ 0 ×
,xEZ
K such that
integer
y=Kx

R%ᵈgg ✗ µ ,
ylz ✗ 12

②
Tf ✗ / Y
,
✗ Iz ✗
141=2)
③ Jf ✗ ly ,
✗ / (y±z) ✗ 12

① Jf a number is divisible by 9
divisible by 9
then sum
of digits
is

Go G , Az - -
- -
an

An + An -1
. 101 + An - 2 - 102T - - - . . 1- Go -10M

=3
an + an -

,
(10-1) + an -
<
(102-1)
( 10
"
+ _ . -

it ao -

1) + Go

+ a + Az t - - . -
t an ,
,
-
 =) An -1 (10-1) + an -2 (102-1) t - - - - -
1- Go (10^-1)
taot.ee/+azt-....tGrY--m-
It must be divisible by 9

⑤ Tf a no . is divisible by 11 then sum

of
digits at odd places minus the sum
of
digits at even places is divisible by 11

as cde

et d. lot C. left b. 103+9.104 + a - b

+ c¥-c+d -
e

Iti JJ a
five digit number 7×+73 is

divisible by 99 , find 3×+24

set 91 @ + ✗ + -1+7+3 )
9 / (✗ 1- y +17 )

9 / (✗ + y -

1)
0 ≤ × ≤ 9 ✗ + y -1=0019 -
①
o ≤ y ≤ 9

o ≤ ✗ 1- y ≤ 18
11 /⑦ -
✗ + y -7/+3 )
-
I ≤ ✗ + y -
I ≤ 17
11 / (Y -
✗ +3
)
y -
✗ +3=0 0111 -

②
As ✗ =\ -1--9
,

II. Tf a
four digit number aabb is the

square of a natural number n

, find n

Set aabb = a. 103 + a. 1021-6-10 + b

-
 10 .

(9.102+5)+(9.102+6)
ll(a.l0 -

This must be divisible by

11

11 / Iooatb
100 at b

=) at b must be divisibleby /I
-

a = 2 8=9 2299 (
II. (2.107-9)
False 2-11-2090
As 7744 9=3
,
b =
8 11 .

(3.102+8)
3. digit 11 -
308

Find
It number
of naturel nos which see

efnd to sum of squares of their digits .

Set ✗ yz / ≤ ✗ ≤ 9
,
0 ≤ ✗ ≤ 9
,

2+1,2+22
0 ≤ Z≤ 9
✗ '
102+4.101-2 = ✗

-
✗ ( 102 -
✗ ) + y ( lo -

y ) = 22-2=26-1 )
It
✗ ( too
mtY-
-
×
)
Min value

✗ =L

Result .
Unit
digit of a
perfect szueee
ends with 0
,
I ,
4 ,
5
,
6
,
9
-
0--0 -
-5 -6
-

2
Odd
1-

{
-

Even
-
-4
-
9-

Ill .
Find the number
of perfect squares

containing 100 Zeus ,

100 Ones ,
1002's
 Set sum
of digits =
multiple of 3

should be
perfect squeee
= It

multi / leaf 9

Euclid division Iemma

a
,
b Eet a > b

There exist and L

q

such that a =
26+1,0 ≤ s< b

Ild .
tf a
,
b aee
positive integers such that

not multiple
of
a & b are 3

Find Tre remainder when a'+ b- is

divided by 3

a' + b-
a =
3×+5 5=3/4+5
a =3 ✗ + É
,
6--3/4 + Y
9=3×+24 5--3×+5

Ill Find the probability that

(E) 1-[33+13]
n - me "

/ ≤ n ≤ 100

set
n= + +[E]
w
Case 6
'

, n = 6K n =
,
12
, 18,2 } - - - -

,
-

6K 3kt 2kt
@¥ ]
=

60=30+20 t

(E)
= k

k ⑤ 61 < let I
g-
 K &
≤
6¥ 6¥ < KH

K ≥ 0 & 6K < 512+5

K < 5

K =
1 , 2,3 , Y
n
912,1812£
=

6kt I
-

n =

n= + +
6kt
1=(312+2)+[42+5] (k) +

[6K¥]
6121-1 = 3kt 2k +

[¥-1 ] ktl
=

6%-1
KH ≤ < Ktz

Ill
-
Find pair of primes (✗ ,
× ) such that

2×21-1
<
✗ =

Set Cgi ✗ = 2
,
Y odd pine

i
✗ = odd prime 4=2
,

2- I -

✗ =
2y

✗ 2- I =
8

( ✗ + 1) (✗ 1) 8
-
=

Carseiii ✗ = odd prime ✗ = odd prime .

2- I
✗ =
2-12

(✗ +
1) ( x -

1) =
2×2

%¥f
✗ =2k+1 =
2×2
,
It divisible by 4
 all
Ilf Find the princes p&g ( p -1-2 )
102+7102+22 is the
szueeeoyintgee
Set 102+71-2+22 = m2

( P+Ñt5pz= m2

m2 _

① +25=5102
(Mtp +
2) Cm -

p
-

2) =

SPL

Cesei odd prime [ odd Prime

p = =

CIA Mtptz =
sp ,
rm -

p -

2=2

Subtract

2131-22=510-2

p=z

ca-sebmtptz-pq.am -

p -

2--5

210+22=102-5
4=+17--1-5
P2 -210-22--5
-1×+71+-1=-15 pz -

2p -22+4=9

(p -

2) (2-2)=9
p -2=9,9-2--1

( 11,3 ) ( 3,11 )
C mtptz =
5ps M -

P -

2=1

210+22--5102-1
2 ( PTI ) =
SPE -

210+22=-5102-1
210+1 =
[ ( sp -

2)
 e- -

2 Ptl ≥ 5p -2 .

3 ≥ 3 P

p ≤ I

Resist The product of r consecutive

is divisible !
integers by re

(12+1) ( Ktz ) (12+3) - - - -

( Kth ) must be

e ! integer

k!(K+Hg%Ck+H---G
'"
=

Ilf Prove that @ 1) -

n
@ +4 ) is divisible by 6

MEN

set @ -

1) n ( n +1+3 )
( n -

1) n ( ntl ) + 3 ( n -

1) n

7. =:

Prove that divisible

Ifl Coo ! ) ! is by

99 !
( too ! )
Set @ !) ! (1-2-3)
(4.5-6)
} 2

}
( 4 !) ! (1.2-3-4)
°
(5-6.7-8)
i.
g, ,
,
,
, , ,
, , ,
 }
(5 !) ! (1-2.3-4.5)
"
i.
(116.117.118-119-120)

{
@ !) ! ( 1.2.3 - - -
n
]

No
.

of +
1) ( ntz ) _ . .
@ D) → I → 2nd
group
gents
! (27+1) (27+2) (2) → 2 → 3rd group
c- 1)
- - -

:
'
" :

(4-1) ! ) Kris ! )n+i ] -1 . . . .

Kati ! -1 )n+n ]
m e

Result EZ+ "

tf a > 5 am is
b s
a.
-

divisible by a- b

Tf divisible by
"
n is odd ants is ats
,

an -5 =
@ -

b) ( an
-
'
+ an -2s + an -3Gt - - - - + 5- )
'

I n r

Ilf Prove that 2903^-803^-464^+261 "

is divisible ¥97 → 7
↳
271
Set
(2903^-8034)-(464^-2617) -

JEFF ,
2%1=7

(2903^-4647) -
-

(803^-2614)
-

gcd
(24-39,542) =
271

Resist Exponent of a
prime no -

p in n !

(F) +

(F) [
+ + - -
 Find exponent ) 3in too ! n !

E. ( 1.2.3.4 _ _
.
- 100
)
E ( 1.2.3 -4 - - - - m
)
E. ( 3- 6-9-12 - -
- -
99 )
F- (P -
2P Bp - - -
-

(g) ) P

33 + F- ( 1.2.3 33
)
(g)
n + F-
( 1-2-3 [ ¥])
- - . .

- - - -

33 t E ( 3- 6.9 - - . .
33
)
33 + 11 + F- (I -2 -3 - - -
11
)
(f)
1- F-
(I -2-3 - - - - -
m
)
33 t 1 It F- (3.6-9) (
(F) 2p.3p
+ F- p -

33+11+3 F- ( 1.2.3 )
[ ¥ ]P )
t
- -
- -

[ F) P

[¥1T:] C¥]P=[¥]P
PIT [¥ ] =⇐] ,
✗ ER
,
new

Put ✗ =

Itf ,
o≤
Y -
I

] E.)
=m
-

In
= mts o≤ s - l
,

integer =
⑦ + ns
→
integer
RI
⇐ ]=[¥]
=[m+;I ]
ns
@ nstf ]
must be = +

integer
no ≤ s < I

o ≤ ns < Dn

{ nstf
≤ 0 ≤
o ≤ ns n -

I < n

◦ ≤
g- i ◦ ≤
ns;1< I
 Ilf Find the least value In so that

n
! ends with n EN

!
n
lr2.3.4----M-
=

NOT 's off 's

2 > No 5

have
we to
find the exponent-95
(E) [3-2]+1;→]+
+ 497
=
- - - -
- -

497
3- +
¥ +
¥ t >
- -
- - -

my 7497

n>1
④
[1%0]+1'÷+
- - - -
.
.

④
ˢ]+{]+
- - - .
-

E÷j+E÷j+
- - . .

Results GCD
a. SEN
on

① If a =
62+1 ,
a > s

gcd of ( a. b) =gcd of (b) e)

Pif let (a) b) =D

,
(b , e) = e

a bets
④

{
__

dla and <

anddls.by
d / a

d / (a- 2b )

④ <

die -
①
?⃝
 e / b and else

[
e / 2b and ele

el @ stet
ela

a =
qbte
e
/ d
u

Resit tf dis
GCDY
the a & b

then there exist

integers ✗ and y

such that ax + by =D

a = b 2 , te Ose < b
, , ,

b =
e 22+12
,

try =
er 23 +
93

:
in

Ln -

I
=
In Ent , +
→ Let ↳ subbase
= 0

ln- n Intl

( In -1 , rn ) =
en

( en -1 ,
Tn ) =
@ n -
2 In 1) = ( In -3 In -2 )
,
-

- -
- -
- .

( er ,
,
b) =
( 9 , b)

=D
(a) b) =
en

a =
82 + S, b =
hi 22+12
,

1
,
= a + b C- 2 , ) b =
( a- 62,122+12
b = a 22 -
b
2122+1

ez =
C- a) 22+(1+2122) b
 In =
a ✗ + by

Ill of a / be and (a) b) = 1 , peovetnt

a / c a) b) CEN

Sd a ✗ + by =/

Multihlx by C

acxts.ci/- Cacx+aXy- CcxtXy- C-

a

Ilᵈ what is the

god of natural nos m&n

if after increasing m by 6
, gcd of
nos increased 9 times

Sed (Msn ) =D
,
(m+6 ,
n )=9d
dtmldln mxtny =D ( Mt 6) ✗
'
+ my '=9d
,

(mix
't ' =
9

dlm all @ + 6) ×
'

d / fmx /
+6×1 )
9dL @ to )
MX 't 6×1
d / (Mto ) ,
dlm
d-
/ 6×1
m¥
d 6 +

d-
d = 1 , 2,3 ,
6

dla ,
d / b =) all @ -
s )

]
Result
gcd ( na -
1
,
no -
1) = nscdca 's _

,
-

Ped .
aab
gcdla , b) gcd ( na - I nb _

1)
,

(a) b) =D
gcd ( b)
b)
( na
'
.

no
a-

gcd 1)
=
-
n -

gcd ( na ( nb a) nb 1)
-

I -
_

gcd ( n' ( nd a- 1) nb 1)
-

a =
kid b = Kzd .

gcd ( nkid ( nkzd

kid
nk d- 1)
-
-

_
, ]
,

sad ( n'
"
ᵈ(n
nd -
I

(a) b)
ngcd -

Find
god of (2100-1 ,
2120-1 )

(2100-1 ,
212° -

1)
(a) b) (a) a) 2120-2100 )
( 2100-1
= b-
←
,

( 2100-1 ,
2 '°°( 22° -
l ) )
_
\

( 221 , ,

It .
Find the number
of pairs ( m.nl m > n

of positive integers such that

ged ( ntl ,
Mtl ) =gcd( n +2
,
mtz
)=gcd(nt3 ,

)
mt3 - - - .

gcd ( m
,
2m -

n ) =)
,

Mtn < 20

Sed g
ed ( ntl ,
m -
n ) =gcd(n+2 ,
m -
n )

=gTdTn+s
-
,
m -

n ]
=gd(n+m
?⃝
 =
1
( ntl
,
m -

n ) =
1

(
m - n )
( ntz m -

n ) = I
" "
,
" "
"" " •

@ +3
,
m -

m
)
=
1 Ntl
,
7+2
,
7+3

i.
i - - - -
nt(m -
n )
:

→ → m -

n =
1

Mtn < 20

ntltn < 20

19-2
n <

Diophantine equation
-

Simtdestfoemef diophantine
equation
a ✗ + by = c. a ,
S
,
C aee

Constant
integer
Result hes solution
by
integral
a ✗ + __ c
-

in ( xox )
if gcdca >
b) Is
Set Let
gcdca ,
b) =D

let dxc

2×+44=21 d / a and dlb

all @ ✗ + by )

dlc

Tie ) Factorization
Find the no -

Y integral pairs ×
, y

satisfying ✗2+y2= ✗ + ✗ +2

Set ✗ (x -

1) 1- y( × -13=2
- -

✗ ( ✗ -11=0 & y( y -11=2

 ✗ (x -
1) =
I & y( y -
1) =/ _ (False)

✗ ( ✗ -11=2 & ✗ (4-1)=0 Aus

Idf Find the no .

of pain (×, y ) EN

fer which

✗ t 241-31 =
2012 such that
y

y / X or Y / 3

Set y / ✗ ✗ =
Ky

K¥=
✗ t 2y + 3 2012 .

✗ + 24 + 3K = 2012

Ky + 2 yt 3K = 2012

Ky +24 t 3kt 6=2018

-

y ( lets ) 1- 3 (12+2) =
2018

(let 2) ( y +
3) =
2018

✗ 1003 =3
y
=
,

Ill Find tie no .

) integer quadruplets
(a ,s , c. d)

Satisfying
b
① I ≤ a ≤ ≤ c ≤ d

② abt Cd = atbtctd +3

Sef ab -

a -
b 1- Cd -
C - d =3

ab -
e -
btl 1- Cd -
C- d +1=5

@ 1) (b- 1)
-
+
C- 1) ( d- 11=5

a I
?⃝
 Cgi a =L
,
@ 1) Cd -11=5
-

C- I = 1 d- I = 5
,

C = 2 d = 6
,
b = I 01 2

Case
-
ii a -_ 2
,
(b- 1) + @ 1) (d- 11=5
-

b =
2 @ -

1) @ 1) -
=
4

Solving diophantine equation

using inequalities

Ill Solve in case

of positive integers
¥ +
¥ € }=
=
+

Sef let us assume ✗ ≤ y ≤ 2

¥ ≥
:-, ≥
±

±
=)
+ +
¥ ≥
3-

≥
3g
✗ ≤ s

values
Pouihle
of ✗ =
2,3 ,
4

Cesei ✗ 2
f- +
{ 3--1-2 Yo
= =
=
,

10 Yt 1oz =
Y 2

f- £ Yo Yz 102=0
+ =
toy
-
-

2 =

¥ -1¥ ≥
to Y -
lo

10H!1
z =

±, ≥
to
Z 10 1-
tool
=
Y ≤ 20
-
10

(y -10) / 100

y -

to
= 1
,
2
,
4,5 ,
10

y = 11 ,
12 14 15,20
, ,
 (2 ( 2,14 , ), ( 2115,30
,
11
,
110 ) ,
( 2 ,
12 ,
60 ) ,
35
)
( 2,20 ,
20
)
( 3,4 , ] (3,5, 15) (3 6,10 )
Gs ✗ =3 Go ,

Cn ✗ =y ( 4. 4,10 )

C 12=5 (5) 5,5 )

Ill Ci ] Find all pairs

of positive integers ( ×
,x )

satisfying
'
yx
'
-

y
✗ =

'
/ '"
Sed tf ✗ =L ,
I =
y
,
y=1

4=1 ,
✗
'
= 1×-1 ,
✗ =/
"
✗ =y ✗ = 1 ✗ =y=1
, ,

"
Divide by y ,

"
y✗-2y
(¥ )
=

Y LHS RHS I
< 1 >
✗ < y ,

1×-2
" "
LHS
(¥ )
'
× > 2Y > 1 > ,
, ,

Also
,
Y / ✗

✗ =
Ky

yky
" y
(Ky )
-

yk
-

I
Ky =

yk
-2
K =

-2
K=2
,
2 = y2 ( False)
12=3 3 =
y
,

≥
12=4 4 =
y 4=2
, ,

K=5, 5 =
y3 (False)
As ( 1,1 ) ( 9,3) ( 812)
Illi ) tf the sides
of a D aee
integers
and area
of the is numerically

equals to its perimeter . Find the

Ingest poeeihle aeea

Set Sls -

a) G- b) ( s c) - = 452

5- a = X
,
S -

b=y , 5- C=Z

✗ + ytz = S

✗ yz = 4 ( ✗ + ytz )

Aieume ✗
≥ y ≥ 2 .

Xyz ≤ 4 .
3 ✗

yz ≤ 12 .

22 ≤ 12

2 1
2,3
=
,

An 60
Second order diophantine equations in 2 Variables

using quadratic egn

Ilf Gwen ✗

7×11+42=(+3-4+1) Solve
Yee

integers
set let ✗+ y = 3k
,

y = 3K -
✗

Et ✗ ( 3K -
x ) +③ K-
✗ F- @ } +1

* + 3K ✗
# + 91Gt ✗ I 6k ✗ = K' +316+312+1

2
✗ -3K × -

( let -

616+31<+17--0

✗ = 3k ± FÉÉÉ
2

D= 4kˢ -
15122+121<+4

214-1512-4
i
( K-25 Chieti )

✗ = 3K ± (K 2) -
¥+1
a-
412+1 =
② ✗ +15
41<+1 =
412+4×+1
K = ✗ 4- ✗

✗ =
3K ± (K 2) (22+1)
-

a-
✗
(3Ñt3t)a±@+2+)
=

An ( 35+13-1 ,
3d -
Pt 1)
,
DEZ
 all
Ill Find the sum
≥
of positive integers n

fee which n -19m +99 is a

perfect square

A- 38

Its value
Find the
of n so that

2200 _ 2192 .

31 + 2m is
perfect
S{ here
Sed 2192 (28-31) + =
K
"

2N = K2 _
2192 .
225

(K 296.15) ( let 29615)

"
2 = -

K -

296 .
15 = 29
,
let 296.15=26

An 198

_ll let ✗ be the

greatest number by

which
if we divide 366
,
513 and 324

then in each case remainder is same .

Find sum
of digits of ×

Sef 366 = ✗ .
ath _
① ② -
① ,

513 = ✗ • bts -
② ✗ ( b- a) =
147

324 = ✗ •
Cts - ③ ✗ ( a- c) = 42

✗
( b- c) =
189

✗ must divide 147,42 189

,

✗ =
GCD ( 147 ,
42 , 189 )

✗ =
21
 modulo
Congruence
Find the
Illˢ remainder when

32

3232 is divided by 7

Sef 3232 = 216° 23 = 1 mod 7

,

gz2 → check
congruency
with 3

22=-1 mod 3

2160=-1 mod 3

2160 = 3×+1

323×+1 =
215×+5 = 215
"
.
25

"
2 = I nod >

2157 = I nod 7

25 -= 4 mod 7

215×+5 = 4 mod >

test
Its Find 2
digits of
777
Sef 74=-01 mod 100

④ → check
congruency
with 4

72 _= I nod 4

76=-1 mod 4

7=-7 mod 4

Multiply , 77=-7 mod 4

77=-3 mod 4

=
4×+3
?⃝
 4×+3
=
>

7kt I 1 mod 100

73 I 43 nod 100 Are 43

"

Ill Find test 2

digits of 202,20232°
set 2021=-21 mod 100

20212 = 41 mod 100

20211 I 81 mod 100

20218 = 61 mod 100

Multiply ,

20211£ I 01 mud 100

*
202 / = 100×1-1

202
,2023 → Check congruency with 15

2023 I -2 mod 15

20234 I 1 mod 15

20232024 I / mod 15

20232025 -= 13 mod 15

2025

2023
2 02 / = 202,15×+13 An 61
?⃝
Ito How many positive integers ? dem than 100

Cee there
fee which

2. 36 " + a. 23^+1 -
l is divisible by >

fee all n EN

"
Sed 2 .

(28-1) t 2A . (1+7)^-1

}
"
2. C- I t 29 -
I

must be divisible by >

29+1
An ly

Chinese remainder theorem ( solving linen

congruences )

Itt Find all the relations

of
✗ = 2 mod 3 ✗ =-3 mud 5
,
-

Set ✗ =
×
, (5) + ✗z (3)

Taking nods
,

2 =
✗ , (2) ✗ I
=
1
,

mods
Taking
-

3 = 3 . ✗ z
✗z = I
,

✗ = 8 1- 1st
⑦ Find all tree relations
of system
of
equations
✗ I 2 mod 4 ✗ =-3 mods ✗ = 1 mod >
, ,

Sd ✗ = ✗, ( 5. 7) + ✗2 ( 4. 7) + Xs (4-5)
Taking
mod 4

2 = ✗ I C- 1) ,
✗ 1=-2

Taking nod 5

3 = ✗< (3) ✗ 2=1

,

Taking
nod 7

Xz = -

✗ = -

70 1-28-20 = - 62

An -821-140 t

⑦ Find all the relations

of
✗ = 88 mod 6 ✗ I 100 mod 15
,

Set ✗ = 88 mod 6

✗ = 4 mod 6 ✗ I 10 mod 15
,
11 11
2
3 3 5

✗ I 0 mod 2 ✗ = I nod 3 ✗ E o mod 5

, ,

An 101-30 t

④ Solve the system of linen congruences

5- ✗ = 1 mod 6
,
3 ✗ = 2 mod 5 4 ✗ = 5mod7
,

Set 5X = I nod 6
,
3×-22 mod 5 4×25 nod 7

5- I -

I nod 6 33 -2 mod 5 4 = 4 nod 7

mod l mods ✗ =-3 mod >

-
✗ = -

l 6 ✗ = -

Are ✗ = -

151+2 lot
Ill -15 N = 1 23 45 6 7 89 10 11 12 - - - 53 be 9
-

97 digit number Find tree remainder

when it is divided by 45

Sef N =
gx

N I 0 mod 9 N =-3 mods

,

N =
KI . 5 t K2 .

As 18

Relation between GCD and LCM

"
N
,
=
p, pz✗2 13×3 _ . _ . .

B'
Nz =
P, PZPZ BB . . . - -

min (9) Bi ] mink Ba )

GCD ( N , ,
Nz )
=
p, p,
( ↳ %)
pjmin _ . _ . _ .

(✗
LCM ( Nl
,
Nz ) =
p ,ma✗(✗i ,
Bi ]
pjmax
2
, BJ

✗ (✗ 3 B)
pgma - - - - -

Ill
-
-16 No .

of oedeeed pairs (✗ i B) such that

LCM
of ✗ & B is 174 pips? . . _

(2×1+1) (2×2+1) (2×31-1) -

- - -

Ill No -

of fillets (✗ , B ,
V ) such that

" "
LCM
of ✗
,
B ,
V is Pil Ps Ps - - -
.

④ +15 -
✗ F) ( @ +15 <
-

✗ E) _
. _ . .
④ Consider 3 naturel was a , b. C Such that

2 ≤ a ≤ s ≤ c and whenever the

product of any two is divided by tied

leaves the remainder 1 .

Find the value
of
atbtctabc .

Set as = K , Ctl

bc =
lez at 1

Ca = K, btl

ed (a) b) gcdcs c) =gcd( c. a) =L

g
=

a = c) 1m b =
✗< M
,

dam C =
Kai , m ) + I

False )
1m (
✗ 2C =
1221 , +

abt bet ca is divisible by a b.

Cast
-
1 ,

Sctca -
I = K ( abc )

{ § +
{ Ktasc
=
+

ta § {
+ + > I

as bs C

9=2 b =3
,
C- 5
,

Raft
① Let × & y be 2 natural ones

✗ y = LCM ( ✗ , y ) GCDCX , y]

Pegg LCMY ×
,
y se L

GCDY ×
,
y be H

✗ =
MH Y =
NH
,
 ✗ Y = Mn H2

✗ y =

(mnH)H
(Lamy ✗ & y ) CGCDY ✗ & y )

② HCF and LCM

of § ,
§ ,
9 ,
b) C) DEN

↳ CF
( § ,
§ )
=

scdla.sk/-gcdCc.d1--1
HCF

Lcm (b) d)
( a. c)

LCM (
Lcm
(§ §) a. c)
=

É)

Proof (§ §)
texiyt.mn/texiytomin
HCF
;
= →

-
,

91¥ ¥y
must be naturel no
,

9¥ , ¥ EN

✗ ( maa ) must divide both a & C

be both Std
Ycmin ) must divisible by

③ Jf G
,
B
,
C EN

abc = Lcm ( a , b. c) HCF ( a. b) HCF ( b. c)

HCF ( Cia )

HCF ( a ,b , c)
p
a = 223352 22-3

32
b =
325273 ✗
gz

C = 5372112 7 72 112
a
R
 let devote tree elements
p product of
HCF Ca , b) = P ( PAONE ) P( Prank )

HCF ( b. c) =
P ( Frank ) P( Pharr )

HCF ( Cia ) =
P(pnÑnR ] PCPNQNR )

HCF ( a ,b , c) =
Pcpncenr )

Lcm ( a. b. c) =
Pcpnctnr ) p( Frane)

P(FnñnR ) P ( Frank )
P( Pnctnr ) P( Phone )

PCPNQANR )

asc = Pcprianr ) p( Fnonñ ) P ( Frank)

≥ -

( Pnonñ )) ( p(PnñnR ) )

@ ( Frank ) ) )ˢ
-

@ ( Pnanrl

Ill The
difference of LCM and
HCFY n & / 8 is

120 Find n

Sed HCF (n , 18 ) =p

Pq = n
,
Pr= 18 @ se) =L

Lcm ( Pz Pl ) =
PIL
,

PIL p 120 2h
1=1%0 P/
-
- = 120
, ,

Pr= 18
, 182 -

p
=
120

182 =
1081-12+10

Gt
2 12+10
=

-18
p / 120 p = 6
,
24
,
60
 But P / 18

p = 6 2=7 ,
e. =3

Ill Three was 1125, 2925 , ✗ aee written

and student is asked to compute

their LCM .
Student misread 1125 as 1725

but still couect

get answer

value
JY the minimum
of ✗ is N

find tree positive integral division

IN

set 1125=3253 , 2925 = 32.5? 13

1725=3-5 ? 1223

LCM ( 1125, 2925 ) = 3253 13

LCM ( 1725, 2925 ] = 3252 13 2213

✗ must contain 23.53

An (1+1) (3+1)=8