Euclid’s division lemma states that for integers a and b (b > 0) there exist unique integers q and r such that:
A. a = bq + r, 0 ≤ r < b
B. a = bq − r, r > b
C. a = q + r
D. a = b + q + r
View the correct answer
Correct option: A — a = bq + r, 0 ≤ r < b
This is the starting tool for the Euclidean algorithm to find HCF.
Q.2MCQmediumImportant
HCF of 26 and 91 is:
A. 13
B. 7
C. 26
D. 1
View the correct answer
Correct option: A — 13
91 = 26 × 3 + 13; 26 = 13 × 2 + 0, so HCF is 13.
Q.3Short answermediumImportant
Prove that √3 is irrational (outline the usual contradiction method).
View the correct answer
Assume √3 = p/q in lowest terms. Then p² = 3q² so p is divisible by 3; write p = 3k. Then 9k² = 3q² ⇒ q² = 3k², so q is also divisible by 3. This contradicts lowest terms. Hence √3 is irrational.
The same pattern works for √2, √5, √7.
Q.4Long answermediumImportant
Use Euclid’s algorithm to find HCF(405, 252) and write 405 and 252 as products of primes.
These practice sets use original GKSchools wording — they are not a verbatim dump of the NCERT textbook. “Important” means high-weight practice for the chapter, not a claim that these are previous-year exam questions.