Q1 of 114 Page 9

What do you mean by Euclid’s division lemma?

According to Euclid’s Division Lemma if we have two positive integers a and b, then there exists unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b.


More from this chapter

All 114 →
2

A number when divided by 61 gives 27 as quotient and 32 as remainder. Find the number.

 3

By what number should 1365 be divided to get 31 quotient and 32 as remainder?

 4

Using Euclid’s division algorithm, find the HCF of

i. 405 and 2520


ii. 504 and 1188


iii. 960 and 1575

 5

Show that every positive integer is either even or odd.