Number System Questions for CAT: 3 Shortcut Layers

Quant

A CAT quant section rarely gives you a number system question that announces itself. It shows up disguised as a TITA question about remainders, a divisibility check inside a bigger algebra problem, or a base conversion question that looks unfamiliar for four seconds before you realise it is arithmetic you already know.

Most aspirants lose marks here not because the concept is hard, but because they solve it the slow way under a clock that does not forgive slow. This guide builds the three shortcut layers that turn number system questions for CAT into fast points, not skipped ones.

Why Number System Questions Decide Your CAT Quant Score

Number system is not a niche chapter you can skip and hope to recover marks elsewhere. It threads through profit and loss, time and work, probability, and almost every TITA question asking for an integer instead of picking from four options. A shaky grip on it slows down chapters that look unrelated on the surface.

The good news is that the entire chapter compresses into three layers of shortcuts. Once you drill them in order, a number system question stops being a maths problem you solve and starts being a pattern you recognise on sight.

The 3 Layer Number System Shortcut Stack

Think of number system prep as three layers stacked on each other, each making the next one faster. Skip a layer and the ones above it wobble under exam pressure.

Layer 1: Divisibility Rules You Can Chain Instantly

Most aspirants know the individual divisibility rules from school. What actually saves time on the CAT is chaining two of them together to check a composite divisor in one pass, instead of running long division against the whole number, every time.

Chain 2, 4 and 8 Off the Last Digits Alone

• Divisible by 2 if the last digit is even.
• Divisible by 4 if the last two digits form a number divisible by 4.
• Divisible by 8 if the last three digits form a number divisible by 8.
• None of these three ever require you to look past the last three digits of the number.

Chain 3 and 9 Off the Digit Sum

• Divisible by 3 if the sum of all digits is divisible by 3.
• Divisible by 9 if the sum of all digits is divisible by 9.
• A number divisible by 9 is automatically divisible by 3, so check 9 first and you get both answers for free.
• This is the single fastest rule on the whole list and the one most CAT quant questions expect you to already have automatic.

The Rule for 11 Everyone Forgets Under Pressure

• Split the digits into odd and even positions, counting from the right.
• Add each group separately, then subtract the smaller total from the larger.
• If that difference is 0 or a multiple of 11, the number is divisible by 11.

Here is that chain in action. Is 457336 divisible by 88, which is 8 times 11? The last three digits, 336, divide evenly by 8, so that check clears. For the 11 check, alternating digit sums from the right both come to 14, a difference of 0, so it clears too. Both pass: 457336 divides evenly by 88, landing on exactly 5197.

Composite Divisor	Chain These Two Rules	Why It Works
12	3 and 4	3 times 4 equals 12, and the two factors share no common factor
24	3 and 8	3 times 8 equals 24, both coprime
36	4 and 9	4 times 9 equals 36, both coprime
72	8 and 9	8 times 9 equals 72, both coprime
88	8 and 11	8 times 11 equals 88, both coprime
99	9 and 11	9 times 11 equals 99, both coprime

Layer 2: Remainder Shortcuts and Units Digit Cyclicity

This is the layer that intimidates most aspirants, because the exponents look impossible to compute directly. The shortcut is that you never actually compute them at all. You find the pattern the digits repeat in, and read off the answer directly.

Cyclicity of Units Digits

Every digit's powers repeat their units digit in a short, fixed cycle. Once you know the cycle length, you only need the exponent's remainder when divided by it, not the exponent itself. This one fact does almost all the work in this layer.

• 2, 3, 7 and 8 each cycle every 4 powers.
• 4 and 9 each cycle every 2 powers.
• 0, 1, 5 and 6 never change, whatever the exponent.
• To use the cycle, divide the exponent by the cycle length and read off the remainder position, treating a remainder of 0 as the last position in the cycle.

Fermat's Shortcut for Prime Divisors

When the divisor is prime and shares no common factor with the base, there is a shortcut worth memorising cold. Raise the base to one less than the prime, and the remainder is always 1. That single fact is Fermat's little theorem.

