Real Numbers

Rational Numbers Irrational

Numbers
Integers

Whole Numbers

Natural Numbers
 Euclid Division Lemma :

Theorem : Given two positive integers a and b, such that a > b, there exists two
integers q & r such that a = qb + r.

a -
- qb + r
remainder
divisor
dividend
quotient

[Here , Oer <

b)
Basically ye division hi hai.

a > b
③ →
q
20T > £6
612T Divi
0,121
-

d
→ r
divisor

Dividend = Divisor q
. + r

20=6.3-12
 Finding HCF using Euclid Division :

✓- Repeating division lemma

- Technically you have studied this before

✓

For Ex : Find HCF of 36 & 96. 3619£ St④

st
a -_
qbtr E-
96=36-2+24
96-236-04+3 a-
36=24.1+12
36=249+2
on
24=12 .

qtr 24=1202 + ⑧
d
H.c.fi
Already studied division HCF method in younger classes

36296

③ Fi
⇐÷
65¥
If
É⑦si
¥265T Hat . ←

2¥
HE %
Ek aur example

Q. Use Euclid’s algorithm to find the HCF of 1260 and 7344. (CBSE 2018)

7344 I D= 1260
Sy a -_

a -_
bq -12

r 7344 = 1260.5-11044
7344=12609-1
1260 = 1044.1-1-216
1260=10449+7
1064=2-16.41-18-0
1044 =
216g -12

216 = 180.1+36
216 =
180g -12

180=36 qtr 180=360.5+00

d

the H.CI is 36 .
 Kucch alag prakar ke questions :
*
Q. The largest number which divides 70 and 125 leaving remainders 5 & 8
- - -

respectively is ? (EXEMPLAR)

✓
(a) 13 (b) 65 (c) 875 (d) 1750

' '
the is
E- Let no .
n
ql
a -_
qb -12 *
a. 17¥ 2112T
+8
70 =
g.
✗ +5 ; 125=91 .
✗

'
117
I I
65 ✗ q
=
×
.q= ;
i t
117
n is a
factor of nis
af .
of
65
Q. Show that every positive even integer is of the form 2q, and that every
positive odd integer is of the form 2q + 1, where q is some integer. (NCERT)

If
'

e
'

is even a=④q -12

then
d
remainder as 0 .
↳②
a

+0 2Ñ
'
O
'
is odd -
TO
rem.is 1 .

O=2
Q. Show that every positive odd integer is of the form (4q+1) or (4q+3), where q
-

is some integer. (CBSE Delhi 2019)

integer
'
odd
'

S .
a is
41T
a- YI + 1-
]
-

or
Tol 3

3-
Yq
hit
a = +

u
hence proved .

'

E To
Q. A sweetseller has 420 kaju barfis and 130 badam barfis. She wants to stack
them in such a way that each stack has the same number, and they take up the
least area of the tray. What is the maximum number of barfis that can be
-

placed in each stack for this purpose? (NCERT)

d-
10
4204130
H.CI
.

of
420 13-0.3+3-0
=

130 3-0.4+1-0
=

30=1003 + ☒
d
H -
C F
-
.
*
ecube☐
Q. Use Euclid’s division lemma to show that the square of any positive integer is
either of the form 3m or 3m + 1 for some integer m. (NCERT)
✓

93×3
1. 4,9, 16,21 16=3.3+1 GEE
✓
•

d 3m -11 3.8+1
92 c- 2-
3m
3^0+1
3-11
3q2EZ
n=3q
11×2--992 = 3 =③m✓ n=3q,3qt1,3q-2@
"

_
✗
=3q -11 31T
✗ 2-
2) 9qq -11
=3q-12
=9q-Hl
✗
3[3q4YqtB+①
.

2=9944-+129
=
3) ✗

= 3m-11
?⃝