Recipe

Use the classification theorem on a finite cyclic group

Use when: you have a cyclic group of known order $n$ and need to match it to $\mathbb{Z}_n$ by exponent, or find its subgroups by divisor

Goal: either the explicit exponent correspondence to $\mathbb{Z}_n$ , or the complete, correctly-sized list of subgroups

Taught in Classifying finite cyclic groups

Quick recipe

Decide which task you're doing
Pick a generator, list its powers in order, and match each exponent to its element
List n's divisors, then generate each subgroup as n divided by that divisor

1
Read the question: it either asks for the correspondence between a cyclic group and $\mathbb{Z}_n$ , or it asks about $\mathbb{Z}_n$ 's own subgroups.

Example

"Show $U(5)$ runs on the same bookkeeping as $\mathbb{Z}_4$ " is a correspondence question, so Step 2. "List every subgroup of $\mathbb{Z}_9$ " is a subgroup question, so Step 3.
- matching a cyclic group's elements to $\mathbb{Z}_n$ by exponent — continue to Step 2.
- finding subgroups of $\mathbb{Z}_n$ , all of them or one of a given order — continue to Step 3.
Why: the two tasks use the theorem's two different halves, so identifying which one is being asked avoids computing a correspondence nobody wanted or hunting for subgroups that weren't the question.
2
Choose any generator $g$ of the cyclic group, compute $g^0, g^1, \ldots, g^{n-1}$ , and pair each exponent $k$ with the element $g^k$ .

Example

$U(5)=\{1,2,3,4\}$ is generated by $2$ : $2^0=1,\ 2^1=2,\ 2^2=4,\ 2^3=3$ . The correspondence is $0\leftrightarrow1,\ 1\leftrightarrow2,\ 2\leftrightarrow4,\ 3\leftrightarrow3$ .

Why: this correspondence turns every product in the cyclic group into the matching sum mod $n$ , which is exactly what "runs on the same bookkeeping as $\mathbb{Z}_n$ " means.
3
Find every divisor $d$ of $n$ ; each one gives exactly one subgroup, of order $d$ , generated by the element $n/d$ .

Example

$n=9$ : the divisors are $1,3,9$ , so $\mathbb{Z}_9$ has exactly three subgroups. The order- $3$ subgroup is generated by $9/3=3$ : $\langle3\rangle=\{0,3,6\}$ .
- every subgroup is needed — list all of $n$ 's divisors and generate one subgroup per divisor.
- only the subgroup of one specific order $d$ is needed — compute just that single generator $n/d$ , skipping the rest.
Why: every subgroup of $\mathbb{Z}_n$ is cyclic, and its order must divide $n$ by the order formula, so divisors of $n$ and subgroups of $\mathbb{Z}_n$ correspond one-to-one through $n/d$ .

Common mistakes

Treating "same structure" as "the same set" -- $U(10)$ and $\mathbb{Z}_4$ share only the bookkeeping pattern, never the actual elements.
Listing divisors of the subgroup's order instead of divisors of $n$ itself when hunting for all subgroups.
Using $d$ itself as the generator instead of $n/d$ when building the subgroup of order $d$ .
Miscounting $n$ 's divisors, which silently under- or over-counts how many subgroups $\mathbb{Z}_n$ actually has.