Divisibility Rules and Remainder Theorems for UPSC CSAT

Introduction to Number System Dynamics in the Civil Services Aptitude Test

The Civil Services Aptitude Test (CSAT), which constitutes Paper-II of the Union Public Service Commission (UPSC) Civil Services Preliminary Examination, assesses a candidate's analytical logic, critical reasoning, and computational proficiency. Over the examination cycles spanning from 2020 to 2025, an undeniable paradigm shift has occurred within the quantitative aptitude section of this paper. The Number System, once a domain of elementary arithmetic and basic numeracy, has evolved into a rigorous evaluation of advanced number theory, modular arithmetic, and heuristic problem-solving methodologies. The reliance on mere rote memorization or traditional long-form calculation is entirely obsolete in the modern testing environment. Current examination questions demand an intrinsic understanding of mathematical proofs, cyclical patterns, algorithmic calculation methods, and structural theorem applications.

This exhaustive report provides a systematic deconstruction of Divisibility Rules and the Remainder Theorem, tailored explicitly for the contemporary CSAT standard. It traverses fundamental arithmetic algorithms, advanced Vedic mathematical paradigms (such as the Osculator Method), and robust higher-order modular theorems including Fermat’s Little Theorem, Euler’s Totient Theorem, Wilson’s Theorem, and the Chinese Remainder Theorem. Furthermore, the analysis classifies and resolves highly complex Previous Year Questions (PYQs), demonstrating the application of these mathematical theorems as critical time-saving mental optimization techniques necessary for success.

---

The Architecture of Base-10 Divisibility Rules

A systematic mastery of divisibility rules serves as the fundamental layer of quantitative aptitude. Divisibility rules function as heuristic devices to determine whether a given integer is evenly divisible by a specific divisor without executing the full, time-consuming long-division algorithm. The base-10 (decimal) numeral system yields natural divisibility checks based on digital roots, terminal digits, and algebraic polynomial expansions.

To understand why these rules work, one must consider any base-10 number as a polynomial expansion. A number N with digits d_k d_k-1 ... d₁ d₀ can be expressed algebraically as:

N = d_k × 10^k + d_k-1 × 10^k-1 + ... + d₁ × 10¹ + d₀ × 10⁰

By applying modular arithmetic to this polynomial expansion, the standard divisibility shortcuts are mathematically derived.

Terminal Digit Rules for Powers of 2 and 5

The rules for powers of 2 (such as 2, 4, 8, 16) and powers of 5 (such as 5, 25, 125) are dictated entirely by the exponent of the base divisor. Because 10 is perfectly divisible by 2 and 5, any power 10^k is perfectly divisible by 2^k and 5^k. Therefore, when evaluating a large number for divisibility by 2^k or 5^k, all terms in the polynomial expansion from 10^k upwards evaluate to a remainder of zero, leaving only the final k digits to determine divisibility.

Digital Root Operations for Divisors 3 and 9

The divisibility rules for 3 and 9 operate on the concept of the digital sum or digital root. The algebraic justification relies on the modulo operations where 10 ≡ 1 (mod 3) and 10 ≡ 1 (mod 9). Consequently, any power of 10, such as 10², 10³, ..., 10^k, will also be congruent to 1 modulo 3 or 9. When this is applied to the base-10 polynomial expansion of a number, the powers of 10 collapse into 1, leaving only the sum of the coefficients, which are the digits themselves.

Thus, an integer is divisible by 3 or 9 if and only if the sum of its constituent digits is a multiple of 3 or 9, respectively. For instance, a classic CSAT formulation asks candidates to evaluate a missing digit A in a large number given its divisibility. If the number 21A35B4 is divisible by 9, the sum 2 + 1 + A + 3 + 5 + B + 4 = 15 + A + B must be a multiple of 9. To find the maximum possible value for A + B, the sum 15 + A + B must equal the highest multiple of 9 achievable by adding two single digits (maximum 9 + 9 = 18). The next multiples of 9 after 15 are 18 and 27. Setting 15 + A + B = 27 yields A + B = 12, providing the necessary algorithmic solution.

Alternating Digital Sum for Divisor 11

