Question Paper
Class / Subject: Class 10 (CBSE) · Mathematics
Chapter: Chapter 1 — Chapter 1: Real Numbers
Time Allowed: 15 minutes
Max Marks: 6
1. Euclid's division lemma is used to find the: [1]
(A) HCF
(B) LCM
(C) square root
(D) cube root
2. In Euclid's algorithm, the process stops when: [1]
(A) the remainder becomes 0
(B) the quotient becomes 0
(C) the dividend becomes 0
(D) it never stops
3. The HCF is: [1]
(A) the last non-zero remainder in Euclid's algorithm
(B) always the smaller of the two numbers
(C) always 1
(D) the first remainder obtained
4. Every composite number can be expressed as a product of: [1]
(A) primes
(B) even numbers
(C) odd numbers only
(D) perfect squares only
5. Express 156 as a product of prime factors: 156 = 2×2×3×13. This demonstrates: [1]
(A) the Fundamental Theorem of Arithmetic
(B) Euclid's division lemma
(C) the quadratic formula
(D) the mid-point theorem
6. HCF using prime factorisation is found by taking: [1]
(A) the product of the smallest common prime powers
(B) the sum of all prime factors
(C) the largest prime factor only
(D) the product of all prime factors