Number System Formulas and Tricks for CAT 2026: 24 Rules
Number System formulas and tricks for CAT 2026 reward concept depth over calculation speed. The topic contributes 2 to 4 questions per QA section, often in TITA form where there are no answer options to fall back on. This cheatsheet pins 24 rules across four pillars (divisibility, remainders, LCM HCF, cyclicity) and ends with 16 worked questions that mirror the patterns CAT setters reuse year after year.
What separates strong Number System performance from weak is recognition speed. The same TITA question can be solved with a long-hand divisibility check (three minutes) or with the remainder theorem (forty seconds). The cheatsheet below is organised by recognition cue so the right rule comes to mind without searching.
Why Number System Is the Concept-Depth Topic in CAT QA
Number System is the rare CAT topic where the math is light but the thinking is heavy. A divisibility-by-11 question takes one line of arithmetic but requires understanding the alternating digit rule. A remainder question with a large exponent looks impossible until the cyclicity of remainders compresses it to one step. This is why a strong Number System preparation also lifts logical reasoning, since both reward the same kind of structured thinking.
The second feature of Number System: it appears inside other CAT topics. Algebra questions about integer solutions reduce to divisibility. Geometry questions about points on a number line reduce to remainders. PnC questions about counting numbers with certain digit properties reduce to cyclicity. Strong Number System fluency therefore raises performance across multiple Quants areas, not just direct Number System questions.
The 24 Number System Formulas and Tricks for CAT 2026
The cheatsheet groups 24 rules into four pillars. Each pillar has a recognition cue: a sentence describing the kind of question that triggers it. Working pillar by pillar embeds the recognition habit that the pillar tag drill depends on.
Pillar 1 — Divisibility Rules (8 rules)
Divisibility rules let a CAT aspirant check whether a large number is divisible by a small one without performing the division. These eight rules cover every divisor that appears in CAT divisibility questions. Recognition cue: the question asks whether a number is divisible by a specific small integer, or whether a number is a multiple of something.
| # | Divisor | Rule |
|---|---|---|
| 1 | 2 | Last digit is even (0, 2, 4, 6, 8). |
| 2 | 3 | Sum of digits is divisible by 3. |
| 3 | 4 | Last two digits form a number divisible by 4. |
| 4 | 5 | Last digit is 0 or 5. |
| 5 | 8 | Last three digits form a number divisible by 8. |
| 6 | 9 | Sum of digits is divisible by 9. |
| 7 | 11 | Difference of alternating sums of digits is 0 or divisible by 11. |
| 8 | Composite (e.g., 12) | Number divisible by every prime factor of the composite (e.g., 12 = 4 × 3, check both). |
Pillar 2 — Remainder Theorem and Modular Arithmetic (7 rules)
Remainder questions in CAT often look like impossible exponent problems but compress to one-line solutions through modular arithmetic. These seven rules cover the four high-frequency remainder patterns. Recognition cue: the question asks for a remainder, or asks whether a large expression is divisible by something.
| # | Rule | Use case |
|---|---|---|
| 9 | a ≡ b (mod n) means a − b is divisible by n | Basic modular equivalence. |
| 10 | (a + b) mod n = (a mod n + b mod n) mod n | Sum reduces under mod. |
| 11 | (a × b) mod n = (a mod n × b mod n) mod n | Product reduces under mod. |
| 12 | Negative remainder shortcut: a = qn − r means remainder n − r | Numbers close to a multiple. |
| 13 | Fermat's little theorem: ap − 1 ≡ 1 (mod p) when p is prime and gcd(a, p) = 1 | Prime divisors of powers. |
| 14 | Cyclicity of remainders: ak mod n cycles after a small period | Large exponent remainder. |
| 15 | Wilson's theorem: (p − 1)! ≡ −1 (mod p) when p is prime | Factorial-prime questions. |
Pillar 3 — LCM, HCF and Related (5 rules)
LCM and HCF questions in CAT come in three recurring shapes: direct LCM HCF calculation, the product identity, and the remainder-leaving variant. These five rules cover every variant. Recognition cue: the question asks for the largest, smallest, or common multiple or divisor of a set of numbers.
| # | Rule | Use case |
|---|---|---|
| 16 | LCM(a, b) × HCF(a, b) = a × b | Two-number product identity. |
| 17 | LCM by prime factorisation: take highest power of each prime | Three or more numbers. |
| 18 | HCF by prime factorisation: take lowest power of each common prime | Three or more numbers. |
| 19 | Smallest number leaving remainder r when divided by a, b, c = LCM(a, b, c) + r | Same-remainder smallest-number question. |
| 20 | Largest divisor leaving same remainder = HCF of differences of numbers | Same-remainder largest-divisor question. |
Pillar 4 — Unit Digit Cyclicity (4 rules)
Unit digit cyclicity is the cleanest one-trick shortcut in Number System. Every base, when raised to a power, follows a unit digit cycle of length 1, 2, or 4. These four rules cover every case. Recognition cue: the question asks for the unit digit or last digit of a large power expression.
| # | Rule | Cycle length |
|---|---|---|
| 21 | Powers of 0, 1, 5, 6: unit digit always same as base | 1 |
| 22 | Powers of 4: cycle is 4, 6, 4, 6; Powers of 9: cycle is 9, 1, 9, 1 | 2 |
| 23 | Powers of 2: 2, 4, 8, 6; Powers of 3: 3, 9, 7, 1; Powers of 7: 7, 9, 3, 1; Powers of 8: 8, 4, 2, 6 | 4 |
| 24 | For exponent n, use (n mod 4) to pick position in cycle (1 if n mod 4 = 0) | Pick index |
Three Number System Traps That Cost CAT Marks Every Year
Three traps recur in CAT Number System. The first is forgetting that the divisibility rule for 11 uses alternating subtraction, not sum, of digits. The second is mixing the same-remainder LCM identity with the same-remainder HCF identity, which are mirror images of each other. The third is using cycle index 4 instead of cycle index 0 when the exponent is a multiple of 4, which gives the wrong unit digit.
The fix for all three is pattern tagging. Before solving, write the trap signal next to the pillar tag: 11 means alternating, same-remainder smallest needs LCM, same-remainder largest needs HCF of differences, mod 4 equals 0 means use last position in cycle. These pre-solve tags catch the mistake before it costs marks.
16 Must-Solve CAT Number System Questions
These 16 questions cover all four pillars. Each is tagged with the pillar and the rule it tests. Solve under timed conditions, target under 90 seconds per question, and consult the cheatsheet only after attempting.
Is 5,432,109 divisible by 3?
Sum of digits = 5+4+3+2+1+0+9 = 24. 24 is divisible by 3. Answer: Yes
Is 918,082 divisible by 11?
Alternating sum: 9 - 1 + 8 - 0 + 8 - 2 = 22. 22 is divisible by 11. Answer: Yes
Is 144 divisible by 12?
12 = 4 × 3. 144/4 = 36 (yes), 1+4+4 = 9 divisible by 3 (yes). Answer: Yes
Find remainder when 210 is divided by 7.
23 = 8 ≡ 1 (mod 7). So 210 = 29 × 2 = (23)3 × 2 ≡ 1 × 2 = 2 (mod 7). Answer: 2
Find remainder when 99 is divided by 100.
99 = 100 − 1, so 99 ≡ −1 (mod 100). Remainder = 99. Answer: 99
Find remainder when 230 is divided by 31.
31 is prime, gcd(2, 31) = 1. By Fermat, 230 ≡ 1 (mod 31). Answer: 1
Find remainder when 3100 is divided by 5.
31=3, 32=4, 33=2, 34=1 (mod 5). Cycle 4. 100 mod 4 = 0, take last = 1. Answer: 1
LCM of two numbers is 120 and HCF is 4. If one number is 24, find the other.
Product = LCM × HCF = 480. Other = 480/24 = 20. Answer: 20
Find LCM of 12, 18, 24.
12 = 22×3, 18 = 2×32, 24 = 23×3. LCM = 23×32 = 72. Answer: 72
Find the smallest number which when divided by 6, 9, 12 leaves remainder 3.
LCM(6, 9, 12) = 36. Smallest = 36 + 3 = 39. Answer: 39
Find the largest number dividing 76, 109, 142 leaving the same remainder.
Differences: 109-76 = 33, 142-109 = 33, 142-76 = 66. HCF(33, 33, 66) = 33. Answer: 33
Find unit digit of 72026.
Cycle 7: 7, 9, 3, 1. 2026 mod 4 = 2. Position 2 = 9. Answer: 9
Find unit digit of 499.
Cycle 4: 4, 6. Odd exponent gives 4. 99 is odd, so unit digit = 4. Answer: 4
Find unit digit of 340.
Cycle 3: 3, 9, 7, 1. 40 mod 4 = 0, take LAST position = 1. Answer: 1
Find the number of trailing zeros in 100 factorial.
Trailing zeros = floor(100/5) + floor(100/25) + floor(100/125) = 20 + 4 + 0 = 24. Answer: 24
Find the largest 3-digit number divisible by both 4 and 11.
LCM(4, 11) = 44. Largest 3-digit multiple: floor(999/44) = 22, so 22 × 44 = 968. Answer: 968
Make Number System a Strength, Not a Trap, on CAT 2026
Number System is one of 22 Quants topics that need to fit a CAT 2026 plan. A diagnostic-driven sequence puts the high-ROI sub-topics (remainders, cyclicity) where they earn the most marks per study hour.
Diagnose My Number System GapsWhere Number System Tricks Fit in the CAT 2026 Quants Plan
Number System rewards a focused two-week block early in any CAT 2026 plan. Week one covers Pillars 1 and 2 (divisibility + remainders). Week two covers Pillars 3 and 4 (LCM HCF + cyclicity) plus 16 mixed-pillar questions. By the end of week two, recognition is automatic and the topic becomes a marks-bank rather than a tripwire on the actual paper. For a 9-month CAT 2026 plan, this two-week block belongs in months one and two alongside other concept-depth Quants topics. For sequencing the rest of the QA syllabus around Number System, our CAT exam guide walks through topic priorities, and the CAT 2026 waitlist details page explains how the personalised planner builds your topic sequence.
Three Reflexes That Make Number System Questions Solvable in Under 90 Seconds
Once 24 rules are memorised, three reflexes separate aspirants who solve Number System questions in 60 seconds from those who take three minutes. Reflex one: pillar tag first. Write D, R, L, or C on the rough sheet before any arithmetic. Reflex two: cycle position check. For any unit digit question, write the cycle and the mod 4 result before plugging in. Reflex three: same-remainder direction. For LCM HCF questions with same-remainder wording, check whether the question asks for smallest (LCM + r) or largest (HCF of differences) before solving. These three install through timed drill. The CAT practice questions library on Optima Learn tags Number System questions by pillar so each reflex can be drilled separately, and the CAT preparation blogs library has companion cheatsheets on PnC, TSD, and Logarithms.
Common Doubts About Number System Preparation for CAT 2026
How many Number System questions appear in CAT 2026?
Expect 2 to 4 questions per QA section, often distributed across the four pillars. The topic is one of the more TITA-heavy areas of CAT, which means recognition matters more than option-elimination. The 24 rules in this cheatsheet cover roughly ninety percent of the Number System content CAT setters use.
Do I need to memorise Wilson's theorem?
Wilson's theorem appears rarely in CAT, perhaps once every three or four papers, usually as a factorial-prime remainder question. Memorising it costs almost nothing (one line) and pays off when the question does appear. Worth the marginal effort, especially because the question is usually a quick mark once the theorem is recognised.
Is the negative remainder shortcut worth using?
Yes. The negative remainder trick (rewriting a number as a multiple minus a small positive) compresses many remainder questions to a single line. It is particularly useful when the dividend is close to a multiple of the divisor. CAT setters love this pattern because it punishes mechanical computation and rewards recognition.
How do I revise Number System one week before CAT 2026?
A one-week revision plan: day one, re-read the 24 rules and tag each with its pillar. Day two and three, drill divisibility plus remainders with five questions each. Day four, drill LCM HCF plus cyclicity. Day five, attempt 16 mixed questions under timed conditions. Day six, review every error. Day seven, scan the cheatsheet for 20 minutes only before the exam.
Final note. Number System formulas and tricks for CAT 2026 reduce to 24 rules across four pillars. The topic rewards pattern recognition over arithmetic muscle, which is why the pillar tag drill works. Drill block-by-block, build the three reflexes, and the CAT score predictor alongside mocks will track the improvement.
