Study guide

2.2 Unit Digits, Cyclicity Rules & Power Modulo Calculations

RRB Section Controller 2026: Free Written CBT Study Guide Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Overview & Operational Profile

1.1 Written CBT Pattern, Scoring & Selection 1.2 Eligibility, Documents & A-2 Medical Requirements

2 Chapter 2: Number Systems & Arithmetic Foundations

2.1 Number Systems, Divisibility Rules, Prime Factorization & Remainder Theorem 2.2 Unit Digits, Cyclicity Rules & Power Modulo Calculations 2.3 HCF and LCM Properties, Prime Factorization & Practical Word Problems 2.4 Fractions, Decimals, Surds, Indices & BODMAS Simplification

3 Chapter 3: Commercial Arithmetic: Percentages, Profit & Rates

3.1 Percentages, Fractional Equivalents, Successive Variations & Population Formulas 3.2 Cost Price, Selling Price, Profit/Loss Percentage, Dishonest Dealer & Discount Schemes 3.3 Simple Interest, Compound Interest Formulas, Annual/Semi-Annual Compounding & Difference Traps

4 Chapter 4: Ratios, Proportions, Mixtures & Partnerships

4.1 Ratios, Duplicate/Sub-Duplicate Ratios, Direct and Inverse Variations & Proportional Sharing 4.2 Averages, Change in Average, Batsman/Bowling Averages & Replacement Problems 4.3 Rule of Alligation, Removal-Replacement Mixtures & Partnership Capital-Time Sharing

5 Chapter 5: Motion Dynamics, Time, Distance & Train Logistics

5.1 Time, Speed, Distance Relations, Average Speed & Unit Conversions 5.2 Train Problems: Passing Poles, Platforms, Moving Objects & Relative Speed in Opposite/Same Directions 5.3 Upstream, Downstream Boat Velocity, Still Water Speed & Circular Track Races

6 Chapter 6: Work Efficiency, Pipes & Operational Scheduling

6.1 Individual and Group Work, Efficiency Ratios, Work Equivalences & Mandays Formula 6.2 Alternate Day Working, Negative Work & Wage Distribution Based on Work Done 6.3 Inlet and Outlet Pipes, Net Filling Rate, Alternating Flow & Tank Leakage Problems

7 Chapter 7: Algebra, Linear Equations & Progressions

7.1 Algebraic Identities, Polynomial Factorization & Systems of Linear Equations in Two Variables 7.2 Quadratic Equations, Nature of Roots, Discriminant Analysis & Maximum/Minimum Values 7.3 Arithmetic Progressions (AP), General Term, Sum of n Terms & Sequence Modeling

8 Chapter 8: Mensuration: 2D Areas & 3D Solids

8.1 Lines, Angles, Triangle Theorems, Congruence/Similarity & Circle Tangent Properties 8.2 Perimeter and Area of Quadrilaterals, Polygons, Circles & Shaded Region Problems 8.3 Surface Area and Volume of Cubes, Cuboids, Cylinders, Cones, Spheres & Melting-Recasting Solids

9 Chapter 9: Statistics, Probability & Data Interpretation

9.1 Mean, Median, Mode, Range, Mean Deviation & Standard Deviation 9.2 Permutations, Combinations, Classical Probability, Independent Events & Odds 9.3 Tabular Data Interpretation, Bar Charts, Grouped Graphs & Percentage Calculation Shortcuts 9.4 Pie Charts (Angle vs Percentage), Line Trend Graphs & Quantitative Data Sufficiency

10 Chapter 10: Multi-Source & Graphical Analysis

10.1 Multi-Source Analysis, Set Data & Arrangement 10.2 Scatter Plots, Histograms & Distribution Curves

11 Chapter 11: Deductive Logic, Statements & Binary Puzzles

11.1 Syllogisms, Sets & Possibility Conclusions 11.2 Critical Reasoning: Implicit Assumptions, Strong vs Weak Arguments & Course of Action 11.3 Binary Logic: Truth-Tellers, Liars, Alternators & Matrix Logic Deductions

12 Chapter 12: Relational, Directional, Clock & Calendar Reasoning

