|
|
|
|
when are relatively prime
|
(Proof)
|
|
|
We show that , gcd , is isomorphic to
, where denotes the cyclic group of order for any positive integer .
Let
and
. Then the external direct product
consists of elements
, where
and
.
Next, we show that the group
is cyclic. We do so by showing that it is generated by an element, namely : if generates
, then for each
, we must have
for some
. Such , if exists, would satisfy
Indeed, by the Chinese Remainder Theorem, such exists and is unique modulo . (Here is where the relative primality of comes into play.) Thus,
is generated by , so it is cyclic.
The order of
is , so is the order of . Since cyclic groups of the same order are isomorphic, we finally have
.
|
" when are relatively prime" is owned by yesitis.
|
|
(view preamble)
Cross-references: primality, Chinese remainder theorem, generates, generated by, cyclic, group, direct product, integer, positive, order, cyclic group, isomorphic, gcd
This is version 5 of when are relatively prime, born on 2008-04-16, modified 2008-04-17.
Object id is 10508, canonical name is C_mncongC_mtimesC_nWhenMNAreRelativelyPrime.
Accessed 260 times total.
Classification:
| AMS MSC: | 20A05 (Group theory and generalizations :: Foundations :: Axiomatics and elementary properties) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|