Module 3: Numerical ability · Lesson 3.1 · about 16 min
Numbers, divisibility, HCF and LCM
Divisibility rules, prime factors, HCF and LCM with a picture that makes them obvious, remainders and unit digits, so that number questions in the CUET General Test take seconds, not minutes.
Module 3 · about 16 minutes. By the end you will test divisibility at a glance, find HCF and LCM from prime factors, and handle remainder and unit-digit questions.
1. Divisibility rules worth knowing
| Divisible by | Rule | Example |
|---|---|---|
| 2, 5, 10 | last digit even / 0 or 5 / 0 | 3,470 works for all three |
| 3, 9 | digit sum divisible by 3 / 9 | 5,832: 5+8+3+2 = 18, so by 3 and 9 |
| 4, 8 | last two / last three digits divisible by 4 / 8 | 7,136: 136 = 8 × 17 |
| 6 | by 2 and by 3 | 4,152 |
| 11 | (sum of odd-place digits) − (sum of even-place digits) is 0 or a multiple of 11 | 4,356: (4+5) − (3+6) = 0 |
2. HCF and LCM from prime factors
- HCF
- highest common factor: the biggest number that divides both (the middle of the picture)
- LCM
- lowest common multiple: the smallest number both divide into (everything in the picture)
- Physical meaning
- HCF answers "largest equal pieces" questions (cutting ribbons, tiling a floor with the biggest square tile); LCM answers "together again" questions (bells, traffic lights, runners on a track). The product rule only holds for two numbers.
3. Remainders and unit digits
For remainders, use the remainder of a sum or product is the sum or product of remainders: the remainder of 47 × 52 ÷ 5 is (2 × 2) ÷ 5, remainder 4.
“1 is a prime number.” It is not: a prime has exactly two factors, 1 and itself. 2 is the only even prime. Questions on “how many primes between 1 and 50” (there are 15) catch people who count 1.
4. Practice
- Learn the divisibility rules for 2 to 11; 11 uses alternate digit sums.
- HCF = product of shared primes; LCM = product of all primes at their highest powers.
- HCF × LCM = product, for two numbers only.
- HCF for “biggest equal pieces”; LCM for “together again”.
- Unit digits repeat in cycles (mostly of 4); remainders of sums and products follow the remainders.
Check yourself
Sources
- National Testing Agency, CUET (UG) syllabus for the General Test (numerical ability) https://cuet.nta.nic.in/ (checked 2026-11-22)
- Questions: original fibub writing for this course
Your ticks stay in this browser. Save them as a file on the course home.
Updated 2026-11-22. The exam pattern follows the NTA CUET (UG) information bulletin as checked on 2026-11-22: check cuet.nta.nic.in for the current year. fibub is a free independent site, not part of NTA; every question here is original. Practice runs in your browser and nothing you answer is sent anywhere.