Remainders Advanced: Chinese Remainder Theorem, Fermat's Little Theorem, Pattern Method

Here is the part nobody tells you. The hardest remainder questions in CAT are also the safest marks on the paper. Advanced remainder problems almost always arrive as TITA, the type-in-the-answer format with no negative marking. A wrong attempt costs nothing, and a correct one pays a full mark while the rest of the hall skips the question on sight. That gap is the whole point of this guide on remainder theorem CAT advanced techniques. The math looks scary, so most aspirants leave the marks on the table. You will not, because three reliable methods cover almost everything the exam throws at this topic.

The three are the Chinese Remainder Theorem for many-divisor questions, Fermat's Little Theorem for a large power divided by a prime, and the pattern method for any power. Get the recognition cue right and each one runs in under a minute. We will work several examples per method, and every step is verified, because one slip in modular arithmetic flips the answer.

Why hard remainders are safe marks

Run the expected-value math. A wrong type-in carries no penalty, so attempting a TITA remainder can only help your score or leave it unchanged. Compare that with a tough multiple-choice question, where a wrong tick subtracts a mark. The questions that look most forbidding often carry the friendliest risk profile, which is exactly backwards from how aspirants treat them.

The catch is reliability. A guess on a TITA remainder almost never lands, because the answer space is wide, so the edge comes from a method you trust under a clock. That is what separates the aspirants who clear the Quant cut-off from those who stall, and it is the same edge you build when you sharpen your Quant TITA strategy across the whole section. Each method below targets a specific question shape, so read all three once, then practise the recognition step. You can pull fresh remainder sets from the Optima Learn practice question bank after each section.

Method 1: Chinese Remainder Theorem by successive substitution

The Chinese Remainder Theorem CAT questions hand you several remainders against several divisors and ask for the original number. A typical prompt reads: a number leaves remainder 2 on division by 3, remainder 3 on division by 5, and remainder 2 on division by 7. Find the smallest such number. The formula version exists, but under exam pressure successive substitution is faster and far harder to fumble.

The idea is to satisfy one condition, then the next, stepping forward in multiples of the running LCM so you never break a condition you already met. Build the answer one divisor at a time.

Notice you never wrote a single equation. You filtered a list, then stepped forward by the running LCM, which is where this beats the formula approach on time.

Working with the running LCM is the same fluency you build when you nail HCF and LCM tricks, so the two topics reinforce each other. Always pin the answer down with a quick verification, since one mis-read remainder upstream sends the whole chain wrong.

Method 2: Fermat's Little Theorem for a power by a prime

Fermat little theorem CAT 2026 questions ask for the remainder of a large power divided by a prime. The theorem states that for a prime p and a base a that shares no common factor with p, a raised to the power (p minus 1) leaves remainder 1 on division by p. In short form, a^(p-1) is congruent to 1 mod p. Two conditions matter: the divisor must be prime, and the base must not be a multiple of it. Check both before you reach for it.

The payoff is that you collapse a giant exponent. You reduce the exponent modulo (p minus 1), because every full block of (p minus 1) powers contributes a factor of 1. What remains is a small power you can compute by hand.

One block of six powers vanishes into a 1, and only the leftover exponent 4 does any work. That collapse is the whole advantage over raw multiplication.

Reducing inside each step, rather than multiplying out 7 to the power 5 = 16807 first, keeps the numbers tiny and the arithmetic clean on every modular question.

Method 3: the pattern method for powers

The pattern method, also called cyclicity remainders CAT logic, works for any divisor, prime or composite. You list the remainders of successive powers until they repeat, read off the cycle length, then reduce the exponent modulo that length. It is the safe default because it never depends on a condition you might misapply.

The one care point is indexing. The cycle starts at the first power, so a remainder of 0 after reducing the exponent points to the last entry in the cycle, not a missing one. Map positions carefully and the method is foolproof.

The pattern method handles composite divisors that Fermat cannot, which earns it the default slot. The next example uses a divisor of 4, where the cycle is shorter still.

The pattern method also answers units-digit questions, since a units digit is a remainder by 10. For the units digit of 3 to the power 123, the last digits cycle 3, 9, 7, 1, and 123 mod 4 = 3 gives the third entry, 7. One tool, many disguises, worth drilling across the CAT preparation guides until it is automatic.

Which method, and when

The recognition cue is the whole game. Read the question stem and match it to a shape before you compute. The table below is the decision rule to rehearse until it is instinct.

When two methods both apply, pick the faster one. For a power by a prime, Fermat skips the listing because the cycle length divides (p minus 1). For a composite divisor, only the pattern method is safe, so default to it whenever you feel unsure about a Fermat condition.

This selection habit, reading the cue before computing, is the same discipline that powers harder topics like clocks and calendars, where the answer also hinges on a remainder by a fixed cycle.

Traps that flip the answer

Most lost marks on advanced remainders come from a small set of slips, not from the method itself. Each one turns a correct setup into a wrong type-in.

Drill each method on the cue that triggers it and recognition becomes reflex before the exam. Once you can tell a Chinese Remainder Theorem question from a Fermat one at a glance, this whole family of TITA questions shifts from a skip to a reliable two or three marks. To see how a stronger number theory game moves your percentile, run the numbers through the CAT score predictor after your next mock.

Common questions on advanced remainders