Recipe
Compute a^n for any integer n
Use when: you need a specific integer power of a group element, and the exponent n could be positive, zero, or negative
Goal: the single element a^n, computed correctly regardless of the sign of n
Taught in Powers and integer exponents of an element
Quick recipe
-
1
Look at whether n is positive, zero, or negative. The definition genuinely changes at each case.
Example
For a=3 in U(8): n=2 falls in the first case, so 3^2 means combining 3 with itself twice.
- n>0 — combine a with itself n times (next step).
- n=0 — the answer is e, the identity, with no combining needed.
- n<0 — find a's inverse first, then combine that inverse with itself -n times.
Why: a^n means something structurally different in each case. Using the positive-n rule on a negative exponent gives a nonsensical combination.
-
2
Write out a \ast a \ast \cdots \ast a using n factors. Then simplify using the group's own operation.
Example
In U(8)=\{1,3,5,7\} under multiplication mod 8: compute 3^2 directly as 3\times3=9\equiv1 \pmod 8.
⚡ Shortcut
For a large exponent, first check whether a's order m is already known. If so, replace n with n \bmod m before combining. This works because a^m=e makes every full cycle vanish for free. In U(8), 3 has order 2 (3^2\equiv1). So 3^5 reduces to 3^{5 \bmod 2}=3^1=3, instead of multiplying 3 by itself five times.
Why: this is the base definition every other case and every exponent law is built from.
-
3
Find a^{-1}. Then combine that inverse with itself -n times. That's a positive number of times, since n is negative.
Example
Find 2^{-1} in (\mathbb{Z}_6, +). The additive inverse of 2 solves 2+x\equiv0\pmod6, giving x=4. Since -n=1 here, no further combining is needed. So 2^{-1}=4.
Why: this matches the definition exactly, a^n=(a^{-1})^{-n}. It only makes sense once the group's own inverse is used, not ordinary subtraction.
Common mistakes
- Applying the positive-exponent rule directly to a negative n instead of inverting first.
- Forgetting that a^0=e is the group's identity, not the number 0 or 1 from ordinary arithmetic.
- Multiplying out a large exponent by hand instead of reducing it modulo the element's known order first.
- Mixing up (a^{-1})^n with (a^n)^{-1}. Both are valid rewritings, but only after the exponent's sign has been handled correctly.