Sanyam Badola

(B-Tech , NIT Bhopal )

Experience:
• More than 3 Years of Teaching online and
offline
• Produced numerous ranks in different
competitive exams like NTSE , Olympiads etc.
• Taught thousand of Students.
80
80
 Objective
• Real Numbers
• Euclid's Division Lemma
• Euclid's Division Algorithm to Find HCF of Numbers
• Previous Year Board Exam Questions
Real Numbers
 Euclid Division Lemma
A lemma is a proven statement used for proving another statement.

Euclid division lemma states that , for any 2 positive integers , say a and b, there
exist two unique integers say q and r , such that a = bq + r , where 0 ≤ r < b.
Show that every positive odd integer is of the form
2q+1, where q is an integer.
 Euclid’s Division Algorithm
An algorithm is a series of well defined steps which gives a procedure
for solving different types of problem.
 The total number of factors of even prime number is

i 2

ii 1

iii 0

iv 3
Use Euclid ‘s Division Algorithm to find the HCF of 612
and 1314.
[ CBSE 2019 ]
Two Tanks contain 504 L and 735 L of milk, respectively.
Find the maximum capacity of a container which can
measure the milk of either tank in exact number of times.
[ CBSE 2012 ]
Find the HCF of 180 , 252 , and 324 by Euclid Division
Algorithm.
[ CBSE 2016,12,10 ]
 The greatest number which on dividing 1659 and 2036
leaves remainder 8 and 4, respectively is

i 124

ii 129

iii 127

iv 305