How to Use This Section
This is your practice powerhouse for Real Numbers. Below are 30+ fully worked problems spanning the whole chapter — number classification, Euclid's algorithm, prime factorisation, HCF & LCM, irrationality proofs, and decimal expansions, arranged roughly from easy to hard.
How to study: First try each problem yourself with the solution covered. Then check the steps. The goal is not just the answer, but the method — in the board exam, marks are awarded step by step.
Keep these formulae handy as you work:
- Euclid's lemma:
- (two numbers only)
- HCF = product of lowest powers of common primes; LCM = product of highest powers of all primes
- Terminating decimal ⇔ denominator (lowest terms)
Solved Examples
Example 1: Classify the number
Is rational, and does it terminate?
Solution:
- Simplify: .
- . Only primes 2 and 5.
- So it is rational with a terminating decimal.
Final Answer: Rational, terminating.
Takeaway: Simplify, then check the denominator's primes.
Example 2: HCF by Euclid's algorithm
Find HCF(4052, 12576).
Solution:
- .
- .
- .
- ; ; ; .
- Last divisor = 4.
Final Answer: HCF .
Takeaway: Keep applying the lemma; the last non-zero remainder is the HCF.
Example 3: HCF and LCM by factorisation
Find HCF and LCM of 510 and 92.
Solution:
- ; .
- HCF = common primes at lowest power = .
- LCM = all primes at highest power = .
Final Answer: HCF , LCM .
Takeaway: Check: . ✓
Example 4: Find the missing number
The LCM and HCF of two numbers are 180 and 6. If one number is 36, find the other.
Solution:
- .
- .
Final Answer: The other number is 30.
Takeaway: The product relation instantly gives the fourth quantity.
Example 5: Largest number dividing exactly
Find the largest number that divides 70 and 125 leaving remainders 5 and 8 respectively.
Solution:
- Subtract remainders: , .
- Required = HCF(65, 117). ; ; .
- HCF = 13.
Final Answer: 13.
Takeaway: Subtract the remainders first, then take the HCF.
Example 6: Bells ringing together
Three bells toll at intervals of 6, 12 and 18 minutes. If they toll together at 6 a.m., when will they next toll together?
Solution:
- Next time = LCM(6, 12, 18) minutes.
- , , . LCM minutes.
- a.m. + 36 min = a.m.
Final Answer: 6:36 a.m.
Takeaway: 'Together again' → LCM.
Example 7: Prove is irrational
Solution:
- Assume , co-prime.
- . Write .
- .
- So 7 divides both and — contradiction.
Final Answer: is irrational.
Takeaway: Same template; the prime here is 7.
Example 8: Terminating check
Without dividing, decide whether terminates and find it.
Solution:
- → only 2's → terminates.
- Multiply by : .
Final Answer: Terminating, .
Takeaway: Power-of-10 trick gives the decimal directly.
Example 9: Composite number check
Show that is composite.
Solution:
- Take 11 common: .
- It factors as , both greater than 1.
Final Answer: Composite (equals 726).
Takeaway: A common factor reveals compositeness immediately.
Example 10: Maximum students per row
44 boys and 32 girls are to be seated in rows with only one gender per row and equal numbers per row. Find the minimum number of rows.
Solution:
- Maximum students per row = HCF(44, 32). , . HCF .
- Rows of boys ; rows of girls .
- Minimum rows .
Final Answer: 19 rows.
Takeaway: Largest equal group → HCF; then add the counts.
Example 11: Prove irrational
Solution:
- Assume (rational).
- Then , a difference of rationals → rational.
- Contradicts irrational.
Final Answer: is irrational.
Takeaway: Isolate the surd; the rest must be rational.
Example 12: HCF expressed as a linear combination
Find HCF(196, 38220) and verify by factorisation.
Solution:
- Euclid: , so HCF = 196.
- Factorise: ; .
- Common at lowest powers: . ✓
Final Answer: HCF .
Takeaway: Two methods, same answer — a good way to self-check.
Example 13: Smallest number divisible by 8, 9, 10
Find the smallest number divisible by 8, 9 and 10.
Solution:
- LCM(8, 9, 10). , , .
- LCM .
Final Answer: 360.
Takeaway: Smallest common multiple → LCM.
Example 14: Decimal places
How many decimal places does have?
Solution:
- Denominator , so , .
- Places .
Final Answer: 4 decimal places.
Takeaway: Places .
Example 15: ending digit
Can end in the digit 5 for any natural number ?
Solution:
- — always even, so it ends in an even digit.
- The digit 5 is odd, so can never end in 5.
Final Answer: No.
Takeaway: An even number can only end in 0, 2, 4, 6, or 8.
Example 16: Word problem with HCF
Two ropes of length 64 m and 80 m are to be cut into pieces of equal maximum length. Find that length and the total number of pieces.
Solution:
- Maximum length = HCF(64, 80). , . HCF m.
- Pieces .
Final Answer: 16 m each; 9 pieces.
Takeaway: Max equal piece length → HCF; count pieces by division.
Example 17: Prove irrational
Solution:
- Assume (rational).
- Then , rational.
- Contradiction, since is irrational.
Final Answer: is irrational.
Takeaway: Rational + irrational = irrational.
Example 18: Largest number with given remainders (two numbers)
Find the greatest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3 respectively.
Solution:
- Subtract remainders: , , .
- Required = HCF(1250, 9375, 15625). , , .
- Common at lowest power: .
Final Answer: 625.
Takeaway: Subtract each remainder, then take the HCF of all reduced numbers.
Example 19: LCM word problem (circular track)
Two runners complete one round of a track in 18 and 12 minutes. If they start together, after how long will they meet again at the start?
Solution:
- They meet at the start after LCM(18, 12) minutes.
- , . LCM minutes.
Final Answer: After 36 minutes.
Takeaway: Meeting again at the start → LCM of lap times.
Example 20: Form of an integer
Show that the cube of any positive integer is of the form , , or .
Solution:
- Any integer is , , or .
- .
- .
- .
Final Answer: The cube is , , or .
Takeaway: Test the three residue cases and expand.
Example 21: Co-prime check
Are 847 and 2160 co-prime?
Solution:
- ; .
- They share no common prime factor.
- So HCF = 1.
Final Answer: Yes, they are co-prime.
Takeaway: No shared prime ⇒ HCF 1 ⇒ co-prime.
Example 22: Prove irrational
Solution:
- Assume (rational).
- , rational.
- Contradicts irrational.
Final Answer: is irrational.
Takeaway: Subtract the rational, divide the coefficient, isolate the surd.
Example 23: Number of decimal places & value
Express as a decimal.
Solution:
- . Only 2's and 5's → terminates.
- Balance: multiply top and bottom by : .
Final Answer: .
Takeaway: places, matching 0.0875.
Example 24: Stacking books
There are 96 maths, 240 physics and 336 chemistry books. They are stacked so each stack has books of one subject and all stacks have the same height (number of books). Find the maximum books per stack and the number of stacks.
Solution:
- Max per stack = HCF(96, 240, 336). , , .
- Common at lowest powers: .
- Stacks .
Final Answer: 48 books per stack; 14 stacks.
Takeaway: Equal-height stacks → HCF; sum the per-subject stack counts.
Example 25: Prove irrational
Solution:
- Assume (rational).
- Then , rational.
- Contradicts irrational.
Final Answer: is irrational.
Takeaway: Irrational divided by a non-zero rational is still irrational.
Example 26: Smallest number leaving a remainder
Find the least number which when divided by 6, 15 and 18 leaves remainder 5 in each case.
Solution:
- Required = LCM(6, 15, 18) + 5.
- , , . LCM .
- Required .
Final Answer: 95.
Takeaway: Same remainder on several divisors → LCM + remainder.
Example 27: Identify terminating among many
Which of , , are terminating?
Solution:
- → T.
- → contains 3, 7 → NT.
- → T.
Final Answer: and terminate; does not.
Takeaway: Factorise each denominator and scan for stray primes.
Example 28: HCF and LCM relation to find LCM
The HCF of 96 and 404 is 4. Find their LCM.
Solution:
- .
- .
Final Answer: LCM .
Takeaway: Rearranging the product relation gives the LCM quickly.
Example 29: Prove irrational
Solution:
- Assume (rational).
- , rational.
- Contradicts irrational.
Final Answer: is irrational.
Takeaway: Isolate by subtracting and dividing; rationality of the result gives the contradiction.
Example 30: Mixed multi-step problem
The HCF of two numbers is 16 and their product is 3072. Find their LCM.
Solution:
- product of numbers .
- .
Final Answer: LCM .
Takeaway: Product of the numbers ÷ HCF = LCM.
Example 31: Greatest 3-digit number divisible by 8, 10, 12
Find the greatest 3-digit number exactly divisible by 8, 10 and 12.
Solution:
- LCM(8, 10, 12): , , . LCM .
- Greatest 3-digit multiple of 120: (since ).
Final Answer: 960.
Takeaway: Find the LCM, then the largest multiple within the required range.