- #1
fishturtle1
- 394
- 82
Homework Statement
At beginning of problem section: Let ##\operatorname{ord}(a) = n##. (Not sure if that carries into this problem..)
Prove that if ##a^m## has order ##n## then ##\gcd(m,n) = 1##. (Hint: Assume ##m## and ##n## have a common factor ##q > 1##, hence we can write ##m = m'q## and ##n = n'q##. Explain why ##(a^m)^{n'} = e##, and proceed from there. )
Homework Equations
Order of ##a## is the least positive integer such that ##a^{\operatorname{ord}(a)} = e##.
From a different problem: ##\operatorname{ord}(a^m) \vert \operatorname{ord}(a)##.
Previous problem: if ##\gcd(m,n) = 1## then ##\operatorname{ord}(a^m) = \operatorname{ord}(a) = n##.
The Attempt at a Solution
Suppose ##\gcd(m,n) = q > 1##. Then there exists integers ##m', n'## such that ##m = m'q## and ##n = n'q##. By definition of order, ##(a^m)^n = (a^m)^{n'q} = (a^{mq})^{n'} = e##. Also ##\gcd(m', n') = 1##.
I'm not sure how to get to ##(a^m)^{n'} = e##..