The base-10 polynomial evaluated under modulo 11 relies on the mathematical fact that 10 ≡ -1 (mod 11). Consequently, the powers of 10 alternate in their modulo 11 equivalence: 10¹ ≡ -1, 10² ≡ 1, 10³ ≡ -1, and so forth. The divisibility rule thus mandates calculating the alternating sum of the digits, defined as the sum of the digits situated in odd positions minus the sum of the digits situated in even positions. If this alternating difference equates to 0 or any positive or negative multiple of 11, the original integer is perfectly divisible by 11.

As an operational example, consider the number 95117. The digits in odd positions (from the right) are 7, 1, and 9, summing to 17. The digits in even positions are 1 and 5, summing to 6. The alternating difference is 17 - 6 = 11. Because 11 is divisible by 11, the parent number 95117 is mathematically proven to be divisible by 11 without executing division.

Composite Divisors and the Co-Primality Theorem

UPSC examinations frequently elevate the complexity of divisibility questions by utilizing large composite numbers as divisors, such as 72, 88, or 99. The foundational theorem governing these scenarios states that if an integer N is divisible by two co-prime integers a and b (where their greatest common divisor gcd(a, b) = 1), then N is invariably divisible by their product a × b.

It is a critical error to factorize composite divisors into non-coprime elements. For example, testing divisibility for 20 by testing for 10 and 2 is an invalid heuristic because 10 and 2 share a common factor of 2, leading to false positives. The correct co-prime factorization for 20 is 4 and 5.

• The resolution requires a dual-pronged algorithmic approach. First, the divisibility rule for 8 dictates that the terminal three digits, A68, must be perfectly divisible by 8. Evaluating the possibilities, the values for A that render A68 divisible by 8 are 1, 3, 5, 7, and 9. Second, the divisibility rule for 11 is applied to the parent number 49A68. The sum of odd-placed digits is 8 + A + 4 = 12 + A. The sum of even-placed digits is 6 + 9 = 15. The difference is (12 + A) - 15 = A - 3. For the number to be divisible by 11, the expression A - 3 must equal 0 or a multiple of 11. The only single-digit integer satisfying this is A = 3. Therefore, 3 is the only integer that satisfies both the modulo 8 and modulo 11 conditions concurrently.

The Unified Triplet Rule for Divisors 7, 11, and 13

One of the most powerful heuristics designed to expedite CSAT numerical processing is the unified Triplet Rule, a specialized calculation method for the prime divisors 7, 11, and 13. The mathematical underpinning of this rule lies in the aggregate product of these three primes: 7 × 11 × 13 = 1001. In modular arithmetic, 1000 ≡ -1 (mod 1001). Therefore, just as single digits alternate signs under modulo 11, block sequences of three digits alternate their signs when evaluated under modulo 1001, effectively linking the divisibility rules of 7, 11, and 13.

The algorithmic mechanism requires the candidate to partition the large number into blocks of three digits, starting from the unit digit and moving leftward. Once partitioned, the candidate computes the alternating sum of these three-digit blocks. If the resultant alternating sum evaluates to a number divisible by 7, 11, or 13, the original parent number is mathematically guaranteed to be divisible by 7, 11, or 13, respectively.

Consider the application of this method to the number 2,911,272. The sequence is partitioned into blocks: 272, 911, and 2. The alternating sum is computed as 272 - 911 + 2 = -637. The negative sign is irrelevant for divisibility testing. The candidate then tests 637. Because 637 is 7 × 91, the parent number is divisible by 7. Because 637 is 13 × 49, the parent number is divisible by 13. However, 637 is not a multiple of 11, so the original number is not divisible by 11. This technique drastically condenses the cognitive load compared to traditional division.

This structural property routinely appears in theoretical CSAT questions. For example: "For any choices of values of X, Y and Z, the 6-digit number of the form XYZXYZ is divisible by which numbers?". Deploying the Triplet Rule, the number XYZXYZ is partitioned into two identical three-digit blocks: XYZ and XYZ. The alternating difference is trivially XYZ - XYZ = 0. Because the integer 0 is universally divisible by any non-zero integer, the structural form is intrinsically divisible by 7, 11, and 13 simultaneously.

---

Advanced Divisibility via Vedic Mathematics: The Osculator Method