12.1 Direct Family Relations, Coded Blood Relations & Family Tree Tree-Mapping Methods 12.2 Cardinal & Ordinal Directions, Multi-Step Turn Paths, Pythagorean Distance & Shadow Timing 12.3 Clock Hands Angular Speed, Angle Between Hands at Given Time, Coincidence & Faulty Clocks 12.4 Odd Days Concept, Reference Date Calculations, Leap Year Rules & Repeating Calendar Years

13 Chapter 13: English Reading Comprehension

13.1 English Comprehension: Main Idea, Support & Inference 13.2 English Comprehension: Application, Structure & Style

14 Chapter 14: Mental Reasoning: Analogies & Series

14.1 Semantic, Letter & Number Analogies 14.2 Number Series: Differences, Powers & Missing Terms 14.3 Interleaved, Recursive & Wrong-Term Series

15 Chapter 15: Mental Reasoning: Coding & Ranking

15.1 Letter Shifts, Reversal & Numerical Codes 15.2 Message Intersections & Conditional Coding Tables 15.3 Ranking, People Between & Position Interchanges

16 Chapter 16: Mental Reasoning: Seating Arrangements

16.1 Linear Seating & Parallel Rows 16.2 Circular Seating, Facing & Rotational Symmetry

2.2 Unit Digits, Cyclicity Rules & Power Modulo Calculations

Key Takeaways Explain This Topic AI

Unit digits of positive integer powers are strictly periodic modulo 10; digits partition into three cyclicity families: period 1 ({0, 1, 5, 6}), period 2 ({4, 9}), and period 4 ({2, 3, 7, 8}).

For a positive integer exponent n, reduce n modulo 4 for the units digit; a zero remainder selects the fourth cycle entry. Exponent zero must be handled separately.

When calculating the difference between two power expressions, if the subtracted unit digit exceeds the minuend, borrow 10 from the tens place (e.g., 2 − 7 → 12 − 7 = 5 2 - 7 \to 12 - 7 = 5 2 − 7 → 12 − 7 = 5 ).

For any integer n ≥ 5 n \ge 5 n ≥ 5 , n ! n! n ! contains prime factors 2 and 5, which ensures n ! n! n ! terminates in at least one zero and n ! ≡ 0 ( m o d 10 ) n! \equiv 0 \pmod{10} n ! ≡ 0 ( mod 10 ) .

The tens digit of numbers ending in 1 is given by ( a × [ n m o d 10 ] ) m o d 10 (a \times [n \bmod 10]) \bmod 10 ( a × [ n mod 10 ]) mod 10 ; numbers ending in other digits reduce to this base using binomial expansion or cyclicity transformations.

Last updated: October 2026

The Mathematical Principle of Cyclicity

The unit digit of any product A × B A \times B A × B depends solely on the unit digits of A A A and B B B : ( A × B ) m o d 10 = ( ( A m o d 10 ) × ( B m o d 10 ) ) m o d 10 (A \times B) \bmod 10 = ((A \bmod 10) \times (B \bmod 10)) \bmod 10 ( A × B ) mod 10 = (( A mod 10 ) × ( B mod 10 )) mod 10

