Midterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5
|
|
- Alfred Bradford
- 5 years ago
- Views:
Transcription
1 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 your work! Best 5
2 1. Prove that the set R with the operation given by is an abelian group. Recall: A set G with an operation is called a group if: x y = x + y (a b) c = a (b c) for all a, b, c G, i.e. is associative, 2 in G exists (unique element) e having the property a e = e a = a for all a G; this element is called the identity element, 3 for each element a G there exists an element a 1 G with the property a a 1 = a 1 a = e; the element a 1 is called the inverse element of a. A group G, is called abelian if a b = b a for all a, b G. We have to prove that R with satisfies 1, 2, 3 and a b = b a for all a, b R. 1 Let a, b, c R, then (a b) c = (a + b + 37) c = a + b c + 37 = a + b + c + 74 We have and a + b + c + 74 (a b) c for all a, b, c R. Therefore is associative. a (b c) = a (b + c + 37) = a + b + c = a + b + c + 74 = a + b + c + 74 a (b c) 2 If there is an element e R, such that e a = a for all a R, then e a = e + a + 37 = a e = 37 Since for any a R, we have e a = e + a + 37 = a if e = 37, the real number e = 37 is the identity element in R, w.r.t.. 3 Let a R. If there is an element b R, such that b a = e = 37, then Obviously 74 a R for each a R, and ( 74 a) + a + 37 b a b a = b + a + 37 = 37 b + a = 74 b = 74 a = a + ( 74 + a) + 37 = 37 = e a b for each a R. Thus a 1 = 74 a is the inverse element of a for each a R w.r.t. ( ) Let a, b R, then a b = a + b + 37 = b + a + 37 = b a. Thus R with is an abelian group.
3 2. Prove that the set of integers that are multiples of 9 is a subgroup of the set of integers under addition, i.e. H = {9 z : z Z = {..., 27, 18, 9, 0, 9, 18, 27,... is a subgroup of Z, +. A non-empty subset H of a group G, is called a subgroup if I. H is closed under, i.e. for any two elements a, b from H, the element a b is in H. II. H is closed with respect to inverses, i.e. if a is in H, then a 1 have to be in H. Since 9 1 = 9 H implies that H is not a non-empty set, we have to prove that H satisfies I. and II, w.r.t. +. I. Let a and b be some elements from H, i.e. a = 9 x and b = 9 y for some x, y Z. (In order to show that a + b H, we have to show, a + b = 9 z for some z Z) a + b = 9 x + 9 y = 9 (x + y) (since x, y Z, we have z = x + y Z) = 9 z for z = x + y Therefore a + b H for all a, b H. Thus H is closed under +. II. Let a be some element from H, i.e. a = 9 x for some x Z. (In order to show that a 1 H, we have to show, a H, because the identity element in Z w.r.t. + is e = 0, and the inverse element of a w.r.t. + is a) a = 9 x = 9 ( x) (since x Z, we have x Z) = 9 z for z = x Therefore a 1 = a H for all a H. Therefore H is closed with respect to inverses. [That is what we needed to show]
4 3. Consider the cycles α = (1, 5, 4, 6) and β = (2, 5, 1) in S 6. a. Write α 2 β 1 as a product of disjoint cycles. α 2 β 1 = (1, 5, 4, 6) (1, 5, 4, 6) (1, 5, 2) = = (1, 6, 5, 2, 4) ( b. Express α 2 β 1 as a product of transpositions of the form (3, 1), (3, 2), (3, 4), (3, 5), (3, 6). ) Recall. Consider S n: (1) Any cycle in S n is a product of transpositions: (a 1, a 2,..., a m 1, a m) = (a 1, a m) (a 1, a m 1) (a 1, a 2). (2) If a 3 and b 3, then the transposition (a, b) in S n is a product of transpositions of the form (3, i) where i {1,..., n: (a, b) = (3, a) (3, b) (3, a). (3) For all transpositions we have (x, y) (x, y) = (identity of S n). α 2 β 1 b. = (1, 6, 5, 2, 4) (1) = (1, 4) (1, 2) (1, 5) (1, 6) (2) = (3, 1) (3, 4) (3, 1) (3, 1) (3, 2) (3, 1) (3, 1) (3, 5) (3, 1) (3, 1) (3, 6) (3, 1) (1,4) (1,2) (1,5) (1,6) (3) = (3, 1) (3, 4) (3, 2) (3, 5) (3, 6) (3, 1) c. Give an explanation for the statement The group S 6, is generated by transpositions (3, 1), (3, 2), (3, 4), (3, 5), (3, 6). (In order to explain that The group S 6, is generated by (3, 1), (3, 2), (3, 4), (3, 5), (3, 6), we have to bring forward the argument that (3, 1), (3, 2), (3, 4), (3, 5), (3, 6) are elements in S 6 (that s obvious), and that each permutation in S 6 can be written as a product of some transpositions of the form (3, 1), (3, 2), (3, 4), (3, 5), (3, 6).) Let f be some permutation in S 6. If f is the identity in S 6, then f = (3, 1) (3, 1), thus f is product of transpositions of the form we wish. If f is not the identity, then f can be written as a product of disjoint cycles. Each cycle can be written as a product of transpositions (for example in sense of (1)). ( ) If for a transpositions (a, b) in each of those cycles we have a 3 and b 3, then (a, b) = (3, a) (3, b) (3, a), i.e. (a, b) can be written as a product of transpositions having form we wish. ( ) If for a transpositions (a, b) in each of those cycles we have a = 3 or b = 3, then the transposition (a, b) is already of the form (3, i) (if a = 3, then (a, b) = (3, b), and if b = 3, then (a, b) = (a, 3) = (3, a)).
5 Therefore each cycle can be written as a product of transpositions having form (3, i). Here symbolic representation: (permutation) = ( cycle ) 1 product of transpositions (3, ) ( cycle ) 2 product of transpositions (3, ) Consequently each permutation is a product of some transpositions of the form (3, 1), (3, 2), (3, 4), (3, 5), (3, 6). ( cycle ) m product of transpositions (3, )
6 4. Let, and be the operations on G defined by the operation tables e b c d f g e e b c d f g b b c d f g e c c d f g e b d d f g e b c f f g e b c d g g e b c d f and G, is an abelian group, and G, is non-abelian group a. Show that G, is generated by b, i.e. b = G w.r.t.. The subgroup of G w.r.t.. generated by b is b = b, b2, b 3 c d, b 4 e b c d f g e e b c d f g b b e g f d c c c d e b g f d d c f g b e f f g d c e b g g f b e c d, b 5, b 6 f g e Since each element of G, is a power of b, the group G, is generated by b. b. Show that b is not the only element which generates G,. The subgroup of G w.r.t.. generated by g is g = g, g2, g 3 f d, g 4 c, g 6 b e, g 5 Since each element of G, is a power of g, the group G, is generated by g. Thus g is the second element in G, that generates G,. c. Show that b does not generate G,. Since b b = e, we have b n = e if n is even, and b n = b if n is odd w.r.t.. Thus there is no n such that b n = c, therefore b G w.r.t.. d. Find two elements which generate G,. The elements b and c generate G, because b, c = e, b, c, d b b b c c b, f b c b, g = G i.e. each element in G can be written in some way as a product of some powers of b and c w.r.t.. b c
7 5. Let G, be a group, and a G. Show that the function is bijective. f : G G given by f(x) = a x Recall: A function F : G G is bijective, if F is injective and F is surjective. (i) F is injective, if for all g, g G the equation F (g) = F ( g) is true only if g = g. (s) F is surjective if for each g G there exists c G such that F (c) = g. Proof for f is bijective: (i) f is injective: Let g and g be some elements in G, such that f(g) = f( g). f(g) = f( g) a g f(g) = a g f( g) a 1 (a g) = a 1 (a g) where a 1 is the inverse element of a (a 1 a) g = (a 1 a) g (the associativity of ) (a 1 a) g = (a 1 a) g (the property of the identity element e) e e g = g. Since f(g) = f( g) implies g = g the function f is injective. (s) f is surjective: Let g G, then for some x G we have f(x) = g if f(x) = g a x = g f(x) a 1 (a x) = a 1 g (a 1 a) x = a 1 g e x = a 1 g x = a 1 g Since x = a 1 g G, and f(a 1 g) = a (a 1 g) = (a a 1 ) g = e g = g for every g G, we have that f is surjective. The function f : G G given by f(g) = a g is bijective, because it is injective and surjective.
8 5. Let G, be a group, and g G. (a) What it means when we write ord(g) = 1 234? This means that g i = g g g i times where e is the identity element in G. e for any i {1, 2, 3,..., 1 233, and g = g g g = e, times (b) Let ord(g) = 1 234, and G = g. Prove: If m divides 1 234, then there exists an element in G having order m. Since ord(g) = 1 234, and G = g we have G = g = {e, g, g 2, g 3,..., g i,..., g with g i e for all i {1, 2, 3,..., If m divides 1 234, then m = n is a natural number, and 1 n Thus G = g = {e, g, g 2, g 3,..., g n 1, g n, g n+1,..., g We will prove ord(g n ) = m. Thus we have to show: For each j {1, 2,..., m 1 we have (g n ) j = g n g n g n j times e, and (g n ) m = g n g n g {{ n = e m times If 1 j m 1, then 1 n j < 1 234, because n j = m Therefore j = j m and 0 < j m < 1. (g n ) j = g n g n g {{ n = g n j e, because g i e for any 1 i < j times Furthermore (g n ) m = g n g n g {{ n = g n m = g m m = g = e, since ord(g) = m times This is what we needed to show. (c) For each divisor d of 8 find an element in Z 8 of order d. The group Z 8, + is generated by 1, i.e. Z 8 = 0, 1, 2, 3, 4, 5, 6, The divisors of 8 are m 1 = 1, m 2 = 2, m 3 = 4, m 4 = 8. Thus ( ) ord(1 8 1 ) = ord(8) = ord(0) = 1 = m 1, because 0 is the identity element in Z 8, + ( ) ord(1 8 2 ) = ord(1 4 ) = ord(4) = 2 = m 2, because 4 0, and 4 2 = 8 = 0 ( ) ord(1 8 4 ) = ord(1 2 ) = ord(2) = 4 = m 3, because 2 0, 2 2 = 4 0, 2 3 = 6 0, and 2 4 = 8 = 0 ( ) ord(1 8 8 ) = ord(1) = 8 = m 4, because 1 i = i 0, for all i {1,..., 7 and 1 8 = 8 = 0.
9 6. Consider the group Z 49, +, and m Z 49 (a) Show: If gcd(49, m) = 1, then ord(m) = We will show: If m x = 49 y for some x, y N, with x 49, then x = 49, and y = m. Fundamental theorem of arithmetic (FTA). Every positive integer n > 1 can be represented in exactly one way as a product of prime numbers (up to order of the prime numbers). (Thus if p 1p 2 p r n = q 1q 2 q r n then for any j there is some i such that q j = p i.) and p 1, p 2,..., p r, q 1, q 2,..., q r are prime numbers, Since gcd(49, m) = 1, and 49 = 7 7, we have that in the prime decomposition m = p 1 p 2 p l (here p 1, p 2,... p l are prime numbers), p i 7 for all i (otherwise gcd(49, m) 1). If m x = 49 y, i.e. p 1 p 2 p l x m x = 7 7 y 49 y we should have x = 7 7 (natural number), because in the prime decomposition of the number m x we have p 1 p 2 p l x = 7 7 (prime decomposition of y). m x 49 y Since we are looking for x 49, we have that x = 7 7 (natural number) 49 if (natural number) = 1, thus x = 7 7 = 49 (and therefore m 49 = 49 y when y = m). 2. We will show: ord(m) 49. Since ord(m) = r is the smallest positive integer with the property m r = m + m + {{ + m = 0 r times and m 49 = m + m + {{ + m = 49 m = {{ = {{ + 0 = 0, 49 times m times m times we have that r should be less or equal to 49, i.e. r = ord(m) We will show: ord(m) = r = 49. If i = 0 in Z 49, then i = 49 y for any y Z. Since m r = m + {{ + m = 0, we have r times m r = 49 y Since r 49 (see 2.), and by the assumption gcd(49, m) = 1, the part 1. implies that the equation m r = 49 y is true if r = 49.
10 (b) Determine all subgroups of Z 49. (You can use the fact that every subgroup of a cyclic group is cyclic) Since Z 49 is cyclic, every subgroup of Z 49 is generated by some element in Z 49. Thus the set of subgroups Sub(Z 49 ) is Sub(Z 49 ) = { 0, 1, 2,..., 48 Since gcd(49, n) 1 only if n = 7 (natural number), we have gcd(49, m) = 1 for any m {1, 2,..., 48 such that m 7, 14, 21, 28, 35, 42. Thus ord(m) = 49 for all m {1, 2,..., 48 with m 7, 14, 21, 28, 35, 42. Therefore the subgroup of Z 49 generated by m has 49 elements. Since m is a subset of Z 49, and Z 49 has 49 elements we have m = Z 49 for all m {1, 2,..., 48 with m 7, 14, 21, 28, 35, 42. { Since 7 = 7, 7 2, has 7 elements, and 7 is a prime number, =0 we have that each non-identity element in 7 generates 7. Therefore 7 = 14 = 21 = 28 = 35 = 42 Thus Z 49 has three subgroups Sub(Z 49 ) = { 0, 1, 7. Moreover, (c) Draw the subgroup diagram.
n = p 1 p 2 p r = q 1 q 2 q m, then r = m (i.e. the number of primes in any prime decomposition
Department of Mathematical Sciences Instructor: Daiva Pucinskaite Discrete Mathematics Factoring Recall. Fundamental Theorem of Arithmetic. Let n be a positive integer n > 1. Then n can be represented
More informationMath 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 informationName: 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 informationDefinitions. 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 information0 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 informationProf. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.
1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and
More informationFoundations 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 information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationModern Computer Algebra
Modern Computer Algebra Exercises to Chapter 25: Fundamental concepts 11 May 1999 JOACHIM VON ZUR GATHEN and JÜRGEN GERHARD Universität Paderborn 25.1 Show that any subgroup of a group G contains the neutral
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationFall /29/18 Time Limit: 75 Minutes
Math 411: Abstract Algebra Fall 2018 Midterm 10/29/18 Time Limit: 75 Minutes Name (Print): Solutions JHU-ID: This exam contains 8 pages (including this cover page) and 6 problems. Check to see if any pages
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2018
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2018 1. Please write your 1- or 2-digit exam number on
More informationGroup 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 informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More informationSupplement. 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 information6 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 informationMath 116 First Midterm October 17, 2014
Math 116 First Midterm October 17, 2014 Name: Instructor: Section: 1. Do not open this exam until you are told to do so. 2. This exam has 9 pages including this cover AND IS DOUBLE SIDED. There are 9 problems.
More informationMath 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 information2) 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 informationCIS 375 Intro to Discrete Mathematics Exam 3 (Section M004: Blue) 6 December Points Possible
Name: CIS 375 Intro to Discrete Mathematics Exam 3 (Section M004: Blue) 6 December 2016 Question Points Possible Points Received 1 12 2 14 3 14 4 12 5 16 6 16 7 16 Total 100 Instructions: 1. This exam
More informationSolutions to Homework Problems
Solutions to Homework Problems November 11, 2017 1 Problems II: Sets and Functions (Page 117-118) 11. Give a proof or a counterexample of the following statements: (vi) x R, y R, xy 0; (x) ( x R, y R,
More informationAbstract Algebra FINAL EXAM May 23, Name: R. Hammack Score:
Abstract Algebra FINAL EXAM May 23, 2003 Name: R. Hammack Score: Directions: Please answer the questions in the space provided. To get full credit you must show all of your work. Use of calculators and
More informationCIS 375 Intro to Discrete Mathematics Exam 3 (Section M001: Green) 6 December Points Possible
Name: CIS 375 Intro to Discrete Mathematics Exam 3 (Section M001: Green) 6 December 2016 Question Points Possible Points Received 1 12 2 14 3 14 4 12 5 16 6 16 7 16 Total 100 Instructions: 1. This exam
More information120A 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 informationSection 7.2: One-to-One, Onto and Inverse Functions
Section 7.2: One-to-One, Onto and Inverse Functions In this section we shall developed the elementary notions of one-to-one, onto and inverse functions, similar to that developed in a basic algebra course.
More informationMath 4400, Spring 08, Sample problems Final Exam.
Math 4400, Spring 08, Sample problems Final Exam. 1. Groups (1) (a) Let a be an element of a group G. Define the notions of exponent of a and period of a. (b) Suppose a has a finite period. Prove that
More informationNumber Theory and Group Theoryfor Public-Key Cryptography
Number Theory and Group Theory for Public-Key Cryptography TDA352, DIT250 Wissam Aoudi Chalmers University of Technology November 21, 2017 Wissam Aoudi Number Theory and Group Theoryfor Public-Key Cryptography
More informationExam 1. (2x + 1) 2 9. lim. (rearranging) (x 1 implies x 1, thus x 1 0
Department of Mathematical Sciences Instructor: Daiva Pucinskaite Calculus I January 28, 2016 Name: Exam 1 1. Evaluate the it x 1 (2x + 1) 2 9. x 1 (2x + 1) 2 9 4x 2 + 4x + 1 9 = 4x 2 + 4x 8 = 4(x 1)(x
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationModern 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 informationGroup. Orders. Review. Orders: example. Subgroups. Theorem: Let x be an element of G. The order of x divides the order of G
Victor Adamchik Danny Sleator Great Theoretical Ideas In Computer Science Algebraic Structures: Group Theory II CS 15-251 Spring 2010 Lecture 17 Mar. 17, 2010 Carnegie Mellon University Group A group G
More informationEXAM 3 MAT 423 Modern Algebra I Fall c d a + c (b + d) d c ad + bc ac bd
EXAM 3 MAT 23 Modern Algebra I Fall 201 Name: Section: I All answers must include either supporting work or an explanation of your reasoning. MPORTANT: These elements are considered main part of the answer
More informationAlgebraic 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 informationName: 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 informationINTRODUCTION 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 informationStab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1.
1. Group Theory II In this section we consider groups operating on sets. This is not particularly new. For example, the permutation group S n acts on the subset N n = {1, 2,...,n} of N. Also the group
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationName: Solutions Final Exam
Instructions. Answer each of the questions on your own paper, and 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] For
More informationABOUT THE CLASS AND NOTES ON SET THEORY
ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:
More informationMath 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets
Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets Introduction In this short article, we will describe some basic notions on cardinality of sets. Given two
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More informationMTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1
MTH 310, Section 001 Abstract Algebra I and Number Theory Sample Midterm 1 Instructions: You have 50 minutes to complete the exam. There are five problems, worth a total of fifty points. You may not use
More informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups
D-MATH Algebra I HS 2013 Prof. Brent Doran Solution 3 Modular arithmetic, quotients, product groups 1. Show that the functions f = 1/x, g = (x 1)/x generate a group of functions, the law of composition
More informationKevin James. MTHSC 412 Section 3.4 Cyclic Groups
MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is
More informationDefinition 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 informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationSection 4.4 Functions. CS 130 Discrete Structures
Section 4.4 Functions CS 130 Discrete Structures Function Definitions Let S and T be sets. A function f from S to T, f: S T, is a subset of S x T where each member of S appears exactly once as the first
More information(a) We need to prove that is reflexive, symmetric and transitive. 2b + a = 3a + 3b (2a + b) = 3a + 3b 3k = 3(a + b k)
MATH 111 Optional Exam 3 lutions 1. (0 pts) We define a relation on Z as follows: a b if a + b is divisible by 3. (a) (1 pts) Prove that is an equivalence relation. (b) (8 pts) Determine all equivalence
More informationJohns Hopkins University, Department of Mathematics Abstract Algebra - Spring 2013 Midterm Exam Solution
Johns Hopkins University, Department of Mathematics 110.40 Abstract Algebra - Spring 013 Midterm Exam Solution Instructions: This exam has 6 pages. No calculators, books or notes allowed. You must answer
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationYALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Cryptography and Computer Security Notes 13 (rev. 2) Professor M. J. Fischer October 22, 2008 53 Chinese Remainder Theorem Lecture Notes 13 We
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationMATH 3330 ABSTRACT ALGEBRA SPRING Definition. A statement is a declarative sentence that is either true or false.
MATH 3330 ABSTRACT ALGEBRA SPRING 2014 TANYA CHEN Dr. Gordon Heier Tuesday January 14, 2014 The Basics of Logic (Appendix) Definition. A statement is a declarative sentence that is either true or false.
More informationDefinition 1.2. Let G be an arbitrary group and g an element of G.
1. Group Theory I Section 2.2 We list some consequences of Lagrange s Theorem for exponents and orders of elements which will be used later, especially in 2.6. Definition 1.1. Let G be an arbitrary group
More informationAlgebra Exercises in group theory
Algebra 3 2010 Exercises in group theory February 2010 Exercise 1*: Discuss the Exercises in the sections 1.1-1.3 in Chapter I of the notes. Exercise 2: Show that an infinite group G has to contain a non-trivial
More informationHomework #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 informationS11MTH 3175 Group Theory (Prof.Todorov) Final (Practice Some Solutions) 2 BASIC PROPERTIES
S11MTH 3175 Group Theory (Prof.Todorov) Final (Practice Some Solutions) 2 BASIC PROPERTIES 1 Some Definitions For your convenience, we recall some of the definitions: A group G is called simple if it has
More informationWeek Some Warm-up Questions
1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after
More informationList 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 informationAbstract Algebra, HW6 Solutions. Chapter 5
Abstract Algebra, HW6 Solutions Chapter 5 6 We note that lcm(3,5)15 So, we need to come up with two disjoint cycles of lengths 3 and 5 The obvious choices are (13) and (45678) So if we consider the element
More informationREVIEW FOR THIRD 3200 MIDTERM
REVIEW FOR THIRD 3200 MIDTERM PETE L. CLARK 1) Show that for all integers n 2 we have 1 3 +... + (n 1) 3 < 1 n < 1 3 +... + n 3. Solution: We go by induction on n. Base Case (n = 2): We have (2 1) 3 =
More informationMath 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 informationOne side of each sheet is blank and may be used as scratch paper.
Math 301 Fall 2017 (Practice) Midterm Exam 1 10/3/2017 Time Limit: 1 hour and 15 minutes Name: One side of each sheet is blank and may be used as scratch paper. Show your work clearly. Grade Table (for
More informationChapter 4 Mathematics of Cryptography
Chapter 4 Mathematics of Cryptography Part II: Algebraic Structures Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4.1 Chapter 4 Objectives To review the concept
More informationGALOIS THEORY : LECTURE 4 LEO GOLDMAKHER
GALOIS THEORY : LECTURE 4 LEO GOLDMAKHER 1. A BRIEF REVIEW OF S n The rest of the lecture relies on familiarity with the symmetric group of n elements, denoted S n (this is the group of all permutations
More informationReview Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which
Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)
More informationMATH 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 informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationLET n 3 be an integer, recall that (Z/nZ) denotes
Group of Square Roots of Unity Modulo n Rochdi Omami, Mohamed Omami and Raouf Ouni Digital Open Science Index, Mathematical and Computational Sciences waset.org/publication/8554 Abstract Let n 3 be an
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationMath 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours
Math 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours Name: Please read the questions carefully. You will not be given partial credit on the basis of having misunderstood a question, and please
More informationJanuary 2016 Qualifying Examination
January 2016 Qualifying Examination If you have any difficulty with the wording of the following problems please contact the supervisor immediately. All persons responsible for these problems, in principle,
More informationProblem 1. Let I and J be ideals in a ring commutative ring R with 1 R. Recall
I. Take-Home Portion: Math 350 Final Exam Due by 5:00pm on Tues. 5/12/15 No resources/devices other than our class textbook and class notes/handouts may be used. You must work alone. Choose any 5 problems
More informationWhat is a semigroup? What is a group? What is the difference between a semigroup and a group?
The second exam will be on Thursday, July 5, 2012. 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
More informationMATH 13 SAMPLE FINAL EXAM SOLUTIONS
MATH 13 SAMPLE FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers.
More informationMath 430 Exam 1, Fall 2006
c IIT Dept. Applied Mathematics, October 21, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 430 Exam 1, Fall 2006 These theorems may be cited at any time during the test by stating By
More informationREMARKS 7.6: Let G be a finite group of order n. Then Lagrange's theorem shows that the order of every subgroup of G divides n; equivalently, if k is
FIRST-YEAR GROUP THEORY 7 LAGRANGE'S THEOREM EXAMPLE 7.1: Set G = D 3, where the elements of G are denoted as usual by e, a, a 2, b, ab, a 2 b. Let H be the cyclic subgroup of G generated by b; because
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationMath 3140 Fall 2012 Assignment #4
Math 3140 Fall 2012 Assignment #4 Due Fri., Sept. 28. Remember to cite your sources, including the people you talk to. In this problem set, we use the notation gcd {a, b} for the greatest common divisor
More informationMath 127 Homework. Mary Radcliffe. Due 29 March Complete the following problems. Fully justify each response.
Math 17 Homework Mary Radcliffe Due 9 March 018 Complete the following problems Fully justify each response NOTE: due to the Spring Break, this homework set is a bit longer than is typical You only need
More informationMAT1100HF ALGEBRA: ASSIGNMENT II. Contents 1. Problem Problem Problem Problem Problem Problem
MAT1100HF ALEBRA: ASSINMENT II J.A. MRACEK 998055704 DEPARTMENT OF MATHEMATICS UNIVERSITY OF TORONTO Contents 1. Problem 1 1 2. Problem 2 2 3. Problem 3 2 4. Problem 4 3 5. Problem 5 3 6. Problem 6 3 7.
More information6 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 informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationMATH 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 informationAttempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 SETS, NUMBERS AND PROBABILITY MTHA4001Y Time allowed: 2 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised
More informationBasic 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 informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationMath Fall 2014 Final Exam Solutions
Math 2001-003 Fall 2014 Final Exam Solutions Wednesday, December 17, 2014 Definition 1. The union of two sets X and Y is the set X Y consisting of all objects that are elements of X or of Y. The intersection
More informationElements of solution for Homework 5
Elements of solution for Homework 5 General remarks How to use the First Isomorphism Theorem A standard way to prove statements of the form G/H is isomorphic to Γ is to construct a homomorphism ϕ : G Γ
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on
More informationSolutions of Assignment 10 Basic Algebra I
Solutions of Assignment 10 Basic Algebra I November 25, 2004 Solution of the problem 1. Let a = m, bab 1 = n. Since (bab 1 ) m = (bab 1 )(bab 1 ) (bab 1 ) = ba m b 1 = b1b 1 = 1, we have n m. Conversely,
More informationON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul...,..., f... DOI: 10.2478/aicu-2013-0013 ON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS BY MARIUS TĂRNĂUCEANU and
More informationAlgebra 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