What is a semigroup? What is a group? What is the difference between a semigroup and a group?

Size: px
Start display at page:

Download "What is a semigroup? What is a group? What is the difference between a semigroup and a group?"

Transcription

1 The second exam will be on Thursday, July 5, The syllabus will be Sections IV.5 (RSA Encryption), III.1, III.2, III.3, III.4 and III.8, III.9, plus the handout on Burnside coloring arguments. Of course, the material is cumulative, and the listed sections depend on earlier sections, which it is assumed that you still know. Following are some of the concepts and results you should know: What is a semigroup? What is a group? What is the difference between a semigroup and a group? Know examples of groups such as S n, D 4, Z, Z n, cyclic groups. In particular, know what elements of these groups are and what the group operation is in each case. Know the order of each of the groups which is finite. Know the cancelation rules in a group. For example, if ab = ac then b = c. Exponential rules in groups. For example, a m a n = a m+n, (a m ) n = a mn, and (ab) 1 = b 1 a 1. What does it mean to be a subgroup? Know the criterion to be a subgroup (Proposition 3.8) and how to use it to check that H is a subgroup of a group G. What is the center Z(G) of a group G? What is an abelian group? What is a cyclic group? What is a generator of a cyclic group? What is the condition for an element a Z n to have a multiplicative inverse? (Answer: a and n should be relatively prime integers. When a has a multiplicative inverse, know how to find it using the Euclidean algorithm. What is the order of a group (denoted G )? What is the order o(g) of an element g G? (o(g) is the smallest positive integer m such that g m = e.) If o(g) = m, then g n = e if and only if m n. Every subgroup of a cyclic group is cyclic (Proposition 3.19). The left cosets of a subgroup H are the sets ah = {ah : h H}. They are precisely the equivalence classes of the equivalence relation a H b a 1 b H. The set of left cosets of H in G is denoted G/H. Lagrange s Theorem: [G : H] = G / H. G / H. In particular, H G. That is, the number of cosets of H is exactly The order of every element of a group divides the order of the group (Corollary 4.9). If the order of G is prime, then G is cyclic (Corollary 4.11). S n denotes the set of all permutations of the set {1,..., n} of integers from 1 to n. cardinality of S n is S n = n!. The Know how to represent permutations in the two rowed notation, and how to multiply permutations using this notation. Know what a cycle of length r is. A cycle of length 2 is a transposition. 1

2 Know what it means to say that two cycles π and σ are disjoint. Disjoint cycles commute. (Lemma 8.4, Page 109) Know how to compute the cycle decomposition of permutations in S n. Know how to go back and forth between two rowed notation for permutations and cycle decompositions. Know how to multiply permutations given in either format and express the result in either two rowed or cycle notation. Know what is meant by the order of a permutation: o(π) is the smallest positive integer k such that π k = id. That is, o(π) is the order of π as an element of the group S n The order of an r-cycle is r. Know how to compute the order of a permutation from the cycle structure: If π = τ 1 τ 2 τ k is a product of disjoint cycles, then the order of π is the least common multiple of the lengths of the cycles τ 1,..., τ k. A transposition is a cycle of length 2. Every permutation is a product of transpositions. The number of transpositions in such a product for a permutation σ is always even or always odd. σ is even if it is a product of an even number of transpositions; σ is odd if it is a product of an odd number of transpositions. An r-cycle (j 1, j 2,..., j r ) is an even permutation if r is odd and it is an odd permutation if r is even. This follows from the factorization (j 1 j 2... j r ) = (j 1 j r )(j 1 j r 1 ) (j 1 j 2 ). The alternating group A n S n is the subgroup of all even permutation. The order of A n is A n = n!/2. Know what it means to say that a group G acts on a set X (Definition 9.2, Page 118). Namely, each element g of G determines a permutation of X, denoted by x gx, in such a way that: (a) ex = x for all x X, where e is the identity of G. That is the permutation of X determined by e is the identity permutation. (b) (gh)x = g(hx) for all g, h G and x X. That is, the multiplication of g and h in G corresponds to the permutation of X that is the composition of the permutation determined by h and that determined by g. If G is a group acting on a set X and a X, know what the orbit of a under the action of G is. Namely, Orb(a) = {ga : g G}. That is, the orbit of a consists of all of the elements of X that are the image of a under one of the permutations of X determined by an element of G. Know what the stabilizer of a, denoted G a, is: G a = {g G : ga = a}. That is the stabilizer of a consists of all the group elements g that do not move a under the permutation of X determined by g. 2

3 If G acts on a set X, then the orbits of this action form a partition of X. If G acts on a set X, then the stabilizer G a of each element a X is a subgroup of G. Know the Orbit-Stabilizer theorem for group actions (Proposition 9.11, Page 121): If G acts on X and a X is any element of X, then Orb(a) = [G : G a ] = G G a = the number of cosets of G a in G. Another way to state the same thing is: Orb(a) G a = G. If G is a group acting on the set X and g G, know what the fixed set of g, denoted X g is: X g = {x X : gx = x}. That is, X g is the set of elements of X that are not moved by the permutation of X determined by g. Know the Burnside counting theorem (Theorem 9.15, Page 122: If G is a finite group acting on a finite set X, then the number N of orbits in X under this action of G is N = 1 G X g g G where X g is the number of elements in X that are fixed by g. A convenient way to think about this theorem is that it says that the number of orbits is the average (as g varies over G) of the number of elements of X fixed by an element g of G. Know how to use Burnside s theorem to compute the number of distinct patterns in the colorings of a given set of points in the plane, using the action of the symmetry group of the points. Review Exercises Be sure that you know how to do all assigned homework exercises. The following are a few supplemental exercises similar to those already assigned as homework. These exercises are listed randomly. That is, there is no attempt to give the exercises in the order of presentation of material in the text. 1. If a, b, and c are elements of a group G, then solve the equation axb = c for x G. Solution. Multiply on the left by a 1 and on the right by b 1 to get x = exe = a 1 axbb 1 = a 1 cb Let α = S 5. 5, β = (a) Solve for γ: αγ = β. (b) Solve for δ: δα = β. (c) Solve for ν: ανα 1 = β. 5. Solve each of the following equations in

4 5 5 5 Solution. γ = α 1 β = = δ = βα 1 = = ν = α 1 βα = γα = = Let G = {1, 1, i, i} C. Recall that C is the multiplicative group of nonzero complex numbers. (a) Verify that G is a subgroup of C. (Constructing a Cayley table for G may be useful.) (b) Verify that S = {1, i} is not a subgroup of G. (c) Verify that G is cyclic and list all the generators of G. Solution. The following is the multiplication table for G: 1 1 i i i i i i i i i 1 1 i i i 1 1 From the table it is clear that G is closed under multiplication so G is a subgroup of C Since i 2 = 1 / S, S is not closed under multiplication, and hence S is not a subgroup of G. Since (1) = {1}, ( 1) = {1, 1}, (i) = {i, 1, i, 1} = G, and ( i) = { i, 1, i, 1} = G, it follows that i and i are generators for G, while 1 and 1 are not. 4. Suppose that G is the group defined by the following Cayley table. (a) Which element is the identity of G? (b) What is g 1? (c) Find C(g) = {x G : xg = gx}. (d) Find the order of d and the order of g. Solution. a b c d e f g h a a b c d e f g h b b a h g f e d c c c d e f g h a b d d c b a h g f e e e f g h a b c d f f e d c b a h g g g h a b c d e f h h g f e d c b a (a) The identity of G is a since (from the table) ax = x = xa for all x G. (b) g 1 = c since gc = cg = a and a is the identity of G. 4

5 (c) C(g) = {a, c, e, g}. (d) d = { d, a = d 2} so o(d) = d = 2, and g = { g, e = g 2, c = g 3, a = g 4} so o(g) = g = (a) If G is a group with G = 21, what are the possible orders of elements of G? (b) If G = 21, and H is a subgroup of G other than G itself, explain why H must be cyclic. (c) Let K be a subgroup of a group L and let L be a subgroup of a group M. What are the possible values of L if K = 6 and M = 72? Solution. (a) The order of an element of a group must divide the order of the group (Corollary 4.9, Page 78). Hence the possible orders of elements of G are the divisors of G = 21, i.e., 1, 3, 7, and 21. (b) The possible orders for H are 1, 3, and 7 by Lagrange s Theorem. H = 21 since H = G by assumption. Thus H is 1, in which case H = {e} which is clearly cyclic, or H = 3 or 7 which are both prime numbers and thus H is cyclic by Corollary 4.11, Page 78. (c) Since K is a subgroup of L, L is a multiple of K = 6 and since L is a subgroup of M, L divides M = 72. Thus L is a multiple of 6 which also divides 72, so the possibilities for L are 6, 12, 13, 24, 36, and Let α = ( 5 6 ) and β = ( 1 2 ) ( ). (Note that we are using the cycle notation for α and β which we are assuming are in S 6. (a) Write α and β in two rowed notation. (b) Express α 1 and α 2 as products of disjoint cycles. (c) Write β as a product of 2 cycles. Is β even or odd? (d) Let θ = στ where σ and τ are disjoint cycles of length 9 and 6, respectively. Find the smallest positive integer s such that θ s is the identity permutation. Solution. (a) α = 5 6 and β = (b) α 1 = ( ) and α 2 = ( ) ( ). (c) β = ( 1 2 ) ( 4 6 ) ( 4 5 ). Hence β is an odd permutation (d) The smallest possible s is the least common multiple of 6 and 9, i.e. 18. (See Lemma 8.7, Page 110.) 7. Write each of the following permutations as a product of disjoint cycles. (Remember that a single cycle qualifies.) 5 6 (a)

6 (f) ( 1 2 ) 5 6 (b) (c) ( 1 2 ) ( 1 3 ) ( 1 4 ) (d) ( 1 3 ) 1 ( 2 4 ) ( ) 1 (e) ( ) ( ) ( 1 3 ) (f) ( ) 1 ( 2 3 ) ( ) Solution. (a) ( ) ( 2 5 ) (b) ( 2 6 ) ( ) (c) ( ) (d) ( ) (e) ( 1 5 ) ( 2 3 ) 8. Determine all the left cosets of H in G if: (a) G = Z 24, H = ( 4). (b) G = S 3, H = ( ( 2 3 ) ). (c) G = D 4, H = (β) where β is the reflection about the horizontal centerline of a square. (See Page 58). Solution. (a) H = { 0, 4, 8, 12, 16, 20} 1H = { 1, 5, 9, 13, 17, 21} 2H = { 2, 6, 10, 14, 18, 22} 3H = { 3, 7, 11, 15, 19, 23} (b) H = { ε, ( 2 3 )} ( 1 2 ) H = {( 1 2 ), ( )} ( 1 3 ) H = {( 1 3 ), ( )} (c) H = {ε, β} αh = {α, αβ} α 2 H = { α 2, α 2 β } α 3 H = { α 3, α 3 β } 6

7 (d) ( 1 4 ) 9. Let H = 5Z in Z. Then H is a subgroup of the additive group Z. Determine whether the following cosets of H are the same. (Remember the group operation is + so cosets will be written a + H, rather than ah.) (a) 12 + H and 27 + H (b) 13 + H and 2 + H (c) H and 1 + H Solution. (a) = 15 = 5 3 H. Thus the two cosets are equal. (b) 2 13 = 15 H. Thus the two cosets are equal. (c) = 127 / H. Thus the two cosets are not equal. 10. Assume that σ = and τ = are permutations in S Compute each of the following elements of S 4 : (a) στ (b) τσ (c) σ 2 (d) τ 2 (e) τ 3 (f) τ 4 (g) σ 1 (h) τ 1 Solution. στ =, τσ =, σ =, τ 2 =, τ =, τ =, σ 1 =, τ 1 = Write each of the following permutations as a single cycle or a product of disjoint cycles. 5 6 (a) (b) (c) (d) Solution. (a) ( 2 6 ) ( ) (b) ( ) (c) ( 1 2 ) 12. In S 10, let α = (1, 3, 5, 7, 9), β = (1, 2, 6), γ = (1, 2, 5, 3), and let σ = αβγ. Write σ as a product of disjoint cycles, and use this to find its order and its inverse. Is σ even or odd? Solution. σ = (1, 6, 3, 2, 7, 9). Thus σ is a 6-cycle so the order of σ is 6, σ is odd, and σ 1 = (1, 9, 7, 2, 3, 6). 13. Show that S 10 has elements of order 10, 12, and 14, but not 11 or 13. 7

8 Solution. If α = (1, 2)(3, 4, 5, 6, 7), β = (1, 2, 3)(4, 5, 6, 7), γ = (1, 2)(3, 4, 5, 6, 7, 8, 9), then the order of α is 10, the order of β is 12 and the order of γ is 14 (see Theorem 4.2.6). Since 11 is prime, any permutation of order 11 must be an 11-cycle or a product of disjoint 11-cycles. In S(10) there are no cycles of length 11. Hence there can be no elements of S(10) of order 11. The same argument applies to 13 since 13 is also a prime bigger than Write each of the following permutations as a product of disjoint cycles. (a) (1, 2, 3)(1, 4, 5) (b) (1, 2, 3, 4)(1, 5, 6, 7) (c) (1, 2, 3, 4, 5)(1, 6, 7, 8, 9) (d) (1, 4)(2, 4)(3, 4)(1, 2)(2, 4)(2, 3) 15. Let α = (1, 3)(1, 5)(1, 6)(2, 1)(2, 4)(2, 6) and β = (1, 2, 5)(3, 2, 6)(1, 4). Find the disjoint cycle factorizations of α, α 1, β, and β 99 and give the order of each of these four permutations. Solution. α = (1, 2, 5, 3)(4, 6), α 1 = (1, 3, 5, 2)(4, 6), and β = (1, 4, 2, 6, 3, 5). Since β is a 6-cycle, it has order 6. Since 99 = , β 99 = β 3 = (1, 6)(2, 5)(4, 3). The order of α and α 1 is lcm {4, 2} = 4. Since β 99 is a product of disjoint 2-cycles, the order is Count the number of ways that a 3 3 grid of squares can be colored red or black (adjacent squares are allowed to have the same color). We will assume that two colorings are the same when one can be obtained from the other by clockwise rotation by 90, 180, or 270. It may be helpful to use the following two grids for visualization purposes The grid on the right is obtained from the one on the left by rotation ρ by 90, so that ρ can be identified with the following permutation of the nine small squares: ρ = ( ) ( ) ( 5 ) The following represents a particular coloring of the grid and the coloring obtained by 90 clockwise rotation. Thus these two colorings will be considered the same. R B B R R B B R R B R R R R B R B B Solution. This is an application of Burnside s theorem (Theorem III (9.15)). Let X be the set of all possible ways to color the 3 3 grid, without taking into account any symmetry. Thus, each of the 9 small squares can be colored Red or Black, independent of any other square, so that X = 2 9. The identification of colorings that we are using means that the group G of rotations by 90, 180, 270, and 360 acts on X, and the number of distinct colorings is the number N of orbits of this group action. Since G = { ε, ρ, ρ 2, ρ 3}, we need to 8

9 compute the representation of each element of G as a permutation of the small squares in the grid: ρ = ( ) ( ) ( 5 ) ρ 2 = ( 1 9 ) ( 3 7 ) ( 2 8 ) ( 6 4 ) ( 5 ) ρ 3 = ( ) ( ) ( 5 ) Now we have to compute the number of elements in each fixed point set X g (g G). Here we observe that for a coloring to be fixed by g, each of the squares labeled with an index from a cycle in the disjoint cycle factorization of g must be assigned the same color. Thus, X g = 2 r where r is the number of disjoint cycles in the factorization of g. Hence we have the following table: g X g ε 2 9 ρ 2 3 ρ ρ Now apply Burnside s theorem to compute N: N = 1 G g G X g = 1 4 ( ) = = Find the number of different regular pentagons with vertices colored red, white, or blue. Solution. The group of symmetries of a regular pentagon is D 5 = { id, ρ,, ρ 2, ρ 3, ρ 4, β, ρβ, ρ 2 β, ρ 3 β, ρ 4 β }, which consists of the identity, four nontrivial rotations (the powers of ρ) and five reflections. Thus, D 5 = 10. The identity fixes all 3 5 = 243 possible 3-colored pentagons. Each nontrivial rotation will fix only those pentagons that have all vertices the same color, hence the fixed set of each nontrivial rotation contains 3 elements. Each reflection will fix a pentagon provided the corresponding vertices are colored the same. Thus there are 3 3 = 27 3-colored pentagons fixed by each reflection. By Burnside s Theorem, the number of distinct orbits is ( )/10 = A wheel is divided evenly into four compartments. Each compartment can be painted red, white, or blue. The back of the wheel is black. How many different such color wheels are there? Solution. The group of symmetries is a cyclic group of order 4, G = { id, α, α 2, α 3} where α denotes a rotation by 90. We have X id = 3 4, X α = 3 = X α 3, and X α 2 = 3 2. By Burnside s theorem, the number of different wheels is ( )/4 = A rectangular necktie is divided evenly into five bands and each band may be colored green, red, or blue. How many different neckties are there? 9

10 Solution. The symmetry group of the tie is the cyclic group G = {id, τ} of order 2 where τ is the rotation by 180. Then X id = 3 5 = 243, and X τ = 3 3 = 27 since the first and last bands must be colored the same and the second and fourth bands must be colored the same, while the center band can be any color. Thus, by Burnside s theorem the number of different neckties is ( )/2 = A rectangular electrical relay box appears as shown below: If each wire may be red or black, how many such boxes, taking symmetry into account, are there? If each wire may be red, black, or white, how many such boxes are there? Solution. The symmetry group of the rectangle is G = {id, α, β, γ} where α is reflection about the vertical axis through the middle of the box, β is reflection about the horizontal axis through the middle of the box, and γ = αβ is rotation through 180 through the center of the box. Then X id = 2 6 = 64, X α = 2 3 = 8, X β = 2 4 = 16 (since the single wires on each end can be either color), and X γ = 2 3 = 8. Thus, there are ( )/4 = 24 different boxes. If we allow 3 possible colors for each wire, then the number of different boxes is ( )/4 = Think of the set of all six-digit binary words that is, strings of length 6 composed of 0 s and 1 s. For example: In some applications, two six-digit words are considered equivalent if one can be obtained from the other by applying the cyclic permutation σ: a 1 a 2 a 3 a 4 a 5 a 6 a 6 a 1 a 2 a 3 a 4 a 5 a number of times. For example, is equivalent to since the second string is obtained from the first by applying σ 3 times. Find the number of such non-equivalent words. Solution. This problem is the same type of application of Burnside s theorem as the previous exercise. In this case X is the set of all possible binary words of length 6, and G is the cyclic group generated by the 6-cycle σ = ( 5 6 ). Hence the non-identity elements of G are: σ = ( 5 6 ) σ 2 = ( ) ( ) σ 3 = ( 1 4 ) ( 2 5 ) ( 3 6 ) σ 4 = ( ) ( ) σ 5 = ( ) 10

11 The following table then lists all the sizes of fixed point sets for G acting on X. g X g ε 2 6 σ 2 σ σ σ σ 5 2 The number of equivalent words is then the number N of orbits under of action of G on X. By Burnside s theorem, this is N = 1 G X g = 1 6 ( ) = 84 6 = 14. g G 11

Homework #4 Solutions Due: July 3, Do the following exercises from Lax: Page 124: 9.1, 9.3, 9.5

Homework #4 Solutions Due: July 3, Do the following exercises from Lax: Page 124: 9.1, 9.3, 9.5 Do the following exercises from Lax: Page 124: 9.1, 9.3, 9.5 9.1. a) Find the number of different squares with vertices colored red, white, or blue. b) Find the number of different m-colored squares for

More information

The number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!.

The number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!. The first exam will be on Friday, September 23, 2011. The syllabus will be sections 0.1 through 0.4 and 0.6 in Nagpaul and Jain, and the corresponding parts of the number theory handout found on the class

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

The Symmetric Groups

The Symmetric Groups Chapter 7 The Symmetric Groups 7. Introduction In the investigation of finite groups the symmetric groups play an important role. Often we are able to achieve a better understanding of a group if we can

More information

Homework #5 Solutions

Homework #5 Solutions Homework #5 Solutions p 83, #16. In order to find a chain a 1 a 2 a n of subgroups of Z 240 with n as large as possible, we start at the top with a n = 1 so that a n = Z 240. In general, given a i we will

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

Algebra: Groups. Group Theory a. Examples of Groups. groups. The inverse of a is simply a, which exists.

Algebra: Groups. Group Theory a. Examples of Groups. groups. The inverse of a is simply a, which exists. Group Theory a Let G be a set and be a binary operation on G. (G, ) is called a group if it satisfies the following. 1. For all a, b G, a b G (closure). 2. For all a, b, c G, a (b c) = (a b) c (associativity).

More information

BMT 2014 Symmetry Groups of Regular Polyhedra 22 March 2014

BMT 2014 Symmetry Groups of Regular Polyhedra 22 March 2014 Time Limit: 60 mins. Maximum Score: 125 points. Instructions: 1. When a problem asks you to compute or list something, no proof is necessary. However, for all other problems, unless otherwise indicated,

More information

MATH 420 FINAL EXAM J. Beachy, 5/7/97

MATH 420 FINAL EXAM J. Beachy, 5/7/97 MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only

More information

Math 3140 Fall 2012 Assignment #3

Math 3140 Fall 2012 Assignment #3 Math 3140 Fall 2012 Assignment #3 Due Fri., Sept. 21. Remember to cite your sources, including the people you talk to. My solutions will repeatedly use the following proposition from class: Proposition

More information

Some practice problems for midterm 2

Some practice problems for midterm 2 Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is

More information

120A LECTURE OUTLINES

120A LECTURE OUTLINES 120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication

More information

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary

More information

Group Actions Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying:

Group Actions Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying: Group Actions 8-26-202 Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying: (a) θ(g,θ(g 2,x)) = θ(g g 2,x) for all g,g 2 G and x X. (b) θ(,x) =

More information

Section III.15. Factor-Group Computations and Simple Groups

Section III.15. Factor-Group Computations and Simple Groups III.15 Factor-Group Computations 1 Section III.15. Factor-Group Computations and Simple Groups Note. In this section, we try to extract information about a group G by considering properties of the factor

More information

17 More Groups, Lagrange s Theorem and Direct Products

17 More Groups, Lagrange s Theorem and Direct Products 7 More Groups, Lagrange s Theorem and Direct Products We consider several ways to produce groups. 7. The Dihedral Group The dihedral group D n is a nonabelian group. This is the set of symmetries of a

More information

MATH 433 Applied Algebra Lecture 22: Review for Exam 2.

MATH 433 Applied Algebra Lecture 22: Review for Exam 2. MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric

More information

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element. The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring

More information

Part II Permutations, Cosets and Direct Product

Part II Permutations, Cosets and Direct Product Part II Permutations, Cosets and Direct Product Satya Mandal University of Kansas, Lawrence KS 66045 USA January 22 8 Permutations Definition 8.1. Let A be a set. 1. A a permuation of A is defined to be

More information

Section 10: Counting the Elements of a Finite Group

Section 10: Counting the Elements of a Finite Group Section 10: Counting the Elements of a Finite Group Let G be a group and H a subgroup. Because the right cosets are the family of equivalence classes with respect to an equivalence relation on G, it follows

More information

INTRODUCTION TO THE GROUP THEORY

INTRODUCTION TO THE GROUP THEORY Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher

More information

A. (Groups of order 8.) (a) Which of the five groups G (as specified in the question) have the following property: G has a normal subgroup N such that

A. (Groups of order 8.) (a) Which of the five groups G (as specified in the question) have the following property: G has a normal subgroup N such that MATH 402A - Solutions for the suggested problems. A. (Groups of order 8. (a Which of the five groups G (as specified in the question have the following property: G has a normal subgroup N such that N =

More information

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Section 0. Sets and Relations Subset of a set, B A, B A (Definition 0.1). Cartesian product of sets A B ( Defintion 0.4). Relation (Defintion 0.7). Function,

More information

Teddy Einstein Math 4320

Teddy Einstein Math 4320 Teddy Einstein Math 4320 HW4 Solutions Problem 1: 2.92 An automorphism of a group G is an isomorphism G G. i. Prove that Aut G is a group under composition. Proof. Let f, g Aut G. Then f g is a bijective

More information

Mathematics 331 Solutions to Some Review Problems for Exam a = c = 3 2 1

Mathematics 331 Solutions to Some Review Problems for Exam a = c = 3 2 1 Mathematics 331 Solutions to Some Review Problems for Exam 2 1. Write out all the even permutations in S 3. Solution. The six elements of S 3 are a =, b = 1 3 2 2 1 3 c =, d = 3 2 1 2 3 1 e =, f = 3 1

More information

Name: Solutions - AI FINAL EXAM

Name: Solutions - AI FINAL EXAM 1 2 3 4 5 6 7 8 9 10 11 12 13 total Name: Solutions - AI FINAL EXAM The first 7 problems will each count 10 points. The best 3 of # 8-13 will count 10 points each. Total is 100 points. A 4th problem from

More information

Know the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].

Know the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x]. The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive

More information

The Class Equation X = Gx. x X/G

The Class Equation X = Gx. x X/G The Class Equation 9-9-2012 If X is a G-set, X is partitioned by the G-orbits. So if X is finite, X = x X/G ( x X/G means you should take one representative x from each orbit, and sum over the set of representatives.

More information

Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.

Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV. Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is

More information

Chapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations

Chapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations Chapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations (bijections). Definition A bijection from a set A to itself is also

More information

Chapter 3. Introducing Groups

Chapter 3. Introducing Groups Chapter 3 Introducing Groups We need a super-mathematics in which the operations are as unknown as the quantities they operate on, and a super-mathematician who does not know what he is doing when he performs

More information

Cosets and Lagrange s theorem

Cosets and Lagrange s theorem Cosets and Lagrange s theorem These are notes on cosets and Lagrange s theorem some of which may already have been lecturer. There are some questions for you included in the text. You should write the

More information

Math 31 Take-home Midterm Solutions

Math 31 Take-home Midterm Solutions Math 31 Take-home Midterm Solutions Due July 26, 2013 Name: Instructions: You may use your textbook (Saracino), the reserve text (Gallian), your notes from class (including the online lecture notes), and

More information

Math 120A: Extra Questions for Midterm

Math 120A: Extra Questions for Midterm Math 120A: Extra Questions for Midterm Definitions Complete the following sentences. 1. The direct product of groups G and H is the set under the group operation 2. The symmetric group on n-letters S n

More information

6 Cosets & Factor Groups

6 Cosets & Factor Groups 6 Cosets & Factor Groups The course becomes markedly more abstract at this point. Our primary goal is to break apart a group into subsets such that the set of subsets inherits a natural group structure.

More information

Groups and Symmetries

Groups and Symmetries Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group

More information

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed. Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply

More information

ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION

ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION PAVEL RŮŽIČKA 9.1. Congruence modulo n. Let us have a closer look at a particular example of a congruence relation on

More information

6 Permutations Very little of this section comes from PJE.

6 Permutations Very little of this section comes from PJE. 6 Permutations Very little of this section comes from PJE Definition A permutation (p147 of a set A is a bijection ρ : A A Notation If A = {a b c } and ρ is a permutation on A we can express the action

More information

Exercises MAT2200 spring 2013 Ark 3 Cosets, Direct products and Abelian groups

Exercises MAT2200 spring 2013 Ark 3 Cosets, Direct products and Abelian groups Exercises MAT2200 spring 2013 Ark 3 Cosets, Direct products and Abelian groups This Ark concerns the weeks No. (Feb ) andno. (Feb Mar ). The plans for those two weeks are as follows: On Wednesday Feb I

More information

SF2729 GROUPS AND RINGS LECTURE NOTES

SF2729 GROUPS AND RINGS LECTURE NOTES SF2729 GROUPS AND RINGS LECTURE NOTES 2011-03-01 MATS BOIJ 6. THE SIXTH LECTURE - GROUP ACTIONS In the sixth lecture we study what happens when groups acts on sets. 1 Recall that we have already when looking

More information

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson On almost every Friday of the semester, we will have a brief quiz to make sure you have memorized the definitions encountered in our studies.

More information

Theorems and Definitions in Group Theory

Theorems and Definitions in Group Theory Theorems and Definitions in Group Theory Shunan Zhao Contents 1 Basics of a group 3 1.1 Basic Properties of Groups.......................... 3 1.2 Properties of Inverses............................. 3

More information

1 Finite abelian groups

1 Finite abelian groups Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Each Problem is due one week from the date it is assigned. Do not hand them in early. Please put them on the desk in front of the room

More information

Name: Solutions Final Exam

Name: Solutions Final Exam Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] All of

More information

Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Math 2070BC Term 2 Weeks 1 13 Lecture Notes Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic

More information

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.

More information

3.3 Equivalence Relations and Partitions on Groups

3.3 Equivalence Relations and Partitions on Groups 84 Chapter 3. Groups 3.3 Equivalence Relations and Partitions on Groups Definition 3.3.1. Let (G, ) be a group and let H be a subgroup of G. Let H be the relation on G defined by a H b if and only if ab

More information

John B. Fraleigh, A first course in Abstract Algebra, 5th edition, Addison-Wesley.

John B. Fraleigh, A first course in Abstract Algebra, 5th edition, Addison-Wesley. MATH222 ALGEBRAIC METHODS I This subject introduces the study of fundamental algebraic structures and the methods of abstract algebra which pervade much of modern mathematics. One of the important aims

More information

Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3

Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group

More information

DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents

DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions

More information

1 Lecture 1 (1/5/2009)

1 Lecture 1 (1/5/2009) 1 Lecture 1 (1/5/2009) Notation 1.1 Introduce N := {0, 1, 2,... }, Z, Q, R, and C. Also let Z + := N \ {0}. Set notations. Recalled basic notions of a function being one to one, onto, and invertible. Think

More information

1 Lecture 1 (1/5/2009)

1 Lecture 1 (1/5/2009) 1 Lecture 1 (1/5/2009) Notation 1.1 Introduce N := {0, 1, 2,... }, Z, Q, R, and C. Also let Z + := N \ {0}. Set notations. Recalled basic notions of a function being one to one, onto, and invertible. Think

More information

α = Permutation groups

α = Permutation groups Permutation groups A permutation of a set A is another name for a bijection from A to A, that is, any function ϕ: A A which is both one-to-one and onto. When A is a finite set with n objects, it is customary

More information

Foundations Revision Notes

Foundations Revision Notes oundations Revision Notes hese notes are designed as an aid not a substitute for revision. A lot of proofs have not been included because you should have them in your notes, should you need them. Also,

More information

MA554 Assessment 1 Cosets and Lagrange s theorem

MA554 Assessment 1 Cosets and Lagrange s theorem MA554 Assessment 1 Cosets and Lagrange s theorem These are notes on cosets and Lagrange s theorem; they go over some material from the lectures again, and they have some new material it is all examinable,

More information

Modern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

Modern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1 2 3 style total Math 415 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. Every group of order 6

More information

Math 430 Exam 2, Fall 2008

Math 430 Exam 2, Fall 2008 Do not distribute. IIT Dept. Applied Mathematics, February 16, 2009 1 PRINT Last name: Signature: First name: Student ID: Math 430 Exam 2, Fall 2008 These theorems may be cited at any time during the test

More information

3. G. Groups, as men, will be known by their actions. - Guillermo Moreno

3. G. Groups, as men, will be known by their actions. - Guillermo Moreno 3.1. The denition. 3. G Groups, as men, will be known by their actions. - Guillermo Moreno D 3.1. An action of a group G on a set X is a function from : G X! X such that the following hold for all g, h

More information

MATH 3005 ABSTRACT ALGEBRA I FINAL SOLUTION

MATH 3005 ABSTRACT ALGEBRA I FINAL SOLUTION MATH 3005 ABSTRACT ALGEBRA I FINAL SOLUTION SPRING 2014 - MOON Write your answer neatly and show steps. Any electronic devices including calculators, cell phones are not allowed. (1) Write the definition.

More information

ABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY

ABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY ABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY John A. Beachy Northern Illinois University 2000 ii J.A.Beachy This is a supplement to Abstract Algebra, Second Edition by John A. Beachy and

More information

Homework 7 Solution Chapter 7 - Cosets and Lagrange s theorem. due: Oct. 31.

Homework 7 Solution Chapter 7 - Cosets and Lagrange s theorem. due: Oct. 31. Homework 7 Solution Chapter 7 - Cosets and Lagrange s theorem. due: Oct. 31. 1. Find all left cosets of K in G. (a) G = Z, K = 4. K = {4m m Z}, 1 + K = {4m + 1 m Z}, 2 + K = {4m + 2 m Z}, 3 + K = {4m +

More information

Lecture 4: Orbits. Rajat Mittal. IIT Kanpur

Lecture 4: Orbits. Rajat Mittal. IIT Kanpur Lecture 4: Orbits Rajat Mittal IIT Kanpur In the beginning of the course we asked a question. How many different necklaces can we form using 2 black beads and 10 white beads? In the question, the numbers

More information

HOMEWORK Graduate Abstract Algebra I May 2, 2004

HOMEWORK Graduate Abstract Algebra I May 2, 2004 Math 5331 Sec 121 Spring 2004, UT Arlington HOMEWORK Graduate Abstract Algebra I May 2, 2004 The required text is Algebra, by Thomas W. Hungerford, Graduate Texts in Mathematics, Vol 73, Springer. (it

More information

Normal Subgroups and Quotient Groups

Normal Subgroups and Quotient Groups Normal Subgroups and Quotient Groups 3-20-2014 A subgroup H < G is normal if ghg 1 H for all g G. Notation: H G. Every subgroup of an abelian group is normal. Every subgroup of index 2 is normal. If H

More information

Examples: The (left or right) cosets of the subgroup H = 11 in U(30) = {1, 7, 11, 13, 17, 19, 23, 29} are

Examples: The (left or right) cosets of the subgroup H = 11 in U(30) = {1, 7, 11, 13, 17, 19, 23, 29} are Cosets Let H be a subset of the group G. (Usually, H is chosen to be a subgroup of G.) If a G, then we denote by ah the subset {ah h H}, the left coset of H containing a. Similarly, Ha = {ha h H} is the

More information

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a. Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms

More information

How to count - an exposition of Polya s theory of enumeration

How to count - an exposition of Polya s theory of enumeration How to count - an exposition of Polya s theory of enumeration Shriya Anand Published in Resonance, September 2002 P.19-35. Shriya Anand is a BA Honours Mathematics III year student from St. Stephens College,

More information

Midterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5

Midterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5 Department of Mathematical Sciences Instructor: Daiva Pucinskaite Modern Algebra June 22, 2017 Midterm Exam There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of

More information

Group Theory

Group Theory Group Theory 2014 2015 Solutions to the exam of 4 November 2014 13 November 2014 Question 1 (a) For every number n in the set {1, 2,..., 2013} there is exactly one transposition (n n + 1) in σ, so σ is

More information

MA441: Algebraic Structures I. Lecture 26

MA441: Algebraic Structures I. Lecture 26 MA441: Algebraic Structures I Lecture 26 10 December 2003 1 (page 179) Example 13: A 4 has no subgroup of order 6. BWOC, suppose H < A 4 has order 6. Then H A 4, since it has index 2. Thus A 4 /H has order

More information

Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems

Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)

More information

MA441: Algebraic Structures I. Lecture 18

MA441: Algebraic Structures I. Lecture 18 MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :

More information

Course 311: Abstract Algebra Academic year

Course 311: Abstract Algebra Academic year Course 311: Abstract Algebra Academic year 2007-08 D. R. Wilkins Copyright c David R. Wilkins 1997 2007 Contents 1 Topics in Group Theory 1 1.1 Groups............................... 1 1.2 Examples of Groups.......................

More information

Two subgroups and semi-direct products

Two subgroups and semi-direct products Two subgroups and semi-direct products 1 First remarks Throughout, we shall keep the following notation: G is a group, written multiplicatively, and H and K are two subgroups of G. We define the subset

More information

Section 19 Integral domains

Section 19 Integral domains Section 19 Integral domains Instructor: Yifan Yang Spring 2007 Observation and motivation There are rings in which ab = 0 implies a = 0 or b = 0 For examples, Z, Q, R, C, and Z[x] are all such rings There

More information

Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications

Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications 1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the

More information

Cosets. gh = {gh h H}. Hg = {hg h H}.

Cosets. gh = {gh h H}. Hg = {hg h H}. Cosets 10-4-2006 If H is a subgroup of a group G, a left coset of H in G is a subset of the form gh = {gh h H}. A right coset of H in G is a subset of the form Hg = {hg h H}. The collection of left cosets

More information

Math 430 Final Exam, Fall 2008

Math 430 Final Exam, Fall 2008 IIT Dept. Applied Mathematics, December 9, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 430 Final Exam, Fall 2008 Grades should be posted Friday 12/12. Have a good break, and don t forget

More information

List of topics for the preliminary exam in algebra

List of topics for the preliminary exam in algebra List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.

More information

HW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below).

HW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below). Teddy Einstein Math 430 HW Solutions Problem 1:. Find the sign and inverse of the permutation shown in the book (and below). Proof. Its disjoint cycle decomposition is: (19)(8)(37)(46) which immediately

More information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon

More information

SCHOOL OF DISTANCE EDUCATION

SCHOOL OF DISTANCE EDUCATION SCHOOL OF DISTANCE EDUCATION B. Sc. MATHEMATICS MM5B06: ABSTRACT ALGEBRA (Core Course) FIFTH SEMESTER STUDY NOTES Prepared by: Vinod Kumar P. Assistant Professor P. G.Department of Mathematics T. M. Government

More information

The following results are from the review sheet for the midterm.

The following results are from the review sheet for the midterm. A. Miller M542 Galois Theory Spring 2000 For the material on Galois theory we will be assuming that the fields all have characteristic zero. When we get to solvability by radicals we will assume that all

More information

FROM GROUPS TO GALOIS Amin Witno

FROM GROUPS TO GALOIS Amin Witno WON Series in Discrete Mathematics and Modern Algebra Volume 6 FROM GROUPS TO GALOIS Amin Witno These notes 1 have been prepared for the students at Philadelphia University (Jordan) who are taking the

More information

Chapter 16 MSM2P2 Symmetry And Groups

Chapter 16 MSM2P2 Symmetry And Groups Chapter 16 MSM2P2 Symmetry And Groups 16.1 Symmetry 16.1.1 Symmetries Of The Square Definition 1 A symmetry is a function from an object to itself such that for any two points a and b in the object, the

More information

Kevin James. p-groups, Nilpotent groups and Solvable groups

Kevin James. p-groups, Nilpotent groups and Solvable groups p-groups, Nilpotent groups and Solvable groups Definition A maximal subgroup of a group G is a proper subgroup M G such that there are no subgroups H with M < H < G. Definition A maximal subgroup of a

More information

Introduction to Groups

Introduction to Groups Introduction to Groups Hong-Jian Lai August 2000 1. Basic Concepts and Facts (1.1) A semigroup is an ordered pair (G, ) where G is a nonempty set and is a binary operation on G satisfying: (G1) a (b c)

More information

Written Homework # 2 Solution

Written Homework # 2 Solution Math 516 Fall 2006 Radford Written Homework # 2 Solution 10/09/06 Let G be a non-empty set with binary operation. For non-empty subsets S, T G we define the product of the sets S and T by If S = {s} is

More information

Higher Algebra Lecture Notes

Higher Algebra Lecture Notes Higher Algebra Lecture Notes October 2010 Gerald Höhn Department of Mathematics Kansas State University 138 Cardwell Hall Manhattan, KS 66506-2602 USA gerald@math.ksu.edu This are the notes for my lecture

More information

Modern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati

Modern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati Modern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati Shyamashree Upadhyay Contents 1 Lecture 1 4 1.1 Properties of Integers....................... 4 1.2 Sets, relations and

More information

Math 4320 Final Exam

Math 4320 Final Exam Math 4320 Final Exam 2:00pm 4:30pm, Friday 18th May 2012 Symmetry, as wide or as narrow as you may define its meaning, is one idea by which man through the ages has tried to comprehend and create order,

More information

Algebraic Structures Exam File Fall 2013 Exam #1

Algebraic Structures Exam File Fall 2013 Exam #1 Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write

More information

Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009

Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Directions: Solve 10 of the following problems. Mark which of the problems are to be graded. Without clear indication which problems are to be graded

More information

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2006 2 This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair ISBN 1 57766

More information

5 Group theory. 5.1 Binary operations

5 Group theory. 5.1 Binary operations 5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1

More information

Introduction to finite fields

Introduction to finite fields Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in

More information

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2000 ii This is a supplement to Abstract Algebra, Second Edition by John A. Beachy and William D. Blair ISBN 0

More information

Algebra Exam, Spring 2017

Algebra Exam, Spring 2017 Algebra Exam, Spring 2017 There are 5 problems, some with several parts. Easier parts count for less than harder ones, but each part counts. Each part may be assumed in later parts and problems. Unjustified

More information

Algebra. Travis Dirle. December 4, 2016

Algebra. Travis Dirle. December 4, 2016 Abstract Algebra 2 Algebra Travis Dirle December 4, 2016 2 Contents 1 Groups 1 1.1 Semigroups, Monoids and Groups................ 1 1.2 Homomorphisms and Subgroups................. 2 1.3 Cyclic Groups...........................

More information