Test1. Due Friday, March 13, 2015.


 Irma Gregory
 5 years ago
 Views:
Transcription
1 1 Abstract Algebra Professor M. Zuker Test1. Due Friday, March 13, Euclidean algorithm and related. (a) Suppose that a and b are two positive integers and that gcd(a, b) = d. Find all solutions m and n to am bn = 0. Hint: Note that for each solution, am and bn are common multiples of a and b. am bn = 0 am = bn. Thus, am and bn are common multiples of a and b for every solution. Let l = lcm(a, b) = ab d. Then all common multiples of a and b are of the form kl, where k is any integer. If am = bn, then am = bn = kl for some k Z. This is equivalent to m = kb/d and n = ka/d. On the other hand, for any k Z, m = kb/d and n = ka/d satisfy am = bn = kl. Thus all solutions are m = kb/d and n = ka/d for k Z. (b) If am bn = d, find all solutions m and n to am bn = d. Hint: Note that a(m m) b(n n) = 0. If am bn = d and am bn = d, then by subtraction, a(m m) b(n n) = d d = 0, so M m and N n must be of the form kb/d and ka/d, respectively, where k Z. That is, m = M kb/d and n = N ka/d. In words, if am bn = d, then a(m + kb/d) b(n + ka/d) = d, so (M + kb/d, N + kb/d) is a solution for every k Z and all solutions are of this form. (c) Show that 1966 and 2017 are relatively prime and compute integers m and n such that 1966m n = = = = = = = = = so gcd(2017, 1966) = 1. A solution for m and n may be computed by backtracking in the above computation or by multiplying 2 2 matrices. Backtracking:
2 2 Abstract Algebra Professor M. Zuker 1 = = 3 1 (5 1 3) = = 2 (23 4 5) 1 5 = = ( ) = = 11 ( ) 9 28 = = ( ) = = 771 ( ) = = ( 791) Thus m = 791 and n = 771 is a solution. (d) Referring to (c) above, compute a solution where m > 0 and m is as small as possible and a solution where n > 0 and n is as small as possible. Hint: If you use the extended Euclidean algorithm, the solution you find will satisfy one of these conditions, so you need only compute a second solution. Any solution is of the form m = k and n = k. If k = 0, n is positive. The next smaller value of n is < 0, so ( 791, 771) is the solution with the smallest positive value for n. The next larger value of m is = 1226, for which n = = 1195, so (1226, 1195) is the solution with the smallest positive value for m. 2. True or false. (a) In the group Z m, if 0 a b < m, then a = b a = b. False. In fact, a = b gcd(a, m) = gcd(b, m). (b) If the least common multiple of two positive integers a and b equals a or b, then either a b or b a. True. ab/ gcd(a, b) = a gcd(a, b) = b, so b a. ab/ gcd(a, b) = b gcd(a, b) = a, so a b. (c) Suppose that gcd(a, b) = 1 for positive integers a and b. Then for any positive integers m and n, a m and b n are relatively prime. True. a = K i=i pk i i and b = L i=i ql i i, where each p i and each q i are distinct primes. We know that no p i equals some q i. Thus a m is a product of K distinct primes p i to higher powers and b n is a product of L distinct primes q i to higher powers. The primes remain distinct so gcd(a m, b n ) = 1.
3 3 Abstract Algebra Professor M. Zuker (d) For positive integers a, b and c, suppose that gcd(a, b) = 1 and that c ab. Then c = d 1 d 2 where d 1 a, d 2 b and gcd(d 1, d 2 ) = 1. True. a = K i=1 pk i i and b = L i=1 ql i i where the p i s and q i s are distinct primes. If d a, then d = d 1 d 2, where d 1 = K i=1 pk i i, 0 k i k i and d 2 = L i=1 ql i i, 0 l i l i. d 1 a, d 2 b and gcd(d 1, d 2 ) = 1. (e) If σ S n, then σ and σ 1 always have the same number of orbits. True. The inverse of a cycle (i 1, i 2,... i k ) is (i k, i k 1,... i 2, i 1 ), which is a cycle. σ(i) = i σ 1 (i) = i. Thus, σ and σ 1 have the same orbits. This is stronger than the same number of orbits. (f) If σ S n, then σ and σ 2 always have the same number of orbits. False. Counterexample. In S 4, σ = (1, 2, 3, 4) has one orbit, but σ 2 = (1, 3)(2, 4) has two orbits. (g) In D 5, let H = ρ 2, τρ 3. Then H = D 5. True Since gcd(2, 5) = gcd(1, 5) = 1, ρ = ρ 2, so H contains all powers of ρ. ρ 2 H and τρ 3 H implies that τρ 3 ρ 2 = τ H. Thus H contains ρ i and τρ i for 0 i < 5, so H = D 5. (h) If H and K are subgroups of G, then HK is a subgroup of G. False. If h 1, h 2 H and k 1, k 2 K, then there is no reason why (h 2 k 2 )(h 1 k 1 ) should equal h 3 k 3 for some h 3 H and k 3 K. Counterexample. In S 3, let H = {ι, (1, 2)} and let K = {ι, (1, 3)}. Then HK = {ι, (1, 2), (1, 3), (1, 3, 2)} However, (1, 2)(1, 3)(1, 2)(1, 3) = (1, 2, 3) / HK. (i) If H and K are normal subgroups of G, then HK is a subgroup of G. True. In fact, it s true if just one of H and K is normal. H normal implies that gh = Hg for all g G. In particular, kh = Hk for any k K. If h 1, h 2 H and k 1, k 2 K, then If h H and k K, (h 1 k 1 )(h 2 k 2 ) = h 1 (k 1 h 2 )k 2 = h 1 (h 3 k 1 )k 2 because H is normal. h 3 H = (h 1 h 3 )(k 1 k 2 ) HK. (hk) 1 = k 1 h 1 = h 1 k 1 because H is normal. h 1 H
4 4 Abstract Algebra Professor M. Zuker (j) If H and K are normal subgroups of G, then HK is a normal subgroup of G. True. HK is Normal if ghk = HKg for all g G. This is equivalent to ghkg 1 = HK for all g G. If ghkg 1 ghkg 1, then ghkg 1 = (gh)kg 1 = (h 1 g)kg 1 since H is normal = h 1 (gk)g 1 = h 1 (k 1 g)g 1 since K is normal = (h 1 k 1 )gg 1 = h 1 k 1 HK. In the above, h 1 H and k 1 K. To prove that HK is normal, we need H and K to be normal. 3. For each set G and binary operation, decide the following. Is G a group. If not, what properties fail? If so, is G Abelian? If it is Abelian, is it cyclic? (a) G = Q + and is ordinary multiplication. G is a noncyclic Abelian group. {[ ] } 1 n (b) G = n Z and is matrix multiplication. 0 1 by G is a cyclic group. In fact (G, ) (Z, +). If f : Z G is defined f(n) = [ 1 n 0 1 then f is an isomorphism. {[ ] } a b (c) G = a, b, c, d Z and ad bc = ±1 and is matrix multiplication. c d G is a nonabelian group (and cannot be cyclic, of course). (d) G = {a + b 3 R a, b Q} and is ordinary multiplication. Note that G excludes 0. G is a noncyclic Abelian group. The binary operation is welldefined, since a + b 3)(c + d 3) = (ac + 3bd) + (ad + bd) 3 G. (a + b 3)(a b 3) = a 2 3b 2. If a 2 3b 2 = 0, then a = 0 b = 0 and b = 0 a = 0. If ab 0, then 3 = a Q, which is false. Thus, a + b 3 = 0 b a = b = 0. Then (a + b 3) 1 = a b 3, where a = a and b = b. a 2 3b 2 a 2 3b 2 (e) G = {n Z 60 gcd(n, 60) = 1}. is addition. G is not a group. In fact, G is not even closed under addition, since gcd(7, 60) = gcd(13, 60) = 1, but gcd(7 + 13, 60) = gcd(20, 60) = 20. ],
5 5 Abstract Algebra Professor M. Zuker (f) G = {n Z 60 gcd(n, 60) = 1}. is multiplication. G is in fact an Abelian group. If m and n are both relatively prime to 60, then neither m nor n contain prime factors in common with 60. Thus, mn contains no prime factor in common with 60. is clearly commutative. If gcd(a, 60) = 1, then gcd(a n, 60) = 1 for all n 0 (see the appropriate true/false question above). If m is the smallest integer such that a m a h mod 60 for some h < m, then a m h 1 mod 60 = a 0, so h = 0. Thus a m 1 is the multiplicative inverse of a. G = ϕ(60) = ϕ(5)ϕ(3)ϕ(4) = = 16. G is not cyclic. In fact, the maximum order of any a G is Let σ = ( i σ(i) ) (a) Compute the decomposition of σ into disjoint cycles. σ = µ 1 µ 2 µ 3 µ 4, where µ 1 = (1, 16, 3, 4, 18, 20), µ 2 = (2, 13, 9, 8), µ 3 = (5, 6, 14, 17, 10) and µ 4 = (7, 19, 15, 11) (b) How many orbits does σ have. σ has 5 orbits. Each of the four disjoint cycles above comprise 19 of the 20 numbers between 1 and 12. σ(12) = 12, so {12} is the fifth orbit. (c) Is σ an even or an odd permutation? µ 1 is a 6cycle (odd), mu 2 is a 4cycle (odd), mu 3 is a 5cycle (even) and mu 4 is a 4cycle (odd). Thus, the sign of σ is ( 1)( 1)(1)( 1) = 1, so σ is odd. (d) Compute σ. µ 1, µ 2, µ 3 and µ 4 have orders 6, 4, 5 and 4, respectively. The least common multiple of these integers is the least common multiple of 4 and the least common multiple of 6 and 5, which is the least common multiple of 4 and 30, which is 60. Thus, σ = 60. (e) Compute the cycle decomposition of σ 2. Since the cycles permute disjoint sets of numbers, they commute. Thus, σ 2 = (µ 1 ) 2 (µ 2 ) 2 (µ 3 ) 2 (µ 4 ) 2. µ 2 1 = (1, 3, 18)(4, 20, 16) µ 2 2 = (2, 9)(8, 13) µ 2 3 = (5, 14, 10, 6, 17) µ 2 4 = (7, 15)(11, 19) Thus σ 2 = (1, 3, 18)(4, 20, 16)(2, 9)(8, 13)(5, 14, 10, 6, 17)(7, 15)(11, 19) (f) Let µ = (1, 13, 7, 18, 3, 20, 5, 11)(2, 15, 5, 9, 7, 1, 10, 19) Is µ even or odd. You must give a reason. µ is the product of two kcycles, so it is even. The fact that k = 8, making both cycles odd permutations, is not relevant.
6 6 Abstract Algebra Professor M. Zuker 5. In S n for n > 2, let H = {ι, (1, 2)}, where ι is the identity in S n and (1, 2) is a transposition. H is clearly a subgroup of S n. Prove that H is not a normal subgroup of S n. Hint: It suffices to find a single π S n such that πh Hπ. (1, 3)H = {(1, 3), (1, 3)(1, 2)} = {(1, 3), (1, 2, 3)} and H(1, 3) = {(1, 3), (1, 2)(1, 3)} = {(1, 3), (1, 3, 2)}. Since (1, 3)H H(1, 3), H is not normal. 6. A n and 3cycles. We know that 3cycles are even permutations. The object is to show that A n is generated by 3cycles. This problem is broken into parts to assist you. (a) In S 4, write the double transition (1, 2)(3, 4) as the product of two 3cycles. Hint: A 3cycle will leave one of the four numbers fixed. The hint is useful. Select the first 3cycle to place 1 into position 2. Select the second 3cycle to leave position 2 fixed and to place 2 into position 1. The first 3cycle can be σ 1 = (1, 2, 3). The second 3cycle σ 2 must satisfy (a) σ 2 (2) = 2 to keep position 2 fixed, and (b) σ 2 (3) = 1 to move 2 (which is in position 3 after σ 1 is applied) into position 1. That is, σ 2 = (3, 1, 4). There are choices for σ 1, but given σ 1, σ 2 is uniquely determined. Check: (3, 1, 4)(1, 2, 3) = (1, 2)(3, 4). It works! Of course, other choices for σ 1 are possible. They are: (1, 2, 4), (2, 1, 3), (2, 1, 4), (3, 4, 1), (3, 4, 2), (4, 3, 1), (4, 3, 2). (b) In S n for n > 3, suppose that i, j, k and l are distinct integers between 1 and n. Write µ = (i, j)(k, l) as the product of two 3cycles. Replace 1, 2, 3 and 4 above by i, j, k and l. Then µ = (k, i, l)(i, j, k) = (i, j)(k, l). (c) In S n for n > 2, suppose that i, j and k are distinct integers between 1 and n. Let µ = (i, k)(i, j). Compute the cycle decomposition of µ. I did this one in class. µ = (i, j, k). (d) Show that any even permutation is a product of 3cycles. Hint: If µ A n, then µ is a product of 2k transpositions for some k > 0 (unless µ = ι). Show that µ is a product of at most 2k 3cycles. An even permutation µ can be written as a product of an even number of swaps (transpositions), say 2k swaps. Then µ is a product of k pairs of swaps. Consider each pair: Case 1: The two swaps involve just two distinct numbers, say i and j. This gives (i, j)(i, j) = ι, the identity permutation. That is, this pair may be deleted (or written as (i, j, k)(i, k, j) for some k not equal to i or j). Case 2. The two swaps involve three distinct numbers, say i, j and k. As shown above (i, k)(i, j) is a 3cycle. Note that the first swap may be written as (i, j) without loss of generality where i is the number that is repeated in the second swap. Case 3 The two swaps involve four distinct numbers, say i, j, k and l. As shown above, this is the product of 2 3cycles.
7 7 Abstract Algebra Professor M. Zuker Thus, µ may be written as the product of at most 2k 3cycles. It may also be written as the product of exactly 2k 3cycles. Why? Case 1, the trivial case, can be written as the product of 2 3cycles. Case 2: A single 3cycle (i, j, k) may also be written as (i, k, j)(i, k, j), which is the square of the inverse of (i, j, k). Case 3: This is already the product of 2 3cyles.
Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationSolutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving NonConditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More information(0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.
11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
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. Credit will not be given for answers (even correct ones) without
More informationTHE SIGN OF A PERMUTATION
THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a kcycle with k 2 can be written
More informationCONSEQUENCES OF THE SYLOW THEOREMS
CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On wellordering and induction: (a) Prove the induction principle from the wellordering principle. (b) Prove the wellordering
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More informationLecture 13  Basic Number Theory.
Lecture 13  Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are nonnegative integers. We say that A divides B, denoted
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationAbstract Algebra Cheat Sheet
Abstract Algebra Cheat Sheet 16 December 2002 By Brendan Kidwell, based on Dr. Ward Heilman s notes for his Abstract Algebra class. Notes: Where applicable, page numbers are listed in parentheses at the
More information2. Let H and K be subgroups of a group G. Show that H K G if and only if H K or K H.
Math 307 Abstract Algebra Sample final examination questions with solutions 1. Suppose that H is a proper subgroup of Z under addition and H contains 18, 30 and 40, Determine H. Solution. Since gcd(18,
More informationAlgebra of the 2x2x2 Rubik s Cube
Algebra of the 2x2x2 Rubik s Cube Under the direction of Dr. John S. Caughman William Brad Benjamin. Introduction As children, many of us spent countless hours playing with Rubiks Cube. At the time it
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationNumber Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may
Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition
More information4. FIRST STEPS IN THE THEORY 4.1. A
4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We
More informationDiscrete Mathematics, Chapter 4: Number Theory and Cryptography
Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility
More informationAssignment 8: Selected Solutions
Section 4.1 Assignment 8: Selected Solutions 1. and 2. Express each permutation as a product of disjoint cycles, and identify their parity. (1) (1,9,2,3)(1,9,6,5)(1,4,8,7)=(1,4,8,7,2,3)(5,9,6), odd; (2)
More informationCONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationChapter 3. if 2 a i then location: = i. Page 40
Chapter 3 1. Describe an algorithm that takes a list of n integers a 1,a 2,,a n and finds the number of integers each greater than five in the list. Ans: procedure greaterthanfive(a 1,,a n : integers)
More informationAlgebra I: Section 3. Group Theory 3.1 Groups.
Notes: F.P. Greenleaf, 200008 Algebra I: Section 3. Group Theory 3.1 Groups. A group is a set G equipped with a binary operation mapping G G G. Such a product operation carries each ordered pair (x, y)
More informationNumber Theory: A Mathemythical Approach. Student Resources. Printed Version
Number Theory: A Mathemythical Approach Student Resources Printed Version ii Contents 1 Appendix 1 2 Hints to Problems 3 Chapter 1 Hints......................................... 3 Chapter 2 Hints.........................................
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationSUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
More informationFinite dimensional C algebras
Finite dimensional C algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for selfadjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 6 Permutation Groups Let S be a nonempty set and M(S be the collection of all mappings from S into S. In this section,
More informationGroup Fundamentals. Chapter 1. 1.1 Groups and Subgroups. 1.1.1 Definition
Chapter 1 Group Fundamentals 1.1 Groups and Subgroups 1.1.1 Definition A group is a nonempty set G on which there is defined a binary operation (a, b) ab satisfying the following properties. Closure: If
More informationRSA and Primality Testing
and Primality Testing Joan Boyar, IMADA, University of Southern Denmark Studieretningsprojekter 2010 1 / 81 Correctness of cryptography cryptography Introduction to number theory Correctness of with 2
More information1 Symmetries of regular polyhedra
1230, notes 5 1 Symmetries of regular polyhedra Symmetry groups Recall: Group axioms: Suppose that (G, ) is a group and a, b, c are elements of G. Then (i) a b G (ii) (a b) c = a (b c) (iii) There is an
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationSection 4.2: The Division Algorithm and Greatest Common Divisors
Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948
More informationIntroduction to Modern Algebra
Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationPage 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.
Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationV55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography
V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography 3 Congruence Congruences are an important and useful tool for the study of divisibility. As we shall see, they are also critical
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More informationIntermediate Math Circles March 7, 2012 Linear Diophantine Equations II
Intermediate Math Circles March 7, 2012 Linear Diophantine Equations II Last week: How to find one solution to a linear Diophantine equation This week: How to find all solutions to a linear Diophantine
More informationHandout NUMBER THEORY
Handout of NUMBER THEORY by Kus Prihantoso Krisnawan MATHEMATICS DEPARTMENT FACULTY OF MATHEMATICS AND NATURAL SCIENCES YOGYAKARTA STATE UNIVERSITY 2012 Contents Contents i 1 Some Preliminary Considerations
More informationThe Euclidean Algorithm
The Euclidean Algorithm A METHOD FOR FINDING THE GREATEST COMMON DIVISOR FOR TWO LARGE NUMBERS To be successful using this method you have got to know how to divide. If this is something that you have
More informationLAMC Beginners Circle: Parity of a Permutation Problems from Handout by Oleg Gleizer Solutions by James Newton
LAMC Beginners Circle: Parity of a Permutation Problems from Handout by Oleg Gleizer Solutions by James Newton 1. Take a twodigit number and write it down three times to form a sixdigit number. For example,
More informationDigitalCommons@University of Nebraska  Lincoln
University of Nebraska  Lincoln DigitalCommons@University of Nebraska  Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 71007 Pythagorean Triples Diane Swartzlander University
More informationI = 0 1. 1 ad bc. be the set of A in GL(2, C) with real entries and with determinant equal to 1, 1, respectively. Note that A = T A : S S
Fractional linear transformations. Definition. GL(, C) be the set of invertible matrices [ ] a b c d with complex entries. Note that (i) The identity matrix is in GL(, C). [ ] 1 0 I 0 1 (ii) If A and B
More informationElementary Number Theory
Elementary Number Theory A revision by Jim Hefferon, St Michael s College, 2003Dec of notes by W. Edwin Clark, University of South Florida, 2002Dec L A TEX source compiled on January 5, 2004 by Jim Hefferon,
More informationGroup Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
More informationRSA Question 2. Bob thinks that p and q are primes but p isn t. Then, Bob thinks Φ Bob :=(p1)(q1) = φ(n). Is this true?
RSA Question 2 Bob thinks that p and q are primes but p isn t. Then, Bob thinks Φ Bob :=(p1)(q1) = φ(n). Is this true? Bob chooses a random e (1 < e < Φ Bob ) such that gcd(e,φ Bob )=1. Then, d = e 1
More informationNOTES ON GROUP THEORY
NOTES ON GROUP THEORY Abstract. These are the notes prepared for the course MTH 751 to be offered to the PhD students at IIT Kanpur. Contents 1. Binary Structure 2 2. Group Structure 5 3. Group Actions
More informationON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath
International Electronic Journal of Algebra Volume 7 (2010) 140151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationMath 115 Spring 2011 Written Homework 5 Solutions
. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence
More informationSYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me
SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBINCAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationDiscrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 Email: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationElements of Abstract Group Theory
Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for
More informationChapter 7: Products and quotients
Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More informationBreaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
More information26 Ideals and Quotient Rings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 26 Ideals and Quotient Rings In this section we develop some theory of rings that parallels the theory of groups discussed
More informationDIVISIBILITY AND GREATEST COMMON DIVISORS
DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will
More informationCOMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the HigmanSims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationAbstract Algebra Theory and Applications. Thomas W. Judson Stephen F. Austin State University
Abstract Algebra Theory and Applications Thomas W. Judson Stephen F. Austin State University August 16, 2013 ii Copyright 19972013 by Thomas W. Judson. Permission is granted to copy, distribute and/or
More informationOn the generation of elliptic curves with 16 rational torsion points by Pythagorean triples
On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationGCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!
GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!!! Challenge Problem 2 (Mastermind) due Fri. 9/26 Find a fourth guess whose scoring will allow you to determine the secret code (repetitions are
More informationGalois representations with open image
Galois representations with open image Ralph Greenberg University of Washington Seattle, Washington, USA May 7th, 2011 Introduction This talk will be about representations of the absolute Galois group
More informationMath 223 Abstract Algebra Lecture Notes
Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course
More informationDECOMPOSING SL 2 (R)
DECOMPOSING SL 2 R KEITH CONRAD Introduction The group SL 2 R is not easy to visualize: it naturally lies in M 2 R, which is 4 dimensional the entries of a variable 2 2 real matrix are 4 free parameters
More informationCategory 3 Number Theory Meet #1, October, 2000
Category 3 Meet #1, October, 2000 1. For how many positive integral values of n will 168 n be a whole number? 2. What is the greatest integer that will always divide the product of four consecutive integers?
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warmup Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More information(Q, ), (R, ), (C, ), where the star means without 0, (Q +, ), (R +, ), where the plussign means just positive numbers, and (U, ),
2 Examples of Groups 21 Some infinite abelian groups It is easy to see that the following are infinite abelian groups: Z, +), Q, +), R, +), C, +), where R is the set of real numbers and C is the set of
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationIntroduction to Programming (in C++) Loops. Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC
Introduction to Programming (in C++) Loops Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC Example Assume the following specification: Input: read a number N > 0 Output:
More informationExample. Introduction to Programming (in C++) Loops. The while statement. Write the numbers 1 N. Assume the following specification:
Example Introduction to Programming (in C++) Loops Assume the following specification: Input: read a number N > 0 Output: write the sequence 1 2 3 N (one number per line) Jordi Cortadella, Ricard Gavaldà,
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationMath 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an afterdinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an afterdinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More informationInteger Factorization using the Quadratic Sieve
Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give
More informationCombinatorial Proofs
Combinatorial Proofs Two Counting Principles Some proofs concerning finite sets involve counting the number of elements of the sets, so we will look at the basics of counting. Addition Principle: If A
More informationNotes on Group Theory
Notes on Group Theory Mark Reeder March 7, 2014 Contents 1 Notation for sets and functions 4 2 Basic group theory 4 2.1 The definition of a group................................. 4 2.2 Group homomorphisms..................................
More information