1
$\begingroup$

Let $G$ be a finite cyclic group of order $n$. If $d$ is a positive divisor of $n$, prove that the equation $x^d = e$ has exactly $d$ distinct solutions in $G$.

  • 1
    (There is no need to say in the title that the question is a question, nor that it is *abstract algebra*, for that's what the tags are for!)2012-04-09

1 Answers 1

1

$G$ is generated by some $g\in G$. Since $d\mid n$, we can find $k$ such that $dk=n$. Now let $y=g^k$. Check that $y^j,0\leq j\leq d-1$ are pairwise distinct, so there are at least $d$ solutions to $x^d=e$. If $x\neq g^{kj}$ for all integer $0\leq j\leq d-1$, $x=g^p$ for some $p$. We write $p=kq+r$, where $1\leq r\leq k-1$. Then $x^d=g^{pd}=g^ng^{rd}=g^{rd}\neq e$.

  • 0
    since$d$divides$n$you can pick such an $k$ so that $n$ EQUALS $kd$. take your generator $a$ and consider the subgroup generated by $a^k$. show $a^k$ has order $d$, which will give you $d$ solutions. then use the division algorithm to show there aren't any others.2012-04-09