While base-10 heuristic rules adequately cover elementary digits, verifying divisibility by two-digit prime numbers such as 17, 19, 23, 29, and 31 presents a distinct computational challenge in examination scenarios. The Vedic Mathematics sub-sutra Veshtanam (translated as "By Osculation") provides a systematic, algorithmic remedy for these difficult primes. The Osculation Method functionally converts complex multi-digit division into an iterative process of single-digit multiplication combined with addition or subtraction, drastically reducing execution time.

Derivation of Positive and Negative Osculators

An "osculator" (denoted algebraically as E) is a single-digit multiplier derived specifically from the target divisor. The derivation relies on manipulating the divisor to reach a multiple that terminates in either 9 or 1, allowing the application of specific Vedic sutras.

• Positive Osculators: These are generated for divisors that naturally end in 9 or can be multiplied to end in 9. The Vedic sutra Ekadhikena Purvena ("by one more than the previous") is applied. If a divisor is 19, adding 1 yields 20. Dropping the terminal zero gives the positive osculator E = 2. For the prime 29, adding 1 yields 30, producing an osculator of E = 3. For the prime 13, it does not end in 9, so it is first multiplied by 3 to reach 39. Applying the sutra (39 + 1 = 40) produces a positive osculator E = 4.
• Negative Osculators: These are generated for divisors that terminate in 1 or can be multiplied to terminate in 1. For a divisor like 31, subtracting 1 yields 30. Dropping the zero gives the negative osculator E = 3. For the prime 17, it is multiplied by 3 to reach 51. Subtracting 1 yields 50, resulting in a negative osculator E = 5.

The Iterative Osculation Algorithm

The execution algorithm proceeds linearly from right to left across the target number. The user isolates the unit digit, multiplies it by the derived osculator, and then adds that product to (if using a positive osculator) or subtracts that product from (if using a negative osculator) the remaining truncated portion of the number. This iteration is repeated until a sufficiently small, recognizable multiple of the divisor remains.

To demonstrate the application, consider a complex evaluation: Is the number 4658 divisible by 17?. Using Table 3, the prime 17 can be approached using a negative osculator E = 5 (derived from 17 × 3 = 51).

1. Iteration 1: Isolate the unit digit 8. Multiply by the negative osculator: 8 × 5 = 40. Subtract this from the truncated remainder: 465 - 40 = 425.
2. Iteration 2: Operate on the new number 425. Isolate the unit digit 5. Multiply by the negative osculator: 5 × 5 = 25. Subtract from the truncated remainder: 42 - 25 = 17.

Since the terminal result is 17, which is obviously divisible by the divisor 17, the parent number 4658 is perfectly divisible by 17. This algorithm neutralizes the threat of large prime divisors in examination contexts.

---

Algebraic Divisibility and Polynomial Expansions

Beyond arithmetic digits, UPSC CSAT testing matrices increasingly integrate abstract algebra with number theory, requiring candidates to evaluate the divisibility of generalized polynomial expressions formatted as aⁿ - bⁿ or aⁿ + bⁿ. Understanding the structural proofs behind these expressions allows for instantaneous resolution of seemingly impossible numeric problems.

The fundamental algebraic theorem for differences of powers dictates that the expression aⁿ - bⁿ is universally divisible by the linear factor (a - b) for any natural number n. This is mathematically guaranteed because the polynomial expands predictably as:

aⁿ - bⁿ = (a - b)(a^n-1 + a^n-2b + ... + b^n-1)

However, if the exponent n is an even integer, the expression gains an additional characteristic: it becomes simultaneously divisible by (a + b). This secondary property is proven via substitution; by replacing b with -b, the expression aⁿ - (-b)ⁿ simplifies back to aⁿ - bⁿ (since the even exponent neutralizes the negative sign), implying that a - (-b) = a + b is an intrinsic root of the polynomial.

Conversely, the additive polynomial aⁿ + bⁿ behaves differently depending on the parity of the exponent. If n is an odd integer, the expression is always divisible by (a + b), as the expansion factors elegantly into:

aⁿ + bⁿ = (a + b)(a^n-1 - a^n-2b + ... + b^n-1)

However, if the exponent n is even, the expression aⁿ + bⁿ possesses no general linear polynomial factor over the integers, meaning no absolute divisibility rule applies without further contextual data.