That fact collapses huge exponent questions into simple modular arithmetic, because any exponent rewrites as a multiple of that cycle length plus a small leftover, and only the leftover matters. Once you spot a prime divisor, reach for this before anything else.

The same logic extends to sums and products. A sum's remainder equals the sum of the individual remainders, and a product's remainder equals their product, adjusted back into range if it overshoots the divisor. You never need the actual value, only each piece's remainder.

Try this the way CAT would phrase it. What is the remainder when 2 raised to 222 is divided by 7? Since 7 is prime and shares no factor with 2, Fermat's shortcut says 2 to the power 6 leaves remainder 1 when divided by 7. 222 is an exact multiple of 6, so the remainder is 1, no digit multiplication required.

Layer 3: Base Conversion Tricks That Actually Show Up

Base conversion appears far less often than divisibility or remainders, but when it shows up it is usually a TITA question, and most aspirants freeze because it looks unfamiliar. It is really just one repeatable method applied in each direction.

Decimal to Any Base, by Repeated Division

1. Divide the decimal number by the target base and note the remainder.
2. Divide the quotient by the base again, and note that remainder too.
3. Repeat until the quotient reaches 0.
4. Read the remainders from bottom to top. That sequence is your answer in the new base.

Convert 214 into base 6 this way. 214 divided by 6 gives quotient 35 remainder 4. 35 divided by 6 gives quotient 5 remainder 5. 5 divided by 6 gives quotient 0 remainder 5. Reading the remainders bottom to top gives 554 in base 6, confirmed by 5 times 36 plus 5 times 6 plus 4 equals 214.

Any Base to Decimal, Without a Formula Sheet

Multiply each digit by the base raised to its position, counting from 0 on the right, and add the results. Nothing else to memorise beyond place value working in a base other than 10, the same logic you already use without thinking about it.

Take 345 in base 7. That is 3 times 7 squared, plus 4 times 7, plus 5, which is 147 plus 28 plus 5, a total of 180 in decimal. Three multiplications and one addition, nothing more, and no formula sheet required to get there.

Worked Examples: Stacking All Three Layers

Recognising which layer a question is testing, under a two minute clock, is the actual skill CAT grades.

A divisibility chain question: a CAT style question gives a five digit number ending in a blank digit and asks how many values make the number divisible by 24. Since 24 is 3 times 8, fix the last three digits for the 8 check first, then test which survivors clear the digit sum rule for 3 too. Two filters, not ten digits tested one by one.

A remainder question under time pressure: the 2 to the power 222 divided by 7 question from Layer 2 looks unsolvable in two minutes if you try to compute the actual power. Recognising that 7 is prime and reaching for Fermat's shortcut turns it into one of the fastest marks on the section.

Once the chain and cycle steps stop needing conscious thought, the next move is repetition under real time pressure. Go practice Number System questions for CAT until spotting the right layer each time takes less time than reading the question itself.

Common Mistakes That Cost Marks in Number System Questions

Knowing the rules is not the same as applying them correctly under a clock. These slips show up most often when mentors review wrong answers on this chapter, and they are almost always fixable once you can name them clearly.

• Testing a composite divisor by long division instead of chaining two coprime factors, burning thirty extra seconds for no extra accuracy.
• Forgetting that a remainder of 0 in a cyclicity lookup means the last position in the cycle, not position zero.
• Applying Fermat's shortcut when the base and the prime divisor share a common factor, which breaks the rule entirely.
• Reading base conversion remainders top to bottom instead of bottom to top, which silently reverses the answer.

Previous year CAT papers show how these mistakes get engineered into a question on purpose. Working through CAT previous year number system questions shows the traps in their original phrasing, not a textbook version. If number system is quietly costing you marks elsewhere too, get your CAT preparation strategy reviewed.

Build a Number System Practice Routine That Sticks

The three layer stack only pays off once it becomes automatic, and that takes structured repetition, not one long session before a mock. Ten focused minutes a day compounds faster than most aspirants expect, especially once you can already feel which layer is slow.

A generic study plan treats number system like every other chapter and gives it a fixed slot regardless of where you struggle. A personalised CAT preparation plan adjusts that slot by your accuracy per rule, so you spend more time on the layer genuinely costing you marks.