When an integer with base unit digit u u u is repeatedly raised to successive integer powers ( u 1 , u 2 , u 3 , u 4 , … u^1, u^2, u^3, u^4, \dots u 1 , u 2 , u 3 , u 4 , … ), the resulting unit digits repeat in a fixed periodic pattern called cyclicity . +-----------------------------------------------------------------------------+

  • | CYCLICITY CLASSIFICATION |
  • +-----------------------------------------------------------------------------+
  • | FAMILY 1: Cyclicity Period = 1 |
  • | Base Digits: {0, 1, 5, 6} |
  • | Behavior: Unit digit remains identical for any positive integer power. |
  • | Examples: 5^1=5, 5^2=25, 5^89 -> 5; 6^1=6, 6^2=36, 6^142 -> 6. |
  • +-----------------------------------------------------------------------------+
  • | FAMILY 2: Cyclicity Period = 2 |
  • | Base Digits: {4, 9} |
  • | Behavior: Unit digit alternates strictly based on odd/even parity. |
  • | Examples: 4^odd -> 4, 4^even -> 6; 9^odd -> 9, 9^even -> 1. |
  • +-----------------------------------------------------------------------------+
  • | FAMILY 3: Cyclicity Period = 4 |
  • | Base Digits: {2, 3, 7, 8} |
  • | Behavior: Unit digit cycles through four distinct values. |
  • | Universal period for all base digits divides into 4 (LCM of 1, 2, 4 = 4). |
  • +-----------------------------------------------------------------------------+
  • Comprehensive Cyclicity Reference Table
  • Base Digit ( u u u ) u 1 u^1 u 1 u 2 u^2 u 2 u 3 u^3 u 3 u 4 u^4 u 4 Period ( C C C ) Pattern Summary
  • 0 0 0 0 0 1 Always 0
  • 1 1 1 1 1 1 Always 1
  • 2 2 4 8 6 4 2 → 4 → 8 → 6 2 \to 4 \to 8 \to 6 2 → 4 → 8 → 6
  • 3 3 9 7 1 4 3 → 9 → 7 → 1 3 \to 9 \to 7 \to 1 3 → 9 → 7 → 1
  • 4 4 6 4 6 2 4 odd = 4 , 4 even = 6 4^{\text{odd}} = 4, 4^{\text{even}} = 6 4 odd = 4 , 4 even = 6
  • 5 5 5 5 5 1 Always 5
  • 6 6 6 6 6 1 Always 6
  • 7 7 9 3 1 4 7 → 9 → 3 → 1 7 \to 9 \to 3 \to 1 7 → 9 → 3 → 1
  • 8 8 4 2 6 4 8 → 4 → 2 → 6 8 \to 4 \to 2 \to 6 8 → 4 → 2 → 6
  • 9 9 1 9 1 2 9 odd = 9 , 9 even = 1 9^{\text{odd}} = 9, 9^{\text{even}} = 1 9 odd = 9 , 9 even = 1

Note

Because the least common multiple of all cyclicity periods LCM ( 1 , 2 , 4 ) = 4 \text{LCM}(1, 2, 4) = 4 LCM ( 1 , 2 , 4 ) = 4 , period 4 is universal across all digits from 0 to 9. For a positive integer exponent, a units-digit problem modulo 10 can use the four-position cycle. Other moduli need their own periods; exponent zero is a separate case.

The Universal Unit Digit Algorithm

To find the unit digit of any expression X N X^N X N :

Isolate the Base Unit Digit: Identify u = X m o d 10 u = X \bmod 10 u = X mod 10 .

Examine Only the Last Two Digits of the Exponent: A number is divisible by 4 if and only if its last two digits are divisible by 4. Let n n n be the number formed by the last two digits of N N N .

Compute Exponent Remainder Modulo 4: r = n m o d 4 r = n \bmod 4 r = n mod 4

Evaluate the Power:

If r > 0 r > 0 r > 0 , the unit digit is the unit digit of u r u^r u r .

If r = 0 r = 0 r = 0 , the unit digit is the unit digit of u 4 u^4 u 4 .

Warning

The Remainder Zero Trap: When n m o d 4 = 0 n \bmod 4 = 0 n mod 4 = 0 , do not evaluate u 0 = 1 u^0 = 1 u 0 = 1 ! A remainder of 0 indicates that the exponent has completed a full 4-cycle. You must evaluate the fourth power u 4 u^4 u 4 . For example, the unit digit of 2 40 2^{40} 2 40 is 2 4 = 16 ⟹ 6 2^4 = 16 \implies 6 2 4 = 16 ⟹ 6 , NOT 2 0 = 1 2^0 = 1 2 0 = 1 .

Multi-Term Expressions, Differences & Borrowing

In complex arithmetic questions featuring multiple terms combined through addition and subtraction:

Calculate the unit digit of each term independently.

Perform the indicated operations modulo 10.