These algebraic properties are regularly transformed into distinct remainder puzzles. A seminal CSAT 2025 question required exactly this logic: "If n is a natural number, then what is the number of distinct remainders of (1ⁿ + 2ⁿ) when divided by 4?".

The resolution requires evaluating the two polynomial terms independently.

• The first term, 1ⁿ, perpetually evaluates to 1 for any natural number n, thereby always contributing a remainder of 1 modulo 4.
• The second term, 2ⁿ, exhibits a threshold behavior when evaluated under modulo 4. For the initial base case n = 1, the evaluation is 2¹ = 2. The aggregate sum becomes 1 + 2 = 3, which leaves a remainder of 3 when divided by 4.

However, for all subsequent natural numbers where n ≥ 2 (e.g., n = 2, 3, 4), the term 2ⁿ generates the sequence 4, 8, 16. Every number in this sequence contains 2² as a prime factor, rendering them all exact multiples of 4. Thus, for all n ≥ 2, the term 2ⁿ ≡ 0 (mod 4).

The aggregate sum for all n ≥ 2 evaluates to 1 + 0 = 1, leaving a consistent remainder of 1 modulo 4. The rigorous conclusion establishes that the expression generates only two iterative remainders across the entire infinite set of natural numbers: 3 and 1. Consequently, the number of distinct remainders is exactly two.

---

The Framework of the Remainder Theorem and Modular Arithmetic

The core philosophy of the Remainder Theorem in modular arithmetic rests on a highly efficient principle: the remainder of an aggregate sum or product is strictly equal to the sum or product of their respective individual remainders. Let the notation R_n(a) denote the remainder operation when the integer a is divided by the divisor n. The mathematical architecture is governed by two fundamental laws:

• The Multiplicative Law: R_n(a × b × c) = R_n(R_n(a) × R_n(b) × R_n(c))
• The Additive Law: R_n(a + b + c) = R_n(R_n(a) + R_n(b) + R_n(c))

These structural laws act as massive time-saving calculation methods, allowing immense numerical sequences to be evaluated without ever computing their actual aggregate product or sum. For example, a CSAT 2023 PYQ asked: "What is the remainder when 85 × 87 × 89 × 91 × 95 × 96 is divided by 100?".

Instead of attempting complex modular reduction at each step, a candidate employing structural prime factorization achieves an instantaneous result.

• The target divisor is 100, which prime factorizes into 25 × 4, or 5² × 2².
• Evaluating the constituent factors of the numerator sequence reveals that:
  • 85 = 17 × 5 (yielding the first 5)
  • 95 = 19 × 5 (yielding the second 5)
  • 96 = 32 × 3 = 2⁵ × 3 (yielding five 2s)

The aggregate product explicitly contains the sequence 5 × 5 × 2 × 2 = 100 as a fully embedded sub-factor. Any integer sequence containing the divisor as a prime-factorized subset is universally a multiple of that divisor. Consequently, the remainder is trivially and indisputably 0.

The Theory of Negative Remainders

The concept of negative remainders serves as a sophisticated, albeit abstract, computational bridge designed to minimize intermediate product sizes and avoid tedious mental arithmetic. While classical Euclidean mathematics dictates that a valid remainder r must satisfy the inequality 0 ≤ r < |d| (where d is the divisor), transient negative calculations drastically reduce the cognitive load required to solve complex problems.

The mechanism operates on equivalence classes. If an integer N is congruent to a positive remainder r modulo d (i.e., N ≡ r (mod d)), it is concurrently true mathematically that N ≡ (r - d) (mod d). For instance, evaluating 42 (mod 5) gives a standard positive remainder of 2. The corresponding negative remainder is found by subtracting the divisor: 2 - 5 = -3. Both 2 and -3 belong to the exact same equivalence class modulo 5, meaning they are mathematically interchangeable during intermediate steps.

To illustrate calculative efficiency, consider finding the remainder of 12 × 14 divided by 13. The standard method requires calculating the product 12 × 14 = 168, and then executing long division: 168 / 13 = 12 with a remainder of 12. The negative remainder method bypasses this entirely. The remainder of 12 divided by 13 is viewed as -1 (since it is one unit below the divisor). The remainder of 14 divided by 13 is +1. Multiplying these intermediate negative remainders yields (-1) × 1 = -1. To translate this abstract negative remainder back to a valid positive remainder for the final answer, the divisor is added: -1 + 13 = 12.

