Cyclicity
Cyclicity is the study of how the unit digit (and more generally the remainder) of a number repeats in a fixed cycle as you raise it to higher and higher powers. Multiply 7 by itself again and again and the last digit marches through 7, 9, 3, 1, 7, 9, 3, 1… forever — a clean cycle of length 4. CAT loves this because a question like "find the unit digit of 7^203" looks intimidating but collapses to a 10-second mental step once you know the cycle. The whole topic rests on one observation: only the unit digit of the base controls the unit digit of any power, and that unit digit repeats with a period of 1, 2, or 4. So you never compute the huge number — you find where the exponent lands inside the cycle using its remainder when divided by the cycle length (usually mod 4). The same cyclic behaviour shows up in remainder problems, last-two-digit problems, and pattern questions on the GMAT, XAT and SNAP too. This chapter builds the two skills CAT actually tests: reading the unit digit straight off the power, and using power-mod-4 to locate the right term of the cycle quickly and without error.
Topics
⚡ CAT shortcuts & speed methods
The fastest ways to crack this chapter under time pressure — the techniques that separate a 95+ percentiler from the rest.
- Strip the base to its unit digit first — 23^45 behaves exactly like 3^45.
- Group the digits: {0,1,5,6} period 1, {4,9} period 2, {2,3,7,8} period 4. Memorise this split.
- For period-4 digits, reduce the exponent mod 4; only the last two digits of the exponent affect mod 4 (100 is a multiple of 4).
- Remainder 0 (exponent divisible by 4) means take the LAST term of the cycle, not the first.
- For 4 and 9: odd power keeps the digit (4, 9); even power flips it (6, 1). Skip the full cycle.
- For a product or sum, work with each part’s unit digit separately, then combine and take the last digit again.
⚠️ Common mistakes & traps
CAT is designed so that careless errors here cost you marks. Internalise each trap before the exam.
- Treating remainder 0 (n divisible by 4) as the 1st term instead of the 4th/last term of the cycle.
- Reducing the exponent mod 10 or mod the base instead of mod the cycle length (4 for 2,3,7,8).
- Forgetting that 4 and 9 have period 2, and wrongly using a 4-cycle for them.
- Using the whole base for mod-4 reduction — it is the EXPONENT that gets reduced, not the base.
- Assuming every base cycles with period 4; 0,1,5,6 never change and 4,9 flip every other power.
📈 CAT exam insight & PYQ analysis
🎴 Flashcards — instant recall
Tap a card to reveal the answer. Drill these until they are automatic.
📌 Quick revision
Chapter test
🏆 Vidaara CAT success checklist
You have truly mastered Cyclicity when you can tick every box below.
- Recall every formula in this chapter without looking them up
- Solve each topic’s practice set with at least 80% accuracy
- Use the chapter shortcuts to cut your solving time in half
- Spot and avoid every common trap listed above
- Score 80%+ on the timed chapter test
📋 Chapter mastery scorecard
Track where you stand. Aim for the target before moving to the next chapter.
| Skill checkpoint | Target |
|---|---|
| Concept theory & formulas understood | 100% |
| Topic practice sets attempted (2 topics) | 2/2 |
| Best topic-test score | — → 80%+ |
| Chapter test score | — → 80%+ |
| Flashcards drilled to instant recall | 12 cards |
Formula Reference Sheet
Unit-digit cycle lengths
| Period 1 (digit never changes) | 0, 1, 5, 6 → unit digit stays the same for every power |
|---|---|
| Period 2 | 4 → 4, 6, 4, 6… and 9 → 9, 1, 9, 1… |
| Period 4 | 2, 3, 7, 8 each cycle through 4 distinct unit digits |
| Cycle of 2 | 2¹=2, 2²=4, 2³=8, 2⁴=6, then repeat (2,4,8,6) |
| Cycle of 3 | 3¹=3, 3²=9, 3³=7, 3⁴=1, then repeat (3,9,7,1) |
Picking the unit digit by power mod 4
| Reduce the exponent | For period-4 digits, use n mod 4 to choose the term |
|---|---|
| Remainder 1, 2, 3 | unit digit = 1st, 2nd, 3rd term of the cycle |
| Remainder 0 (n divisible by 4) | unit digit = 4th (last) term of the cycle |
| Last digit of a product/sum | depends only on the last digits of the parts |
| Remainder cyclicity | a^n mod m also repeats with a fixed period (the order of a) |