Skip to content
GRE Math overview

Worked example

Free to read

Counting Elements of a Given Order

A public group theory question that counts the elements of order 6 in a cyclic group by using the order formula n/gcd(k, n) rather than by listing elements.

Question

How many elements of the additive group Z36\mathbb{Z}_{36} have order exactly 66?

  1. a.11
  2. b.22
  3. c.66
  4. d.1212

Correct answer

B. 22

Full reasoning

  1. 1In Zn\mathbb{Z}_{n} the element kk has order n/gcd(k,n)n/\gcd(k,n), so here the order of kk is 36/gcd(k,36)36/\gcd(k,36).
  2. 2Setting 36/gcd(k,36)=636/\gcd(k,36) = 6 gives gcd(k,36)=6\gcd(k,36) = 6: the search is for the kk in {0,1,,35}\{0,1,\dots,35\} whose greatest common divisor with 3636 is exactly 66.
  3. 3Any such kk is a multiple of 66, so k{0,6,12,18,24,30}k \in \{0, 6, 12, 18, 24, 30\}. Their gcds with 3636 are 36,6,12,18,12,636, 6, 12, 18, 12, 6 respectively.
  4. 4Only k=6k = 6 and k=30k = 30 give gcd=6\gcd = 6, so exactly 22 elements have order 66.
  5. 5Cross-check with the general rule: a cyclic group of order nn has φ(d)\varphi(d) elements of order dd for each divisor dd of nn, and φ(6)=2\varphi(6) = 2, matching the direct count.

Why each choice is right or wrong

Choice A

This confuses elements with subgroups. Z36\mathbb{Z}_{36} has exactly one subgroup of order 66, but that subgroup contains several elements, and only its generators have order 66.

Choice B

Correct. An element kk has order 36/gcd(k,36)=636/\gcd(k,36) = 6 exactly when gcd(k,36)=6\gcd(k,36) = 6, which holds only for k=6k = 6 and k=30k = 30.

Choice C

This counts every element of the unique order-66 subgroup {0,6,12,18,24,30}\{0, 6, 12, 18, 24, 30\}. Four of those have smaller order — for example 1212 has order 33 and 1818 has order 22 — so they are not elements of order 66.

Choice D

This is φ(36)=12\varphi(36) = 12, the number of generators of the whole group, that is, the count of elements of order 3636. The totient must be evaluated at the target order 66, not at the group order.

Related formula

Order of an element of a cyclic group

kZn=ngcd(k,n)\left| k \right|_{\mathbb{Z}_n} = \frac{n}{\gcd(k, n)}

Assumptions: The group is cyclic of finite order n. The number of elements of order d is phi(d) for each divisor d of n, and zero otherwise.

Related topic and practice

This worked example is free to read. A free account unlocks practice questions for this exam.

Sources

Authored for this public explainer registry. It has no database question ID and is not copied from a protected or official exam bank.

  1. Abstract Algebra: Theory and Applications (Judson), Section 4.1: Cyclic SubgroupsLibreTexts Mathematics. Accessed 2026-08-15. Judson's Abstract Algebra on LibreTexts is released under the GNU Free Documentation License 1.3; attribute the author and platform and avoid verbatim reuse beyond short cited references.
  2. Abstract Algebra: Theory and Applications (Judson), Section 6.2: Lagrange's TheoremLibreTexts Mathematics. Accessed 2026-08-15. Judson's Abstract Algebra on LibreTexts is released under the GNU Free Documentation License 1.3; attribute the author and platform and avoid verbatim reuse beyond short cited references.
Share this worked solution

Sources and corrections

Sources last checked 2026-08-15

Every source cited on this page was checked on the date shown, and we update the page when a source changes. If something looks wrong, tell us and we'll recheck it.