The Cancellation Remainder Theorem

Another critical "trick" in the modular arithmetic arsenal is the Cancellation Remainder Theorem. This theorem dictates that if the numerator (dividend) and the denominator (divisor) share a common factor k, the candidate can divide both elements by k, evaluate the new reduced remainder of the simplified expression, and then multiply the final fractional result by the initially cancelled factor k to preserve structural equivalence and find the true remainder.

This is perfectly illustrated by a notoriously difficult CSAT 2023 question: "What is the remainder if 2¹⁹² is divided by 6?".

The expression is written as a fraction: 2¹⁹² / 6.

• Because 2¹⁹² can be expanded to 2 × 2¹⁹¹, and the denominator 6 can be expanded to 2 × 3, they share a common factor of 2.
• The candidate applies the Cancellation Theorem by dividing both the numerator and denominator by the common factor k = 2.
• The newly reduced expression to evaluate is 2¹⁹¹ / 3.

Evaluating this is simple using negative remainders: 2 ≡ -1 (mod 3). Therefore, the expression becomes (-1)¹⁹¹. Since the exponent 191 is an odd integer, the result is -1.

Translating the negative remainder -1 back to a positive remainder modulo 3 yields -1 + 3 = 2. This 2 is the remainder for the reduced expression. To discover the true remainder of the original expression, the candidate must multiply this result by the initially cancelled factor k = 2.

The final remainder is 2 × 2 = 4.

Additive Factorial Sequence Remainders

UPSC frequently tests remainders utilizing massive factorial sequences, a concept that looks intimidating but collapses under basic modular principles. A recurring format is evaluating the remainder of (1! + 2! + 3! + ... + 1000!) (mod d).

Consider the specific problem from standard CSAT practice sets: Find the remainder when (1! + 2! + 3! + ... + 1000!) is divided by 15. The core logic is that once a factorial term embeds the prime factors of the divisor, that term and all subsequent factorial terms become exact multiples of the divisor, contributing zero to the overall remainder calculation. The divisor is 15, which factorizes to 3 × 5. Analyzing the factorial sequence, the term 5! expands to 5 × 4 × 3 × 2 × 1 = 120. Because 5! contains both the multiplier 5 and the multiplier 3, it is perfectly divisible by 15. Consequently, every factorial larger than 5 (such as 6!, 7!, all the way to 1000!) contains 5! as a subset and is therefore also perfectly divisible by 15. The infinite-looking problem reduces entirely to evaluating just the initial terms that do not contain the factor 5: (1! + 2! + 3! + 4!) (mod 15). Calculating these gives 1 + 2 + 6 + 24 = 33. Finally, evaluating 33 (mod 15) yields a remainder of 3.

The Successive Division Algorithm

Successive division represents an algorithmic process distinct from standard division. In successive division, an initial integer is divided by a first divisor, leaving a remainder. The quotient obtained from this first division then becomes the sole dividend for the subsequent division by a second divisor, and so forth.

The formula for reconstructing the original number from a chain of successive divisions is derived by working backward from the final quotient. If a number is successively divided by divisors d₁, d₂, d₃ leaving respective remainders r₁, r₂, r₃, and assuming a final terminal quotient of k (which can be assumed to be 1 or 0 for minimization), the algebraic reconstruction follows a bottom-up multiplication and addition sequence.



A standard CSAT formulation based on this algorithm is: "When a number X is divided successively by 7 and 8, the remainders obtained are 2 and 3 respectively. What is the remainder when X is divided by 56?". To reconstruct the algebraic form of X, the algorithm starts from the final division. Assuming the ultimate final quotient is an arbitrary integer k: The first step (representing the division by 8 yielding remainder 3) generates the intermediate quotient Q₁ = 8k + 3. The second step (representing the initial division by 7 yielding remainder 2) generates the original number X = 7 × Q₁ + 2. Substituting Q₁ yields X = 7(8k + 3) + 2. Expanding the polynomial gives X = 56k + 21 + 2 = 56k + 23. When this reconstructed expression X = 56k + 23 is evaluated against the aggregate divisor 56, the 56k term is perfectly divisible, guaranteeing a final static remainder of 23 regardless of the value of k.

