next up previous
Next: Primitive n mathend000#-th roots of Up: Computing primitive n mathend000#-th roots Previous: Computing primitive n mathend000#-th roots

Some results from group theory

Definition 4   Let (G,.) mathend000# be a (multiplicative) group with neutral element e mathend000#. A nonempty subset H $ \subseteq$ G mathend000# is a subgroup of G mathend000# if the following three statements hold

Theorem 3   For every subgroup H mathend000# of the additive abelian group ($ \mbox{${\mathbb Z}$}$, +) mathend000# there exists an element a $ \in$ $ \mbox{${\mathbb Z}$}$ mathend000# such that H mathend000# is the set of the multiples of a mathend000#, that is H = a$ \mbox{${\mathbb Z}$}$ mathend000#.

Theorem 4   Let G mathend000# be a multiplicative group with neutral element e mathend000#. Let x $ \in$ G mathend000# an element and gr(x mathend000#) the subgroup of H mathend000# consisting of all powers of x mathend000# (including e = x0 mathend000# and x-1 mathend000# the inverse of x mathend000#). Let $ \Theta$(x) mathend000# be the order of gr(x mathend000#), that is the cardinality of gr(x mathend000#). Then two cases arise

Theorem 5 (Lagrange)   For every subgroup H mathend000# of the finite group G mathend000#, the order (that is the cardinality) of H mathend000# divides that of G mathend000#.


next up previous
Next: Primitive n mathend000#-th roots of Up: Computing primitive n mathend000#-th roots Previous: Computing primitive n mathend000#-th roots
Marc Moreno Maza
2007-01-10