Handling Negative Results (Borrowing): If the subtracted digit exceeds the leading digit, borrow 10 from the tens place before subtracting. Unit Digit = ( u 1 − u 2 ) + 10 when u 1 < u 2 \text{Unit Digit} = (u_1 - u_2) + 10 \quad \text{when } u_1 < u_2 Unit Digit = ( u 1 ​ − u 2 ​ ) + 10 when u 1 ​ < u 2 ​

For example, if an expression reduces to unit digits 3 − 8 3 - 8 3 − 8 , the final unit digit is not − 5 -5 − 5 , but ( 13 − 8 ) = 5 (13 - 8) = 5 ( 13 − 8 ) = 5 .

Factorials and Factorial Series Unit Digits

The factorial of a non-negative integer n n n , denoted n ! n! n ! , is the product of all positive integers less than or equal to n n n : n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 3 × 2 × 1 n! = n \times (n-1) \times (n-2) \times \dots \times 3 \times 2 \times 1 n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 3 × 2 × 1

  • Factorial Values and Their Unit Digits
  • 1 ! = 1 1! = 1 1 ! = 1
  • 2 ! = 2 2! = 2 2 ! = 2
  • 3 ! = 6 3! = 6 3 ! = 6
  • 4 ! = 24 ⟹ Unit digit is 4 4! = 24 \implies \text{Unit digit is } 4 4 ! = 24 ⟹ Unit digit is 4
  • 5 ! = 120 ⟹ Unit digit is 0 5! = 120 \implies \text{Unit digit is } 0 5 ! = 120 ⟹ Unit digit is 0
  • 6 ! = 720 ⟹ Unit digit is 0 6! = 720 \implies \text{Unit digit is } 0 6 ! = 720 ⟹ Unit digit is 0

Important

For any integer n ≥ 5 n \ge 5 n ≥ 5 , n ! n! n ! contains both 2 2 2 and 5 5 5 as factors ( 2 × 5 = 10 2 \times 5 = 10 2 × 5 = 10 ). Therefore, the unit digit of n ! n! n ! is identically 0 for all n ≥ 5 n \ge 5 n ≥ 5 .

Sum of Factorials: S = 1 ! + 2 ! + 3 ! + ⋯ + n ! S = 1! + 2! + 3! + \dots + n! S = 1 ! + 2 ! + 3 ! + ⋯ + n !

When evaluating the unit digit of S = 1 ! + 2 ! + 3 ! + ⋯ + 100 ! S = 1! + 2! + 3! + \dots + 100! S = 1 ! + 2 ! + 3 ! + ⋯ + 100 ! , all terms from 5 ! 5! 5 ! onward end in 0: S ≡ 1 ! + 2 ! + 3 ! + 4 ! + 0 + 0 + ⋯ + 0 ( m o d 10 ) S \equiv 1! + 2! + 3! + 4! + 0 + 0 + \dots + 0 \pmod{10} S ≡ 1 ! + 2 ! + 3 ! + 4 ! + 0 + 0 + ⋯ + 0 ( mod 10 ) S ≡ 1 + 2 + 6 + 24 = 33 ≡ 3 ( m o d 10 ) S \equiv 1 + 2 + 6 + 24 = 33 \equiv 3 \pmod{10} S ≡ 1 + 2 + 6 + 24 = 33 ≡ 3 ( mod 10 )

Thus, the unit digit of 1 ! + 2 ! + 3 ! + ⋯ + n ! 1! + 2! + 3! + \dots + n! 1 ! + 2 ! + 3 ! + ⋯ + n ! is always 3 for any n ≥ 4 n \ge 4 n ≥ 4 .

Factorial Exponents: x n ! x^{n!} x n !

When the exponent is a factorial n ! n! n ! where n ≥ 4 n \ge 4 n ≥ 4 :

Since 4 ! = 24 4! = 24 4 ! = 24 , n ! n! n ! is always a multiple of 4 for all n ≥ 4 n \ge 4 n ≥ 4 .

Therefore, n ! ≡ 0 ( m o d 4 ) n! \equiv 0 \pmod 4 n ! ≡ 0 ( mod 4 ) , meaning r = 0 r = 0 r = 0 .

Hence, the unit digit of x n ! x^{n!} x n ! is simply u 4 u^4 u 4 for all n ≥ 4 n \ge 4 n ≥ 4 :

