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

What is the largest order of any element in $U_{900}$? I found that it is isomorphic to $\mathbb Z _{240}$. So I guess that it should be $240$. Am I correct?

share|cite|improve this question
$U_{900}$ does have 240 elements, but it's not isomorphic to $\mathbb Z _{240}$ – Josh B. Apr 10 '13 at 15:49
How can you be sure about this? Actually I have wrong idea, so I want to clear it . – Chipmunks Apr 10 '13 at 16:00
up vote 12 down vote accepted

You first factorise $900 = 3^2 \cdot 5^2 \cdot 2^2$. Then you determine the maximal order in $U_9$, in $U_{25}$ and in $U_4$ (you should already know the general structure of the groups for prime powers). Finally, the Chinese remainder theorem tells you that $U_{900}$ is the product of these three groups, so the maximal order in $U_{900}$ is the least common multiple of the maximal orders in the three components.

share|cite|improve this answer

Hint $\ $ The CRT decomposition is $\rm\ \Bbb Z/900 = \Bbb Z/4 \times \Bbb Z/9 \times \Bbb Z/25\ $ so $\rm\: U_{900} = U_{4}\times U_9\times U_{25},\ $ a product of cyclic groups of order $\rm\ \phi(4)=2,\ \phi(9)=6,\ \phi(25)=20,\:$ with lcm $= 60,\:$ not $240$. This implies $\rm\:a^{60} = 1\:$ for all $\rm\:a\in U_{900}.\:$ Indeed, if $\rm\:(a,b,c)\in C(i) \times C(j) \times C(k),\:$ a product of cyclic groups of order $\rm\:i,j,k,\:$ then

$$\rm \ell = lcm(i,j,k)\mid n\:\Rightarrow\: i,j,k\mid n\:\Rightarrow\:(a,b,c)^n = (a^n,b^n,c^n) = 1$$

So the largest order $\rm\:\color{#c00}{m \le \ell}.\:$ Conversely, taking $\rm\:a,b,c\:$ to be generators

$$\rm\ 1 = (a,b,c)^n = (a^n,b^n,c^n) \:\Rightarrow\: i,j,k\mid n\:\Rightarrow\ \ell = lcm(i,j,k)\mid n$$

Thus $\rm\: \ell\le m.\:$ Combining $\rm\: \color{#c00}{m \le \ell} \le m,\:$ hence $\rm\:m = \ell.$

Remark $\ $ Look up the Carmichael lambda function to learn more about the general case.

share|cite|improve this answer

That's the largest possible order, but that doesn't mean that there must exist an element with such an order. I ran a Python script and could not find any.

for i in range(900):
    if gcd(900, i) == 1:
        order = 1
        total = i
        while total != 1:
            total = (total * i) % 900
            order += 1
        if order == 240:

EDIT: Today I learned you need <pre> tags.

share|cite|improve this answer
There's a "code" button which will put four spaces before each line of code. This is interpreted in the same way. – Douglas S. Stones Apr 10 '13 at 16:35
Did you compute the largest order of any element? Otherwise, this would be a comment, not an answer to the question. – robjohn Apr 10 '13 at 17:17

Using Carmichael Function


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.