English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

2 answers

If the number of members of a group is prime, you know for sure the group is cyclic. Otherwise, show that theres is a member g such that for each member h there is an integer n such that g^n=h.

2007-02-28 02:28:36 · answer #1 · answered by Amit Y 5 · 0 0

Amit is right - usually one finds an explicit generator of the group.

Sometimes, that's not possible. E.g. to prove that the multiplicative group of a fiinite field is cyclic, one pulls out this result:

Theorem: if G is an abelian group, such that for each n>0, the number of solutions to x^n= identity is at most n, then G is cyclic.

2007-03-02 16:20:24 · answer #2 · answered by limsup75 2 · 0 0

fedest.com, questions and answers