If base u u u is even ( 2 , 4 , 6 , 8 2, 4, 6, 8 2 , 4 , 6 , 8 ), u 4 u^4 u 4 ends in 6 .

If base u u u is odd ( 1 , 3 , 7 , 9 1, 3, 7, 9 1 , 3 , 7 , 9 ), u 4 u^4 u 4 ends in 1 .

If base u = 5 u = 5 u = 5 , 5 n ! 5^{n!} 5 n ! ends in 5 .

If base u = 0 u = 0 u = 0 , 0 n ! 0^{n!} 0 n ! ends in 0 .

Tens Digit Determination

While unit digit problems test cyclicity modulo 10, higher-level CBT questions occasionally ask for the tens digit (or the last two digits, which is arithmetic modulo 100).

Numbers Ending in 1: ( … a 1 ) n (\dots a1)^n ( … a 1 ) n

By the Binomial Theorem: ( 10 a + 1 ) n = 1 + ( n 1 ) ( 10 a ) + ( n 2 ) ( 10 a ) 2 + ⋯ ≡ 1 + 10 ( a ⋅ n ) ( m o d 100 ) (10a + 1)^n = 1 + \binom{n}{1}(10a) + \binom{n}{2}(10a)^2 + \dots \equiv 1 + 10(a \cdot n) \pmod{100} ( 10 a + 1 ) n = 1 + ( 1 n ​ ) ( 10 a ) + ( 2 n ​ ) ( 10 a ) 2 + ⋯ ≡ 1 + 10 ( a ⋅ n ) ( mod 100 )

This yields a rapid formula for numbers ending in 1:

Unit digit: Always 1 1 1 .

Tens digit: ( a × [ n m o d 10 ] ) m o d 10 (a \times [n \bmod 10]) \bmod 10 ( a × [ n mod 10 ]) mod 10 .

Example: Find the last two digits of 41 87 41^{87} 4 1 87 :

Unit digit = 1 = 1 = 1 .

Tens digit = ( 4 × 7 ) m o d 10 = 28 m o d 10 = 8 = (4 \times 7) \bmod 10 = 28 \bmod 10 = 8 = ( 4 × 7 ) mod 10 = 28 mod 10 = 8 .

Last two digits = 81 = 81 = 81 .

Numbers Ending in 3, 7, 9

Transform the base into a number ending in 1 by exploiting powers:

  • 3 4 = 81 3^4 = 81 3 4 = 81 (ends in 1)
  • 7 4 = 2401 7^4 = 2401 7 4 = 2401 (ends in 01)
  • 9 2 = 81 9^2 = 81 9 2 = 81 (ends in 1)

Example: Find the last two digits of 7 84 7^{84} 7 84 :

Rewrite as ( 7 4 ) 21 = ( 2401 ) 21 ≡ ( 01 ) 21 ( m o d 100 ) = 01 (7^4)^{21} = (2401)^{21} \equiv (01)^{21} \pmod{100} = 01 ( 7 4 ) 21 = ( 2401 ) 21 ≡ ( 01 ) 21 ( mod 100 ) = 01 .

The last two digits are 01 01 01 (tens digit is 0).

Powers of 2 and Even Bases Modulo 100

Key building block: 2 10 = 1024 ≡ 24 ( m o d 100 ) 2^{10} = 1024 \equiv 24 \pmod{100} 2 10 = 1024 ≡ 24 ( mod 100 ) .

  • 24 even power ≡ 76 ( m o d 100 ) 24^{\text{even power}} \equiv 76 \pmod{100} 2 4 even power ≡ 76 ( mod 100 )
  • 24 odd power ≡ 24 ( m o d 100 ) 24^{\text{odd power}} \equiv 24 \pmod{100} 2 4 odd power ≡ 24 ( mod 100 )

Furthermore, 76 × 76 ≡ 76 ( m o d 100 ) 76 \times 76 \equiv 76 \pmod{100} 76 × 76 ≡ 76 ( mod 100 ) , and 76 × 2 k ≡ 2 k ( m o d 100 ) 76 \times 2^k \equiv 2^k \pmod{100} 76 × 2 k ≡ 2 k ( mod 100 ) (for k ≥ 2 k \ge 2 k ≥ 2 ).

  • Worked Examples
  • Worked Example 1: Multi-Term Compound Unit Digit

