Learn › Class 10 CBSE · Mathematics › Real Numbers
Real Numbers — Class 10 CBSE Mathematics MCQs with Solutions
Free Class 10 CBSE Mathematics Real Numbers MCQs with step-by-step solutions covering Euclid's division lemma, Fundamental Theorem of Arithmetic, Irrational numbers, Decimal expansions. Practise online on Prepizo — no login needed.
▶ Practise Real Numbers online (free)
Subtopics
Sample questions with solutions
Q1 — Euclid's division lemma · easy · theory
According to Euclid's division lemma, for any two positive integers $a$ and $b$, there exist unique integers $q$ and $r$ such that:
A. $a = bq + r$, where $0 \leq r < b$ ✓ Correct
B. $a = bq + r$, where $0 < r \leq b$
C. $b = aq + r$, where $0 \leq r < a$
D. $a = bq + r$, where $r$ can be any integer
Solution: Euclid's division lemma states that for any two positive integers $a$ and $b$, we can express $a = bq + r$ where $q$ is the quotient and $r$ is the remainder. The crucial condition is that the remainder must satisfy $0 \leq r < b$ — it cannot be negative and must be strictly less than the divisor. This form is unique for the given $a$ and $b$.
Q2 — Euclid's division lemma · easy · theory
In Euclid's division lemma ($a = bq + r$), what does it mean when the remainder $r = 0$?
A. $b$ divides $a$ exactly (no fractional part) ✓ Correct
B. $a$ and $b$ are both zero
C. $q$ must be zero
D. Division is impossible
Solution: When $r = 0$, the equation becomes $a = bq + 0 = bq$. This means $a$ is exactly divisible by $b$, or in other words, $b$ is a divisor of $a$. The remainder being zero is the defining condition for divisibility.
Q3 — Fundamental Theorem of Arithmetic · easy · theory
The Fundamental Theorem of Arithmetic states that every composite number can be expressed as a product of prime numbers in a **unique** way (ignoring order). What does 'unique' mean here?
A. There is only one way to write the number as a product of primes (disregarding the order of factors) ✓ Correct
B. Each number can be prime or composite, but not both
C. All composite numbers have different prime factors
D. The number of prime factors is always different for each number
Solution: Uniqueness of prime factorization means that if you factor a number into primes, you will always get the same set of primes with the same frequencies, no matter which method you use. For example, $12 = 2 \times 2 \times 3 = 2^2 \times 3$ is the *only* way to express 12 as a product of primes. You cannot express 12 as $2 \times 5 + \text{something}$ or any other prime combination.
Q4 — Fundamental Theorem of Arithmetic · easy · theory
According to the Fundamental Theorem of Arithmetic, what can we say about any integer greater than 1?
A. It is either prime or can be uniquely expressed as a product of prime numbers ✓ Correct
B. It is always composite
C. It must be even or odd, never both
D. It can be expressed as a sum of primes in multiple ways
Solution: The Fundamental Theorem of Arithmetic covers all integers greater than 1. A number is either: (1) prime (has no prime factorization other than itself), or (2) composite (can be uniquely factorized into primes). This theorem guarantees that every number falls into one of these two categories, and composite numbers have a unique factorization.
Q5 — Irrational numbers · easy · theory
Which of the following is the definition of an irrational number?
A. A real number that cannot be expressed as a ratio $\frac{p}{q}$ of two integers (where $q \neq 0$) ✓ Correct
B. A number that is not an integer
C. A number that is negative
D. A number whose decimal representation has finitely many digits
Solution: An irrational number is precisely one that cannot be written in the form $\frac{p}{q}$ where $p$ and $q$ are integers with $q \neq 0$. This is the defining characteristic. Note that 'not an integer' is too broad (includes fractions like $\frac{1}{2}$, which are rational), and negative numbers can be rational or irrational.
Q6 — Irrational numbers · easy · theory
Is $\sqrt{2}$ a rational or irrational number? Which of the following best explains the answer?
A. Irrational, because it cannot be expressed as $\frac{p}{q}$ for any integers $p$ and $q$ with $q \neq 0$ ✓ Correct
B. Rational, because 2 is an integer
C. Irrational, because it is a square root
D. Rational, because it has a finite decimal representation
Solution: $\sqrt{2}$ is irrational. We can prove this: assume $\sqrt{2} = \frac{p}{q}$ for some integers $p$ and $q$. Then $2q^2 = p^2$. By prime factorization, the left side has an even power of 2, but the right side has an odd power, a contradiction. Therefore, $\sqrt{2}$ cannot be rational; it must be irrational.
Q7 — Irrational numbers · easy · theory
Which of the following numbers is irrational?
A. $\sqrt{3}$ ✓ Correct
B. $\frac{22}{7}$
C. $0.333...$
D. $\sqrt{16}$
Solution: $\sqrt{3}$ is irrational (similar proof to $\sqrt{2}$: assuming $\sqrt{3} = \frac{p}{q}$ leads to a contradiction using prime factorization). $\frac{22}{7}$ is rational by definition. $0.333... = \frac{1}{3}$ is rational (repeating decimal). $\sqrt{16} = 4$ is an integer, hence rational.
Q8 — Decimal expansions · easy · theory
Which of the following fractions (in lowest terms) has a non-terminating repeating decimal expansion?
A. $\frac{1}{6}$, because $6 = 2 \times 3$ and contains the prime factor 3 ✓ Correct
B. $\frac{1}{8}$, because 8 is even
C. $\frac{1}{5}$, because 5 is an odd number
D. $\frac{2}{10}$, because the numerator is 2
Solution: $\frac{1}{6}$ has denominator $6 = 2 \times 3$. Since 3 is a prime factor (not 2 or 5), the decimal will not terminate. Computing: $1 \div 6 = 0.1\overline{6}$ (the digit 6 repeats). In contrast, $\frac{1}{8} = \frac{1}{2^3}$ terminates as $0.125$, and $\frac{1}{5}$ terminates as $0.2$.
Q9 — Fundamental Theorem of Arithmetic · easy · theory
The sum of the exponents of the prime factors in the prime factorization of 196 is:
A. 1
B. 2
C. 4 ✓ Correct
D. 6
Q10 — Fundamental Theorem of Arithmetic · easy · theory
If HCF(a, b) = 12 and a · b = 1800, then LCM(a, b) is:
A. 3600
B. 150 ✓ Correct
C. 900
D. 120
Q11 — Fundamental Theorem of Arithmetic · easy · theory
The values of x and y in a factor tree where x branches into 3 and y, and y branches into 3 and 7, are:
A. x = 10, y = 14
B. x = 21, y = 63
C. x = 63, y = 21 ✓ Correct
D. x = 18, y = 9
Q12 — Irrational numbers · easy · theory
The smallest number by which √27 should be multiplied so as to get a rational number is:
A. √27
B. 3√3
C. √3 ✓ Correct
D. 3
Q13 — Fundamental Theorem of Arithmetic · easy · theory
The ratio of LCM and HCF of the least composite and the least prime number is:
A. 1:2
B. 2:1 ✓ Correct
C. 1:1
D. 1:3
Q14 — Euclid's division lemma · easy · theory
For some integer q, every odd integer is of the form:
A. q
B. q + 1
C. 2q
D. 2q + 1 ✓ Correct
Q15 — Irrational numbers · easy · theory
The decimal expansion of π is:
A. terminating
B. non-terminating recurring
C. non-terminating non-recurring ✓ Correct
D. none of these
Q16 — Fundamental Theorem of Arithmetic · easy · theory
Total number of factors of a prime number is:
A. 1
B. 2 ✓ Correct
C. 0
D. 3
Q17 — Irrational numbers · easy · theory
√2 is:
A. rational
B. irrational ✓ Correct
C. integer
D. whole number
Q18 — Euclid's division lemma · easy · theory
If HCF(a, b) = 1, then a and b are called:
A. composite
B. co-prime ✓ Correct
C. prime
D. perfect
Q19 — Fundamental Theorem of Arithmetic · easy · theory
The exponent of 2 in the prime factorization of 144 is:
A. 4 ✓ Correct
B. 5
C. 6
D. 3
Q20 — Fundamental Theorem of Arithmetic · easy · theory
The HCF of 3³ · 5 and 3² · 5² is:
A. 675
B. 45 ✓ Correct
C. 225
D. 15
Q21 — Fundamental Theorem of Arithmetic · easy · theory
What is the HCF of the smallest prime number and smallest composite number?
A. 1
B. 2 ✓ Correct
C. 3
D. 4
Q22 — Euclid's division lemma · hard · theory
Euclid's division lemma ensures that for any two positive integers $a$ and $b$, the quotient $q$ and remainder $r$ are unique. Which of the following best explains WHY this uniqueness property is important?
A. It allows us to build reliable algorithms like the Euclidean algorithm for finding GCD, and enables mathematical proofs to rest on a solid foundation ✓ Correct
B. It makes division faster on computers
C. It prevents people from arguing about what the answer is
D. It is required by all calculators
Solution: Uniqueness is critical because it means Euclid's division lemma gives us exactly one answer every time. This allows us to build algorithms that always work correctly (like the Euclidean algorithm for GCD), and it provides a rigorous foundation for mathematical proofs. Without uniqueness, we couldn't rely on the lemma for logical deduction.
Q23 — Euclid's division lemma · hard · theory
Can Euclid's division lemma be extended to negative integers? For example, if $a = -17$ and $b = 5$, should the remainder $r$ still satisfy $0 \leq r < 5$?
A. Yes, we can write $-17 = 5 \times (-4) + 3$, keeping $0 \leq r < 5$ ✓ Correct
B. No, the lemma only works for positive integers
C. Only if both $a$ and $b$ are negative
D. The remainder would be negative, like $r = -2$
Solution: Euclid's division lemma can be extended to negative integers while maintaining the constraint $0 \leq r < |b|$. For $-17$ and $5$: we express $-17 = 5 \times (-4) + 3$. Notice that $q = -4$ (not $-3$) so that the remainder stays non-negative. This extension preserves uniqueness and the division property, making it a powerful tool even for negative integers.
Q24 — Euclid's division lemma · hard · theory
If Euclid's division lemma states $a = bq + r$ with $0 \leq r < b$, and this representation is unique, what does this uniqueness imply about the quotient $q$ and remainder $r$?
A. For given $a$ and $b$, there is exactly one pair $(q, r)$ that satisfies all conditions ✓ Correct
B. $q$ is always larger than $r$
C. Both $q$ and $r$ must be positive
D. The sum $q + r$ is always equal to $a$
Solution: Uniqueness means that once we choose specific values for $a$ and $b$, there is only one pair $(q, r)$ that can satisfy $a = bq + r$ with $0 \leq r < b$. We cannot find two different valid pairs. This is what makes the lemma a fundamental theorem — it guarantees that the division process has a predictable, single outcome.
Q25 — Fundamental Theorem of Arithmetic · hard · theory
Suppose someone claims: 'I found a new way to factor the number 60 that is different from $60 = 2^2 \times 3 \times 5$.' If the Fundamental Theorem of Arithmetic is true, what must be wrong with this claim?
A. The claimed factorization must be incorrect or not use only prime factors ✓ Correct
B. The number 60 is actually prime, so it has no other factorization
C. The FTA only applies to numbers greater than 60
D. The person made a computational error but the alternate factorization could still exist
Solution: The Fundamental Theorem of Arithmetic guarantees that there is *only one* way to express 60 as a product of primes. If someone claims to have found a different factorization, either (1) their factorization is wrong, (2) it includes composite factors (not just primes), or (3) it is the same factorization written in a different order. The theorem rules out any genuinely different factorization.
Q26 — Fundamental Theorem of Arithmetic · hard · theory
The Fundamental Theorem of Arithmetic states that prime factorization is unique. What does this uniqueness logically imply about the divisibility properties of a number?
A. All possible divisors of a number can be determined from its prime factorization, and no other divisors exist ✓ Correct
B. A number can have divisors that are not made from its prime factors
C. Divisibility is a matter of opinion depending on the method used
D. Every number has infinitely many divisors
Solution: Since the prime factorization is unique, the set of all divisors of a number is completely determined by its primes. For $12 = 2^2 \times 3$, the divisors are exactly those formed by taking powers of 2 from $0$ to $2$ and powers of 3 from $0$ to $1$: {1, 2, 3, 4, 6, 12}. Uniqueness means there are no hidden divisors outside this system. This makes the divisibility structure predictable and complete.
Q27 — Irrational numbers · hard · theory
For a prime number $p$, is $\sqrt{p}$ always irrational? Which reasoning is correct?
A. Yes, because if $\sqrt{p} = \frac{a}{b}$ (in lowest terms), then $pb^2 = a^2$. By unique prime factorization, the left side has $p$ to an odd power while the right side has $p$ to an even power, a contradiction ✓ Correct
B. No, because $p$ is a specific type of number
C. Yes, but only if $p$ is odd
D. No, if we allow irrational exponents
Solution: For any prime $p$: assume $\sqrt{p} = \frac{a}{b}$ where $\gcd(a, b) = 1$. Squaring gives $pb^2 = a^2$. By the Fundamental Theorem of Arithmetic, the prime $p$ appears an odd number of times (exactly once) on the left, but an even number of times on the right (as part of $a^2$). This is impossible, so $\sqrt{p}$ is irrational. This applies to every prime.
Q28 — Irrational numbers · hard · theory
Can the product of two irrational numbers always be irrational? Or can it sometimes be rational? Give an example if possible.
A. No, the product can be rational. For example, $\sqrt{2} \times \sqrt{2} = 2$, which is rational ✓ Correct
B. Yes, the product of two irrationals is always irrational
C. No, the product is always irrational unless both numbers are the same
D. The question is unanswerable without specific numbers
Solution: While the product of a rational and irrational is always irrational, the product of two irrationals can be either rational or irrational. The key example: $\sqrt{2} \times \sqrt{2} = 2$, which is rational. Another example: $\sqrt{2} \times \sqrt{3} = \sqrt{6}$, which is irrational. So there is no universal rule — it depends on the specific irrationals.
Q29 — Decimal expansions · hard · theory
The number of decimal places after which the decimal expansion of the rational number 14587/1250 will terminate is:
A. 1
B. 2
C. 3
D. 4 ✓ Correct
Q30 — Fundamental Theorem of Arithmetic · hard · theory
If a = 2³ · 3, b = 2 · 3 · 5, c = 3ⁿ · 5 and LCM(a, b, c) = 2³ · 3² · 5, then n =:
A. 1
B. 2 ✓ Correct
C. 3
D. 4