Aa Group Questions - UG1
Aa Group Questions - UG1
Dr Avishek Adhikari
Professor, Department of Mathematics,
Presidency University, Kolkata
2. State with proper justification whether the following ststement is true or false:
1
6. Let H and K be two subgroups of G. Then prove that
8. Let G be a commutative group. Show that the set H of all elements of finite order is a
subgroup of G.
9. Let G be a group and a ∈ G. If a is the only element of order n, prove that a ∈ Z(G),
where Z(G) is the center of the group.
11. Show that the group of non-zero complex numbers (C∗ , ·) has no proper subgroup of finite
index.
14. Let G be a cyclic group of order n. Then prove that for every positive divisor m of n,
there exists a unique subgroup of G of order m.
16. Let G =< a > be a finite cyclic group of order n. Show that ak is a generator of G iff
gcd(k, n) = 1, where k is a positive integer.
19. Give two examples of groups with infinite orders such that every element in these groups
have finite order.
20. Give two examples of non-commutative groups with infinite orders such that every element
in these groups have finite order.
2
21. Show that if a subgroup H of a group G has just one left coset different from itself, then
it is a normal subgroup of G. Also prove that G/H is commutative.
22. An element is called a square if it can be expressed in the form b2 for some b. Suppose
G is an abelian group and H is a subgroup of G. If every element of H is a square and
every element of G/H is a square, prove that every element of G is a square.
23. If M and N are normal subgroups of G such that M ∩ N = {e}, show that mn=nm
∀ m ∈ M, ∀ n ∈ N.
25. Suppose that G is a group of order 57 which is not cyclic. If G contains a unique subgroup
H of order 19, then for any g not belongs to H, find the order of the element g.
26. Let G = {n ∈ N : n ≤ 55, gcd(n, 55) = 1} be the group under multiplication modulo 55.
Let x ∈ G be such that x2 =26 and x > 30. Then find x.
27. Find the number of elements in the set {x ∈ S3 : x4 = e}, where e is the identity element
of the permutation group S3 .
28. Find the maximum order of a permutation σ in the symmetric group S10 .
29. Let H denote the group of all 2 × 2 invertible matrioces over Z5 under usal matrix
multiplication. Find the order of the matrix
2 3
A=
1 2
in H.
30. Suppose G is a cyclic group and σ, τ ∈ G are such that order(σ) =12 and order(τ ) =21.
Find the order of the smallest group containing σ and τ .
31. Let G be a group and Z(G) be its center. Prove that G/Z(G) is cyclic ⇒ G is Abelian.
32. Let G be a group and Z(G) be its center. Let H ≤ G such that H be a subgroup of
Z(G). Prove that G/H is cyclic ⇒ G = Z(G).
3
34. For each of the following either give with proper justification an example or else prove
that no such example is possible
4
(xxiv) The multiplicative group F7× is isomorphic to a subgroup of the multi-plicative group
×
F31 .
(xxv) Let G be a finite group and g ∈ G an element of even order. Then we can colour the
elements of G with two colours in such a way that x and gx have different colours
for each x ∈ G.
(xxvi) There exists a finite abelian group G containing exactly 60 elements of order 2.
(xxvii) In the symmetric group Sn any two elements of the same order are conjugate.
(xxviii) All non-trivial proper subgroups of (R, +) are cyclic.
(xxix) Every infinite abelian group has at least one element of infinite order.
(xxx) Any automorphism of the group Q under addition is of the form x → qx for some
q ∈ Q.
(xxxi) Any normal subgroup of order 2 is contained in the center of the group.
(xxxii) There is an element of order 51 in the multiplicative group Z∗103 .
(xxxiii) There is a non trivial group homomorphism from C to R.
(xxxiv) The automorphism group Aut(Z2 × Z2 ) is abelian.
(xxxv) If G is a finite group such that the group Aut(G) of automorphism of G is cyclic,
then G is abelian.
(xxxvi) There exists a group with a proper subgroup isomorphic to itself.
35. (a) Let σ be the m-cycle (a1 a2 · · · am ) in Sn , where n ≥ m. Show that |σ| = m.
(b) Show that the order of an element in Sn is the l.c.m. of the lenghts of the cycles in
its cycle decomposition.
40. Prove that for any finite group G, there exists a positive integer n such that G is isomor-
phic to a subgroup of An , where An is the alternating group.
a b 1 b
41. Let G = : a, b ∈ R, a > 0 and N = : b ∈ R . Then prove the
0 a−1 0 1
following.
(a) G/H is isomorphic to the group of positive real numbers with respect to usual
multiplication of real numbers.
(b) There is a proper normal subgroup N ′ of G which properly contains N .
5
43. Find the number of subgroups of order 17 in S17 .
44. Show that if n ≥ 4, the number of permutations in Sn which are product of two disjoint
2-cycles is n(n − 1)(n − 2)(n − 3)/8.
46. How many homomorphisms are there from Z20 onto Z8 ? How many are there to Z8 ?
47. Suppose that there is a homomorphism ϕ from Z17 to some group G, and that ϕ is not
one-one. Determine ϕ.
49. If ϕ is a homomorphism from Z30 onto a group of order 5, determine the kernel of ϕ.
50. Find a homomorphism ϕ from U (30) to U (30) with the kernel {1, 11} and ϕ(7) = 7
′
51. Let ϕ : G → G be an ONTO group homomorphism. If N is a normal subgroup of G
then show that ϕ(N ) is normal subgroup of G.
52. For any two positive integers m and n such that gcd(m, n) = 1, prove that mZ/mnZ ≃ Zn .
53. Let G be a group and A and B be two normal subgroups of G such that A ≃ B. Show
by an example that G/A ̸≃ G/B.
54. Find two groups A and B such that A ̸≃ B but Aut(A) ≃ Aut(B).
57. Prove that R/Z ≃ S 1 , where S 1 is the subgroup of C∗ with unit modulus.
59. Let G be a finite group and H be a proper subgroup of G such that for x, y ∈ G − H, xy ∈
H. Prove that H is a normal subgroup of G such that |G| is an even integer.
60. Prove that a finitely generated group cannot be expressed as the union of an ascending
sequence of its proper subgroups.
6
63. Find the center of the dihedral group Dn , n ≥ 1.
67. If A is isomorphic to a group B, then prove that Aut(A) is also isomorphic to the group
Aut(B).
68. Find Aut((Z,+)), Aut((Q,+)), Aut*((R,+)), where Aut*((R,+)) is the group of all con-
tinuous automorphisms/ order preserving automorphisms on R. Will the Automorphim
group be same, if we consider rings instead of group.
69. Let G be the additive group of real numbers, let H be the multiplicative group of complex
numbers of absolute value 1 (the unit circle S 1 in the complex plane) and let ϕ : G → H
be the homomorphism ϕ : r → e2πir .
70. Repeat the preceding exercise with the map ϕ replaced by the map ϕ : r → e4πir .
71. Prove that Q/Z is isomorphic to the multiplicative group of roots of unity in C∗ .
73. Cauchy’s theorem on finite groups states that - “If G is a finite group such that p | o(G)
where p is a prime, then G has an element of order p”. Use this to show that any abelian
group of order 77 is cyclic. More generally, show that any group of order 77 is cyclic.
74. Let G be a finite group with more than one element. Show that G has an element of
prime order.
75. Suppose that G is a NON-ABELIAN group of odd order p3 (where p is a prime) and
Z(G) ̸= {e}. Prove that |Z(G)| = p.
76. Suppose G is a group of order 2p, where p is an odd prime. Assume that G has a normal
subgroup of order 2. Prove that G is cyclic.
77. Suppose that G is a group that has exactly one non-trivial proper subgroup. Prove that
G is cyclic and |G| = p2 where p is prime.
7
78. If |G| = pq, prove that |Z(G)| = 1 or pq, where p and q are primes.
79. Let G = GL2 (R) with matrix multiplication as binary operation on it.
(i) Show that G is a group
(ii) Find Z(G)
(iii) Find a non-trivial homomorphism from G onto an abelian group.
81. Suppose Φ ̸= A ⊂ G.
Define, CG (A) = {g ∈ G : gag −1 = a ∀a ∈ A}. This subset of G is called the centralizer
of A in G. Prove that CG (A) ⊆ G. In the special case when A = {a} we write simply
CG (a).
8
Problem Set: Introductory No. Theory
***************************
n
1. Show that the last digit in the decimal expression of Fn = 22 + 1 is 7 if n ≥ 2.
2. Show that if a and n are positive integers with gcd(a, n) = gcd(a − 1, n) = 1, then
1 + a + a2 + · · · + aϕ(n)−1 ≡ 0 (mod n).
3. Show that aϕ(b) + bϕ(a) ≡ 1 (mod ab), if a and b are relatively prime positive integers.
4. Use Euler’s theorem, find the last digit in the decimal representation of 71000 .
17 19
5. Find the last digit in the decimal representation of 1717 and 1919 .
7. Let n be a positive integer. Prove that the sum of all positive integers satisfying 1 ≤ a ≤ n
and gcd(a, n)=1 is nϕ(n)
2
.
8. For all positive integer n and for all positive integer a ≥ 2, prove that n divides ϕ(an − 1).
9. Prove that σ(n) is an odd integer if and only if n is a perfect square or a double of a
perfect square.
9
16. Prove that for any prime p, (a + b)p ≡ ap + bp ( mod p).
18. Let ϕ, τ , σ denote respectively the Euler ϕ function, number of positive divisors function
and sum of positive divisors function. If gcd(m, n) = 1, prove that
20. Prove that if p is an odd prime of the form p ≡ 3( (mod 4)), then ( p−1
2
!) ≡ ±1( mod p).
24. Let p be a prime number and e be the largest exponent of p such that pe divides n!. Prove
∞
X n
that e = i
.
i=1
p
27. Find the remainder when [(1 + 10!) × (1 + 10!)2 × (1 + 10!)3 × · · · × (1 + 10!)100 ]100 is
divided by 10!.
28. Show that no number in the sequence 11, 111, 1111, . . . is a perfect square.
29. Show that there are no integers x and y such that 15x2 − 7y 2 = 9.
1 1 1
30. If pi is the ith prime prove that p1
+ p2
+ ··· + pn
is not an integer.
***************************
Identify the correct alternative(s) (may be more than one) from the following list:
1. Suppose the sum of the seven positive numbers is 21. What is the minimum possible
value of the average of the squares of these numbers ?
(a) 9 (b) 21 (c) 63 (d) 7
10
2. The number of elements in the set {n : 1 ≤ n ≤ 1000, n and 1000 are relatively prime }
is
(a) 300 (b) 250 (c) 100 (d) 400
9. Given a positive integer n, let ϕ(n) denote the number of integers k such that 1 ≤ k ≤ n
and gcd(k, n) = 1. Then identify the correct statement(s):
(a) ϕ(m) divides m for every positive integer m;
(b) a divides ϕ(am − 1) for all positive integers a and m such that gcd(a, m) = 1;
(c) m divides ϕ(am − 1) for all positive integers a ≥ 2 and m such that gcd(a, m) = 1;
(d) m divides ϕ(am − 1) for all positive integers a ≥ 2 and m.
11