Problem: Find the unit digit of the expression: E = 378 126 × 643 185 − 287 143 + 514 226 E = 378^{126} \times 643^{185} - 287^{143} + 514^{226} E = 37 8 126 × 64 3 185 − 28 7 143 + 51 4 226

Step 1: Evaluate 378 126 378^{126} 37 8 126 : Base unit digit u = 8 u = 8 u = 8 . Exponent 126 126 126 : last two digits 26 26 26 .

Divide by 4: 26 = 4 × 6 + 2 ⟹ r = 2 26 = 4 \times 6 + 2 \implies r = 2 26 = 4 × 6 + 2 ⟹ r = 2 .

Unit digit = 8 2 = 64 ⟹ 4 = 8^2 = 64 \implies 4 = 8 2 = 64 ⟹ 4 .

Step 2: Evaluate 643 185 643^{185} 64 3 185 : Base unit digit u = 3 u = 3 u = 3 . Exponent 185 185 185 : last two digits 85 85 85 .

Divide by 4: 85 = 4 × 21 + 1 ⟹ r = 1 85 = 4 \times 21 + 1 \implies r = 1 85 = 4 × 21 + 1 ⟹ r = 1 .

Unit digit = 3 1 ⟹ 3 = 3^1 \implies 3 = 3 1 ⟹ 3 .

Step 3: Evaluate product of first two terms: ( 4 × 3 ) m o d 10 = 12 m o d 10 = 2 (4 \times 3) \bmod 10 = 12 \bmod 10 = 2 ( 4 × 3 ) mod 10 = 12 mod 10 = 2

Step 4: Evaluate 287 143 287^{143} 28 7 143 : Base unit digit u = 7 u = 7 u = 7 . Exponent 143 143 143 : last two digits 43 43 43 .

Divide by 4: 43 = 4 × 10 + 3 ⟹ r = 3 43 = 4 \times 10 + 3 \implies r = 3 43 = 4 × 10 + 3 ⟹ r = 3 .

Unit digit = 7 3 = 343 ⟹ 3 = 7^3 = 343 \implies 3 = 7 3 = 343 ⟹ 3 .

Step 5: Evaluate 514 226 514^{226} 51 4 226 : Base unit digit u = 4 u = 4 u = 4 . Cyclicity is 2.

Exponent 226 226 226 is even ⟹ 4 even \implies 4^{\text{even}} ⟹ 4 even ends in 6 6 6 .

Step 6: Combine terms with borrowing: Unit Digit = ( 2 − 3 + 6 ) m o d 10 \text{Unit Digit} = (2 - 3 + 6) \bmod 10 Unit Digit = ( 2 − 3 + 6 ) mod 10

Since 2 < 3 2 < 3 2 < 3 , perform ( 2 − 3 ) = − 1 ⟹ 10 − 1 = 9 (2 - 3) = -1 \implies 10 - 1 = 9 ( 2 − 3 ) = − 1 ⟹ 10 − 1 = 9 .

Then add 6 6 6 : 9 + 6 = 15 ⟹ 5 9 + 6 = 15 \implies 5 9 + 6 = 15 ⟹ 5 . (Equivalently: ( 2 + 6 ) − 3 = 8 − 3 = 5 (2 + 6) - 3 = 8 - 3 = 5 ( 2 + 6 ) − 3 = 8 − 3 = 5 .)

Conclusion: The unit digit of E E E is 5 .

Worked Example 2: Factorial Exponents Series

Problem: Find the unit digit of the summation: S = ( 1 ! ) 1 + ( 2 ! ) 2 + ( 3 ! ) 3 + ( 4 ! ) 4 + ( 5 ! ) 5 + ⋯ + ( 100 ! ) 100 S = (1!)^1 + (2!)^2 + (3!)^3 + (4!)^4 + (5!)^5 + \dots + (100!)^{100} S = ( 1 ! ) 1 + ( 2 ! ) 2 + ( 3 ! ) 3 + ( 4 ! ) 4 + ( 5 ! ) 5 + ⋯ + ( 100 ! ) 100

