Great Deal! Get Instant $10 FREE in Account on First Order + 10% Cashback on Every Order Order Now

XXXXXXXXXXExercise 4 1 (i) Let Cn = {e, x, ..., xn-1} (x n = e) be the cyclic cyclic group of order n and let H be a subgroup of Cn. By considering min{i > 0 : x i ? H} show that H = hx mi for some...

1 answer below »
XXXXXXXXXXExercise 4 1 (i) Let Cn = {e, x, ..., xn-1} (x n = e) be the cyclic cyclic group of order n and let H be a subgroup of Cn. By considering min{i > 0 : x i ? H} show that H = hx mi for some m|n. *(ii) Find all subgroups of C18, explaining your answer. 2(i) Find (a XXXXXXXXXXmod 17), (b) 4-1 (mod 17), (c XXXXXXXXXXmod 17) *(ii) Find (a XXXXXXXXXXmod 13), (b XXXXXXXXXXmod 13) 3 Let G be a group in which g 2 = e for all g ? G. Show that G is abelian. *4 Thoughout this question, let G be a finite group and H and K subgroups of G. (i) Prove that H n K is a subgroup of G. (ii) Let HK denote the set {hk : h ? H, k ? K}. Prove that if H n K = {e} then |HK| = |H||K|. (iii) Prove that if G is abelian then HK is a subgroup of G. (iv) Prove that if |G| = 150, |H| = 6, |K| = 25 then G = HK. *5 Let G and H be groups. A map f : G -? H is said to be an isomorphism if f is bijective and f(g1g2) = f(g1)f(g2) for all g1, g2 ? G. If there exists an isomorphism f : G -? H then G and H are said to be isomorphic and we write G ~= H. You can think of isomorphic groups as being the same group with different names: if we write down the group table for G and rename elements we get the group table for H. (i) Show that if f is as above then f(eG) = eH and f(g -1 ) = (f(g))-1 for all g ? G. (Here eG is identity element of G and eH the identity element of H.) (ii) Write down the group tables for C4 and for Z * 5 . Find an isomorphism f : C4 -? Z * 5 . (iii) Recall that if X and Y are sets then the Cartesian product is the set of ordered pairs X × Y = {(x, y) : x ? X, y ? Y }. Show that if G and H are groups then G × H is a group under the group operation (g1, h1) ? (g2, h2) = (g1g2, h1h2). 1 (iv) Write down the group table for C2 × C2. Show that C2 × C2 is not isomorphic to C4. The following questions are optional and harder 6 Let G be a group of order 4. By first considering the order of elements in G, show that either G ~= C4 or G ~= C2 × C2. [Thus, up to isomorphism, there are just two groups of order 4.] 7 Let G be a group of order 6. By first considering the order of elements in G, show that either G ~= C6 or G ~= D3, where D3 is the symmetry group of the triangle, D3 = hx, y : x 3 = e, y2 = e, yx = x 2 yi = {e, x, x2 , y, xy, xy2}. [Thus, up to isomorphism, there are just two groups of order 6.]
Answered Same Day Dec 22, 2021

Solution

Robert answered on Dec 22 2021
134 Votes
1. (i) Let G be a cyclic group generated by x. Let H be a subgroup of G. If H = {e}, then H is a cyclic subgroup
generated by e. If H 6= {e}, then xn ∈ H for some n ∈ Z (since every element in G has the form xn and H
is a subgroup of G).
Let m be the smallest positive integer such that xm ∈ H. Consider an a
itrary element b of H. Since H
is a subgroup of G, b = xn for some n. Find integers q and r such that n = mq+ r with 0 ≤ r < m by
the Division Algorithm. It follows that xn = xmq+r = (xm)q xr and hence that xr = (xm)−q xn.
Since xm ∈ H so is its inverse (xm)−1, and all powers of its inverse by closure. Now xn and (xm)−q are
oth in H, thus so is their product xr by closure. However, m was the smallest positive integer such that
xm ∈ H and 0 ≤ r < m, so r = 0. Therefore n = qm and b = xn = (xm)q. We conclude that any a
itrary
element b = xn of H is generated by xm so H = 〈xm〉 is cyclic. �
1. (ii) The subgroups are
– Generator 〈1〉 = Z18
– Generator 〈2〉 =
{
[0], [2], [4], [6], [8], [10], [12], [14], [16]
}
– Generator 〈3〉 =
{
[0], [3], [6], [9], [12], [15]
}
– Generator 〈6〉 =
{
[0], [6], [12]
}
– Generator 〈0〉 = {0}
2.(a) Note that by Fermats Little theorem we have ap−1 ≡ 1 (mod p) for p - a. So we have 416 ≡ 1 (mod 17).
This says that 41600 ≡ 1 (mod 17) =⇒ 41602 ≡ 8 (mod 17).
2.(b) So evaluating 4−1 (mod 17) is same as finding a x such that 4x ≡ 1 (mod 17). And solving this gives
x = 13.
2. (c) This is same as in the (a) part, but with a little bit of trick. Note that by Fermat's Little Theorem we
had 416 ≡ 1 (mod 17) =⇒ 416×99 ≡ 41584 ≡ 1 (mod 17). Now we know that 42 ≡ −1
(mod 17) =⇒ 412 ≡ (−1)6 ≡ 1 (mod 17). So multiplying these two we get 41596 ≡ 1 (mod 17), and
from here we get 41597 ≡ 4 (mod 17).
2(ii). (a) So we want to find an x such that 11x ≡ 1 (mod 13) which says that x = 6.
2(ii). (b) Again applying Fermats little theorem we get 1112 ≡ 1 (mod...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here