Number system questions in UPSC CSAT Prelims fall into a very specific pattern: they test whether you understand the structure of integers rather than your ability to compute large numbers directly. The exam will never ask you to actually multiply 6^129 × 7^307 — that would be impossible by hand. What it tests is whether you can extract the relevant part — the unit digit — without doing the full computation.
Here is the core insight: in most number theory questions, you do not need the full number. You need a property — the last digit, the remainder on division, the number of factors. Each of these properties depends on a much smaller calculation than the number itself.
Think of numbers like addresses on a circular road. The unit digit of powers follows a cycle — 7 raised to successive powers gives last digits 7, 9, 3, 1, then back to 7. Once you know the cycle length (called cyclicity) and where the exponent falls in that cycle, you have your answer. The "road" has 4 stops for 7, and you only need to know which stop the exponent lands on.
This is the working analogy: a clock has 12 positions. Whether you go around once or 101 times, if you start at 3 and count forward, you always know where you land using modular arithmetic. Unit digit cyclicity is the same idea, applied to the last digit of powers.
The UPSC CSAT rewards candidates who can identify which sub-technique applies to a given question and execute it cleanly. The three most tested areas are:
If you walk into the exam hall having memorized the cyclicity of all single digits (0–9), knowing how to find trailing zeros of factorials and powers, and recognizing "5 × odd = unit digit 5," you can solve 80% of number system questions in under 45 seconds.
The unit digit of n^k depends only on the unit digit of n and the value of k mod (cycle length). Here is the complete table you must internalize:
| Unit digit of base | Cyclicity | Cycle pattern | |---|---|---| | 0 | 1 | 0 | | 1 | 1 | 1 | | 2 | 4 | 2, 4, 8, 6 | | 3 | 4 | 3, 9, 7, 1 | | 4 | 2 | 4, 6 | | 5 | 1 | 5 | | 6 | 1 | 6 | | 7 | 4 | 7, 9, 3, 1 | | 8 | 4 | 8, 4, 2, 6 | | 9 | 2 | 9, 1 |
How to use this table:
Step 1: Identify the unit digit of the base.
Step 2: Find its cyclicity from the table.
Step 3: Compute exponent mod cyclicity. If the remainder is 0, use the last position in the cycle (not the first).
Step 4: Pick the unit digit at that position in the cycle.
Worked example: What is the unit digit of 3^47?
47 mod 4 = 3Special case — remainder 0: Unit digit of 3^40? 40 mod 4 = 0, so use the 4th position: 1.
When you have a product like A^m × B^n, find the unit digits of each factor separately using the cyclicity table, then multiply those unit digits and take the unit digit of that result.
Example: Unit digit of 4^13 × 7^9?
4^13: cyclicity of 4 is 2. 13 mod 2 = 1. 1st position in (4, 6) = 4.7^9: cyclicity of 7 is 4. 9 mod 4 = 1. 1st position in (7, 9, 3, 1) = 7.4 × 7 = 28, unit digit = 8.Trailing zeros in an expression come from factors of 10, which in turn come from pairs of factors 2 and 5 in the prime factorization. For expressions like 30^30:
30^30 = (2 × 3 × 5)^30 = 2^30 × 3^30 × 5^30
The 10^30 part (from 2^30 × 5^30) contributes exactly 30 trailing zeros. What remains is 3^30. The "rightmost digit preceding the zeros" is simply the unit digit of 3^30.
3^30: 30 mod 4 = 2. 2nd position in (3, 9, 7, 1) = 9.This technique generalizes: whenever you see a question about "the digit before the trailing zeros," factor out all the 10s and find the unit digit of what remains.
Look — any product that includes both 5 and an odd number will have unit digit 5. 5 × any_odd = something ending in 5. And 5 × (5 × odd) = 5 × (odd ending in 5) — still ends in 5.
The product 1 × 3 × 5 × 7 × … × 999 includes the factor 5. Every other factor in this product is odd. So:
5 × 1 = 5, unit digit 55 × 3 = 15, unit digit 5The moment 5 enters any product with exclusively odd co-factors, the unit digit freezes at 5. This is a pattern recognition shortcut, not cyclicity.
These appear in elimination-type questions:
| Divisor | Rule | |---|---| | 2 | Last digit even | | 3 | Sum of digits divisible by 3 | | 4 | Last two digits divisible by 4 | | 5 | Last digit 0 or 5 | | 6 | Divisible by 2 and 3 | | 8 | Last three digits divisible by 8 | | 9 | Sum of digits divisible by 9 | | 11 | (Sum of odd-position digits) − (Sum of even-position digits) divisible by 11 |
HCF × LCM = Product of two numbers — this is only true for exactly two numbers. For three or more numbers, this formula does not hold. A common trap question exploits this.
For prime factorization:
Any base whose unit digit is 0, 1, 5, or 6 will always have that same unit digit regardless of the power. Zero stays zero, one stays one, five stays five, six stays six. When you see these bases, you can write down the unit digit without checking the exponent at all.
Micro-example: Unit digit of 6^129 = 6. Done in 2 seconds. Standard cyclicity approach would still take 15–20 seconds including the modulo step. Savings: ~15 seconds per such question.
For bases with unit digit 2, 3, 7, or 8 (all have cyclicity 4), use this: divide the exponent by 4 and note the remainder. If remainder is 1, 2, 3, or 0, pick the 1st, 2nd, 3rd, or 4th entry in the cycle respectively.
Micro-example: Unit digit of 7^307. 307 ÷ 4 = 76 remainder 3. Cycle for 7 is (7, 9, 3, 1). 3rd entry = 3. Time: 10 seconds flat. Standard method without the cycle table: students often redraw the full power sequence from scratch, taking 60–90 seconds and risking errors.
If a product contains the factor 5 and all other factors are odd (no factor of 2 present), the unit digit is locked at 5. You need not examine any other factor.
Micro-example: 1 × 3 × 5 × 7 × 9 × … × 999. Spot that 5 is present and every other term is odd. Answer = 5. Time: 5 seconds. Without this pattern, a student might try to compute partial products step by step — easily 2–3 minutes and prone to arithmetic error.
For expressions of the form N^k where N contains factors of both 2 and 5, strip out all pairs of (2, 5) as powers of 10 first. The trailing zeros equal the power of 10. The digit preceding those zeros equals the unit digit of the stripped remainder.
Micro-example: 30^30. Strip: 30 = 2 × 3 × 5, so 30^30 = 2^30 × 3^30 × 5^30 = 10^30 × 3^30. Thirty trailing zeros; digit before them = unit digit of 3^30 = 9. Standard approach (trying to find the actual number) is impossible without a computer. This method: 25 seconds versus impossible — not a speed gain, a correctness gain.
When asked for the unit digit of A^m × B^n, compute the unit digits of A^m and B^n separately, then multiply those two unit digits and take the unit digit of that result. You never compute the actual product.
Micro-example: 6^129 × 7^307. Unit digit of 6^129 = 6 (freeze rule). Unit digit of 7^307: 307 mod 4 = 3, cycle entry 3 = 3. So unit digit of product = unit digit of 6 × 3 = 18 = 8. Steps: 3 micro-steps vs. attempting actual multiplication (impossible). Step count: 3 vs. ∞.
When you see a number system question in the exam hall, follow this decision tree:
Step 1 — What is the question asking?
Step 2 — Apply the freeze check first. Is the base unit digit 0, 1, 5, or 6? If yes, write down the answer immediately and move on.
Step 3 — For other digits (2, 3, 4, 7, 8, 9): cyclicity of 4 (2, 3, 7, 8) or cyclicity of 2 (4, 9). Compute exponent mod cyclicity. If remainder = 0, use the last position in the cycle.
Step 4 — For products: multiply the individual unit digits, then take the unit digit of that result.
Step 5 — Sanity check with options. If two options share the same unit digit — which never happens in a well-set paper — re-examine your mod calculation. Otherwise, the first answer you get by this method is almost always correct. Don't second-guess.
Budget: 40–60 seconds per question using this framework.
Why this question: This tests the product-of-powers unit digit technique, requiring you to apply the freeze rule for 6 and cyclicity for 7, then multiply the results.
Solving path:
6^129: base unit digit is 6. Freeze rule applies — unit digit is 6, regardless of exponent.7^307: unit digit of base is 7, cyclicity is 4. 307 mod 4 = 3 (since 304 = 4 × 76, remainder 3). 3rd position in cycle (7, 9, 3, 1) = 3.6 × 3 = 18, unit digit = 8.Why this question: This tests pattern recognition — specifically the "5 × odd = unit digit 5" lock. Students who try to compute this step by step will waste 3–4 minutes and likely get it wrong.
Solving path:
1 × 3 × 5 × 7 × 9 × … × 999.5 × (any odd number) always ends in 5. Example: 5 × 1 = 5, 5 × 3 = 15, 15 × 7 = 105, and so on — unit digit remains 5 throughout.Why this question: This tests the trailing-zero-strip technique — a slightly less obvious application of cyclicity that requires you to first decompose the base into prime factors.
Solving path:
30^30 = (2 × 3 × 5)^30 = 2^30 × 3^30 × 5^30.2^30 × 5^30 = (2 × 5)^30 = 10^30, contributing exactly 30 trailing zeros.3^30. The digit just before the trailing zeros is the unit digit of 3^30.3^30: cyclicity of 3 is 4. 30 mod 4 = 2. 2nd position in cycle (3, 9, 7, 1) = 9.Using remainder 0 incorrectly: When exponent mod cyclicity = 0, students often pick the 1st position in the cycle instead of the last. For 3^40, 40 mod 4 = 0 — the answer is 1 (4th position in the cycle), not 3 (1st position). This is the single most common error in cyclicity problems.
Applying the two-number HCF-LCM formula to three numbers: HCF × LCM = product of two numbers is only valid for exactly two numbers. For three or more numbers, the formula breaks down. If you blindly apply it to a three-number problem, you will get a wrong answer that looks plausible.
Forgetting the freeze rule for 6 and then overcalculating: Students sometimes compute 6 mod 4 = 2, look up the 2nd position in an imaginary cycle for 6, and get the wrong answer. There is no cycle for 6 — it always ends in 6.
Confusing "digit preceding trailing zeros" with "second-to-last digit of the number": These are the same thing only when there is exactly one trailing zero. For 30^30 with 30 trailing zeros, the digit preceding the zeros is the unit digit of 3^30, not a digit deep in the interior of the number.
Treating 5 × even as a "unit digit 5" case: The lock only works when 5 multiplies an odd number. 5 × 2 = 10 (unit digit 0), 5 × 4 = 20 (unit digit 0). If any even factor enters a product alongside 5, the unit digit becomes 0, not 5. Always check that all co-factors are odd before applying the lock.
Not reducing the base to its unit digit before looking up the cycle: For 23^47, you only care that the unit digit is 3. Use the cycle for 3. Do not try to find a "cycle for 23" — the cyclicity table applies to single digits, derived from the unit digit of the base only.