Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Consider a finite group G. For any integer $m \geq 1$ set $\gamma(m) = \gamma_G(m)$ to be the number of elements $g \in G$ such that ord($g$) = $m$. We say that $m$ is a "possible order" for G if $\gamma(m) \geq 1$, that is, if there is at least one element $g \in G$ such that ord(g) = m.

Consider the cyclic group $G = C_{36} = \{1, a, ..., a^{35} \}$. List all possible orders for G, and for each $m \geq 1$ of them calculate the value of $\gamma_G(m)$.

I understand that the oder of g is the smallest integer $m$ such that $g^m = 1_G$, but how do I find out this order number? Do I go through each element in $C_{36}$ and see if I can raise it to some power ($\geq 1$) to give me the identity element?

share|cite|improve this question
up vote 4 down vote accepted

Hint: Use Lagrange's Theorem.

If you haven't covered Lagrange's Theorem, consider the factors of $36$, the order of $G = C_{36}$.

  • Which integers divide $36$?
    This will give you the orders of all the subgroups of $C_{36}$ (all the $m$s about which you need to be concerned).

    Then consider which elements of each subgroup generate the subgroup; the order of any such generator will equal the order of the subgroup it generates (subgroups of cyclic groups are cyclic).

  • Find all the generators of $G = C_{36}$. Apply what do you know about elements that are coprime to $36$. Count them: this will be $\gamma(36)$.

Finally, after finding the orders $m_i$ of each element $g_i\in G = C_{36},\;$ count the number of elements with the same order $m$. This amounts to computing $\;\gamma(m)$ for each distinct $m$ .

share|cite|improve this answer
Why did you think about using subgroups? The integers that divide 36 are 1, 2, 3, 4, 9, 13, 18 and 36. A generating set is the set of all elements that aren't in any subgroup, so in this case, it will be the elements that don't divide 36. Now I have my m's, I can work out the order of each of these subgroups by doing euler function of them right, as subgroups of cyclic groups are cyclic. – Kaish Dec 12 '12 at 18:10
That will work just fine, Kaish! The order of an element of a finite group is defined as you defined it. The order of an element is also equivalent to the order of the subgroup it generates. – amWhy Dec 12 '12 at 18:13

I would try to discover the general principle rather than going through each element in turn.

Can you answer this question if you change 36 into smaller numbers, like 3,4,5,6? These cases are small enough for you to work out completely, and you should see a pattern emerging.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.