---

Higher-Order Number Theory Theorems for Exponent Dynamics

Modern CSAT examinations increasingly deploy questions featuring astronomical exponents that are entirely immune to standard manual calculation. Solving these requires the immediate deployment of advanced Number Theory theorems.

Fermat's Little Theorem

Fermat's Little Theorem is the foundational mechanism for determining remainders when the divisor is a strict prime number. The theorem explicitly states that if p is a prime number and a is any integer that is not divisible by p (meaning a and p are coprime, gcd(a, p) = 1), then raising a to the power of p-1 and dividing by p will always yield a remainder of 1.

Algebraically, this is expressed as: a^p-1 ≡ 1 (mod p).
An equivalent expression that elegantly avoids the strict co-prime restriction is: a^p ≡ a (mod p).

The primary application of Fermat's Little Theorem is exponent reduction. If tasked with finding the remainder when 2⁷² is divided by 73, a candidate recognizes immediately that 73 is a prime number and the base 2 is coprime to 73. Fermat's Little Theorem applies directly without modification: 2^73-1 ≡ 1 (mod 73). The remainder is unequivocally and instantaneously 1.

Euler's Totient Theorem

While Fermat's Little Theorem is constrained to prime divisors, Euler's Theorem acts as a generalized expansion capable of handling composite divisors. The theorem relies entirely on Euler's Totient Function, algebraically denoted as phi(n). This function calculates the exact count of positive integers up to the value n that are relatively prime to n (meaning they share no common factors other than 1).

Euler's Theorem establishes that if a and n are coprime integers (gcd(a, n) = 1), then:
a^phi(n) ≡ 1 (mod n)

To utilize this theorem, candidates must quickly calculate the Totient phi(n). For any arbitrary composite number n with a prime factorization represented as n = p₁^k₁ × p₂^k₂ × ..., the totient function is calculated via the formula:
n × (1 - 1/p₁) × (1 - 1/p₂) ...



A hallmark application of Euler's Theorem appeared in a CSAT PYQ evaluating the terminal digit cyclicity and division: "If 3²⁰¹⁹ is divided by 10, then what is the remainder?".
1. Verification of Co-primality: The base 3 and the divisor 10 share no common factors, fulfilling the prerequisite gcd(3, 10) = 1. Euler's Theorem applies.
2. Calculation of phi(10): Using the prime factorization of 10 (2 × 5), the totient is phi(10) = 10 × (1 - 1/2) × (1 - 1/5) = 10 × (1/2) × (4/5) = 4.
3. Application of the Theorem: By Euler's mandate, 3^phi(10) ≡ 1 (mod 10), which directly translates to 3⁴ ≡ 1 (mod 10).
4. Decomposition of the Target Exponent: The massive exponent 2019 is divided by the totient cycle of 4 to extract the non-cyclical remainder. 2019 / 4 gives a quotient of 504 and a remainder of 3. Algebraically, 2019 = 4 × 504 + 3.
5. Final Resolution: The expression is rewritten using exponent rules: 3²⁰¹⁹ = (3⁴)⁵⁰⁴ × 3³. Substituting the theorem's result gives (1)⁵⁰⁴ × 27 (mod 10). The evaluation simplifies to 1 × 27 (mod 10). The final remainder is 27 (mod 10) = 7.

Wilson's Theorem

While Euler and Fermat govern exponents, Wilson's Theorem is the exclusive domain of factorial remainder mathematics. It evaluates the specific remainder generated when factorials are divided by prime numbers. The theorem dictates that a positive integer p > 1 is a mathematically verified prime number if and only if the following congruence holds true:
(p - 1)! ≡ -1 (mod p)

Because -1 is in the same equivalence class as p - 1, this theorem is frequently expressed as (p - 1)! ≡ (p - 1) (mod p) to yield a positive remainder. For instance, a direct question asks: "What is the remainder when 16! is divided by 17?". Because the divisor 17 is prime, Wilson's theorem applies directly without calculation. The expression 16! is (17 - 1)!, which must yield a remainder of -1, or equivalently 16.