Step 1: Analyze terms for n ≥ 5 n \ge 5 n ≥ 5 : For every n ≥ 5 n \ge 5 n ≥ 5 , n ! n! n ! ends in 0. Therefore, ( n ! ) n (n!)^n ( n ! ) n ends in 0 n = 0 0^n = 0 0 n = 0 .

These terms contribute 0 to the unit digit.

Step 2: Evaluate the first 4 terms individually:

Term 1: ( 1 ! ) 1 = 1 1 = 1 (1!)^1 = 1^1 = 1 ( 1 ! ) 1 = 1 1 = 1 .

Term 2: ( 2 ! ) 2 = 2 2 = 4 (2!)^2 = 2^2 = 4 ( 2 ! ) 2 = 2 2 = 4 .

Term 3: ( 3 ! ) 3 = 6 3 = 216 ⟹ Unit digit is 6 (3!)^3 = 6^3 = 216 \implies \text{Unit digit is } 6 ( 3 ! ) 3 = 6 3 = 216 ⟹ Unit digit is 6 .

Term 4: ( 4 ! ) 4 = ( 24 ) 4 (4!)^4 = (24)^4 ( 4 ! ) 4 = ( 24 ) 4 . Base unit digit is 4, exponent 4 is even ⟹ 4 4 = 256 \implies 4^4 = 256 ⟹ 4 4 = 256 , unit digit is 6 6 6 .

Step 3: Sum the non-zero unit digits: Unit Digit = ( 1 + 4 + 6 + 6 ) m o d 10 = 17 m o d 10 = 7 \text{Unit Digit} = (1 + 4 + 6 + 6) \bmod 10 = 17 \bmod 10 = 7 Unit Digit = ( 1 + 4 + 6 + 6 ) mod 10 = 17 mod 10 = 7

Conclusion: The unit digit of the summation is 7 .

Worked Example 3: Tens Digit Calculation

Problem: Find the last two digits (tens and units) of 31 146 31^{146} 3 1 146 .

Step 1: Check form: The base ends in 1: 31 = 10 ( 3 ) + 1 31 = 10(3) + 1 31 = 10 ( 3 ) + 1 , so a = 3 a = 3 a = 3 .

The exponent is n = 146 n = 146 n = 146 .

Step 2: Apply the binomial unit and tens shortcut:

Unit digit is always 1 1 1 .

Tens digit is given by: ( a × [ n m o d 10 ] ) m o d 10 (a \times [n \bmod 10]) \bmod 10 ( a × [ n mod 10 ]) mod 10 .

Here a = 3 a = 3 a = 3 , and n m o d 10 = 6 n \bmod 10 = 6 n mod 10 = 6 .

Tens digit = ( 3 × 6 ) m o d 10 = 18 m o d 10 = 8 = (3 \times 6) \bmod 10 = 18 \bmod 10 = 8 = ( 3 × 6 ) mod 10 = 18 mod 10 = 8 .

Step 3: Verify via binomial expansion: ( 30 + 1 ) 146 = 1 + 146 ( 30 ) + ( 146 2 ) ( 30 ) 2 + … (30 + 1)^{146} = 1 + 146(30) + \binom{146}{2}(30)^2 + \dots ( 30 + 1 ) 146 = 1 + 146 ( 30 ) + ( 2 146 ​ ) ( 30 ) 2 + …

Modulo 100, all terms from ( 30 ) 2 (30)^2 ( 30 ) 2 onward have factors of 900 ≡ 0 ( m o d 100 ) 900 \equiv 0 \pmod{100} 900 ≡ 0 ( mod 100 ) . 1 + 146 × 30 = 1 + 4380 = 4381 ≡ 81 ( m o d 100 ) 1 + 146 \times 30 = 1 + 4380 = 4381 \equiv 81 \pmod{100} 1 + 146 × 30 = 1 + 4380 = 4381 ≡ 81 ( mod 100 )

Conclusion: The last two digits are 81 (tens digit is 8, unit digit is 1).