More complex applications require algebraic manipulation of the factorial sequence backwards. Consider the problem: "Find the remainder when 97! is divided by 101.".
1. By Wilson's theorem, since 101 is prime, the base formula is 100! ≡ -1 (mod 101).
2. The 100! term is expanded algebraically to isolate the target 97!: 100 × 99 × 98 × 97! ≡ -1 (mod 101).
3. The large coefficients are reduced using negative remainders: 100 ≡ -1 (mod 101), 99 ≡ -2 (mod 101), and 98 ≡ -3 (mod 101).
4. Substituting these negative representations yields: (-1)(-2)(-3) × 97! ≡ -1 (mod 101).
5. Multiplying the negatives gives: -6 × 97! ≡ -1 (mod 101), which simplifies to 6 × 97! ≡ 1 (mod 101).
6. To solve for the isolated 97!, the candidate must find the modular inverse of 6 modulo 101 (a number that, when multiplied by 6, yields a remainder of 1). The modular inverse is 17, because 6 × 17 = 102, and 102 ≡ 1 (mod 101).
7. Multiplying both sides of the congruence by 17 gives 17 × 6 × 97! ≡ 17 × 1 (mod 101). The 17 × 6 collapses to 1, leaving 1 × 97! ≡ 17 (mod 101). The remainder is definitively 17.

The Chinese Remainder Theorem (CRT)

The Chinese Remainder Theorem is an ancient algorithm used to resolve systems of simultaneous congruences. In the context of CSAT, it dictates that if an aspirant wishes to evaluate the remainder of a massive sequence modulo a composite number N (where N = m₁ × m₂ ..., and the factors m_i are pairwise coprime), the aspirant can independently evaluate the remainders modulo the constituent factors m₁, m₂, ... and reconstruct the aggregate remainder using those sub-results.

The power of CRT was perfectly exhibited in a notoriously lengthy CSAT 2022 PYQ: "What is the remainder when the sequence 91 × 92 × 93 × 94 × 95 × 96 × 97 × 98 × 99 is divided by the large composite 1261?".
Rather than confronting the monumental, time-consuming division step, CRT principles mandate the immediate prime factorization of the large divisor.
1. Divisor Factorization: The divisor 1261 factorizes exactly into 13 × 97. Since 13 and 97 are distinct prime numbers, they are trivially co-prime, fulfilling the primary requirement for the Chinese Remainder Theorem.
2. Evaluating Sub-Moduli Independent of One Another: The numerator sequence explicitly contains the integers 91 and 97 within its continuous product.

• Evaluating modulo 13: Since the integer 91 is present in the numerator, and 91 = 13 × 7, the entire massive numerator sequence is intrinsically and perfectly divisible by 13, leaving a remainder of 0.
• Evaluating modulo 97: Since the prime integer 97 is explicitly present in the numerator sequence, the entire numerator is intrinsically and perfectly divisible by 97, leaving a remainder of 0.

3. CRT Synthesis and Conclusion: Because the giant product leaves a remainder of 0 when evaluated under modulo 13, and a concurrent remainder of 0 when evaluated under modulo 97, the Chinese Remainder Theorem assures mathematically that it leaves a remainder of 0 when divided by their aggregate product, 13 × 97 = 1261. The final answer is instantaneously recognized as 0.

Cyclicity and Unit Digit Dynamics

A specific subset of remainder theorem questions in the CSAT evaluates a candidate's grasp of "cyclicity" or unit digit patterns. Determining the unit digit of an immense exponential expression N^k is mathematically identical to finding the remainder of N^k (mod 10). The base-10 number system imposes strict, predictable cyclical patterns on the terminal digits of all exponents.

These power cycles determine how frequently a unit digit repeats itself as the exponent increases. They are categorized into three distinct cyclicity groups:

• Cyclicity of 1 (Static Digits): Numbers terminating in 0, 1, 5, or 6 will perpetually retain that same terminal digit regardless of how large the exponent becomes. For example, 5⁹⁹⁹ will always terminate in 5, and 6²⁰²⁵ will always terminate in 6.
• Cyclicity of 2 (Oscillating Digits): Numbers terminating in 4 or 9 oscillate between two states.