Test1. Due Friday, March 13, 2015.


 Irma Gregory
 1 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.
Elementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationLemma 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 information3 Congruence arithmetic
3 Congruence arithmetic 3.1 Congruence mod n As we said before, one of the most basic tasks in number theory is to factor a number a. How do we do this? We start with smaller numbers and see if they divide
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 informationDepartment of Mathematics Exercises G.1: Solutions
Department of Mathematics MT161 Exercises G.1: Solutions 1. We show that a (b c) = (a b) c for all binary strings a, b, c B. So let a = a 1 a 2... a n, b = b 1 b 2... b n and c = c 1 c 2... c n, where
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 informationAlgebra for Digital Communication
EPFL  Section de Mathématiques Algebra for Digital Communication Fall semester 2008 Solutions for exercise sheet 1 Exercise 1. i) We will do a proof by contradiction. Suppose 2 a 2 but 2 a. We will obtain
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 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 informationAlgebra. Sample Solutions for Test 1
EPFL  Section de Mathématiques Algebra Fall semester 20082009 Sample Solutions for Test 1 Question 1 (english, 30 points) 1) Let n 11 13 17. Find the number of units of the ring Z/nZ. 2) Consider the
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 informationHomework 5 Solutions
Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which
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 informationb) Find smallest a > 0 such that 2 a 1 (mod 341). Solution: a) Use succesive squarings. We have 85 =
Problem 1. Prove that a b (mod c) if and only if a and b give the same remainders upon division by c. Solution: Let r a, r b be the remainders of a, b upon division by c respectively. Thus a r a (mod c)
More information2. Integers and Algorithms Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers
2. INTEGERS AND ALGORITHMS 155 2. Integers and Algorithms 2.1. Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers with a b > 0. (1) Apply the division algorithm: a = bq + r, 0 r < b.
More informationMath 210A: Algebra, Homework 1
Math 210A: Algebra, Homework 1 Ian Coley October 9, 2013 Problem 1. Let a 1, a 2,..., a n be elements of a group G. Define the product of the a i s by induction: a 1 a 2 a n = (a 1 a 2 a n 1 )a n. (a)
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
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 informationORDERS OF ELEMENTS IN A GROUP
ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since
More information2 The Euclidean algorithm
2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In
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 informationTopics in Number Theory
Chapter 8 Topics in Number Theory 8.1 The Greatest Common Divisor Preview Activity 1 (The Greatest Common Divisor) 1. Explain what it means to say that a nonzero integer m divides an integer n. Recall
More information*.I Zolotareff s Proof of Quadratic Reciprocity
*.I. ZOLOTAREFF S PROOF OF QUADRATIC RECIPROCITY 1 *.I Zolotareff s Proof of Quadratic Reciprocity This proof requires a fair amount of preparations on permutations and their signs. Most of the material
More informationMath 31  Homework 1 Solutions
Math 31  Homework 1 Solutions 1. Find gcd(a, b) and express gcd(a, b) as ma + nb for: (a) (116, 84) Solution. Use the Euclidean algorithm: 116 = ( 1)( 84) + 32 84 = ( 3)(32) + 12 32 = (2)(12) + 8 12 =
More informationMathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR
Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGrawHill The McGrawHill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,
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 informationGroups 1. Definition 1 A Group G is a set with an operation which satisfies the following: e a = a e = e. a a 1 = a 1 a = e.
Groups 1 1 Introduction to Groups Definition 1 A Group G is a set with an operation which satisfies the following: 1. there is an identity element e G, such that for every a G e a = a e = e 2. every element
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 informationGroup Theory G13GTH. Chris Wuthrich. 1 Definitions and examples Examples Direct and semidirect products Small groups...
Group Theory G13GTH Chris Wuthrich 2012 13 Contents 1 Definitions and examples 3 1.1 Examples..................................... 3 1.2 Direct and semidirect products......................... 4 1.3 Small
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 informationMathematical induction & Recursion
CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,
More information3 Structure of Modular Multiplication
3 Structure of Modular Multiplication Unlike addition, multiplication in Z M is fairly strange. There may not always be an inverse, you can multiply two nonzero numbers together and get zero, and in general
More informationChapter 6. Number Theory. 6.1 The Division Algorithm
Chapter 6 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More information4. Number Theory (Part 2)
4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.
More informationGreatest Common Divisor
Greatest Common Divisor Blake Thornton Much of this is due directly to Josh Zucker, Paul Zeitz and Harold Reiter. Divisibility 1. How can 48 be built from primes? In what sense is there only one way? How
More informationMATH 433 Applied Algebra Lecture 13: Examples of groups.
MATH 433 Applied Algebra Lecture 13: Examples of groups. Abstract groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements
More informationAlgebraic Systems, Fall 2013, September 1, 2013 Edition. Todd Cochrane
Algebraic Systems, Fall 2013, September 1, 2013 Edition Todd Cochrane Contents Notation 5 Chapter 0. Axioms for the set of Integers Z. 7 Chapter 1. Algebraic Properties of the Integers 9 1.1. Background
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 information3. QUADRATIC CONGRUENCES
3. QUADRATIC CONGRUENCES 3.1. Quadratics Over a Finite Field We re all familiar with the quadratic equation in the context of real or complex numbers. The formula for the solutions to ax + bx + c = 0 (where
More informationCOSETS AND LAGRANGE S THEOREM
COSETS AND LAGRANGE S THEOREM KEITH CONRAD 1. Introduction Pick an integer m 0. For a Z, the congruence class a mod m is the set of integers a + mk as k runs over Z. We can write this set as a + mz. This
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 information13 Solutions for Section 6
13 Solutions for Section 6 Exercise 6.2 Draw up the group table for S 3. List, giving each as a product of disjoint cycles, all the permutations in S 4. Determine the order of each element of S 4. Solution
More information3. Applications of Number Theory
3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a
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 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 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 informationFurther linear algebra. Chapter I. Integers.
Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides
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 informationTheorem Let G be a group and H a normal subgroup of G. Then the operation given by (Q) is well defined.
22. Quotient groups I 22.1. Definition of quotient groups. Let G be a group and H a subgroup of G. Denote by G/H the set of distinct (left) cosets with respect to H. In other words, we list all the cosets
More informationCongruences. Robert Friedman
Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition
More informationSection 4: Powers of an Element; Cyclic Groups
Section 4: Powers of an Element; Cyclic Groups For elements of a semigroup (S, ), the definition of positive integer exponents is clear: For x in S and n in Z +, x n = x x x, where there are n factors,
More informationSOLUTIONS FOR PROBLEM SET 6
SOLUTIONS FOR PROBLEM SET 6 A. Suppose that G is a group and that H is a subgroup of G such that [G : H] = 2. Suppose that a,b G, but a H and b H. Prove that ab H. SOLUTION: Since [G : H] = 2, it follows
More informationElementary Number Theory
Elementary Number Theory Ahto Buldas December 3, 2016 Ahto Buldas Elementary Number Theory December 3, 2016 1 / 1 Division For any m > 0, we define Z m = {0, 1,... m 1} For any n, m Z (m > 0), there are
More informationAbelian groups/1. 1 Definition
Abelian groups 1 Definition An Abelian group is a set A with a binary operation satisfying the following conditions: (A1) For all a,b,c A, we have a (b c) = (a b) c (the associative law). (A2) There is
More informationMathematics of Cryptography
CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter
More informationDMATH Algebra I HS 2013 Prof. Brent Doran. Solution 5
DMATH Algebra I HS 2013 Prof. Brent Doran Solution 5 Dihedral groups, permutation groups, discrete subgroups of M 2, group actions 1. Write an explicit embedding of the dihedral group D n into the symmetric
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 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 informationDiscrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University
Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called
More informationCHAPTER 5: MODULAR ARITHMETIC
CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called
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 informationAn important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q.
Chapter 3 Linear Codes An important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q. Definition 3.1 (Linear code). A linear code C is a code in Fq n for
More information3.1 The Definition and Some Basic Properties. We identify the natural class of integral domains in which unique factorization of ideals is possible.
Chapter 3 Dedekind Domains 3.1 The Definition and Some Basic Properties We identify the natural class of integral domains in which unique factorization of ideals is possible. 3.1.1 Definition A Dedekind
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 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 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 information5.1 Commutative rings; Integral Domains
5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following
More information4. MATRICES Matrices
4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:
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 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 informationMULTIPLICATIVE GROUPS IN Z m
MULTIPLICATIVE GROUPS IN Z m BRIAN SLOAN 1. Abstract Our goal will be to find subsets of Z m that form groups under the operation of multiplication modulo m. By utilizing the isomorphism Z m = Zn Z k,
More informationBinary Operations. Discussion. Power Set Operation. Binary Operation Properties. Whole Number Subsets. Let be a binary operation defined on the set A.
Binary Operations Let S be any given set. A binary operation on S is a correspondence that associates with each ordered pair (a, b) of elements of S a uniquely determined element a b = c where c S Discussion
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 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 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 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 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 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 information1.4 Integers Modulo n
1.4 J.A.Beachy 1 1.4 Integers Modulo n from A Study Guide f Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 31. Find the multiplicative inverse of each nonzero element of Z
More informationLong questions answer Advanced Mathematics for Computer Application If P= , find BT. 19. If B = 1 0, find 2B and 3B.
Unit1: Matrix Algebra Short questions answer 1. What is Matrix? 2. Define the following terms : a) Elements matrix b) Row matrix c) Column matrix d) Diagonal matrix e) Scalar matrix f) Unit matrix OR
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 informationNUMBER THEORY AMIN WITNO
NUMBER THEORY AMIN WITNO ii Number Theory Amin Witno Department of Basic Sciences Philadelphia University JORDAN 19392 Originally written for Math 313 students at Philadelphia University in Jordan, this
More informationAPPLICATIONS OF THE ORDER FUNCTION
APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and
More informationL12. Special Matrix Operations: Permutations, Transpose, Inverse, Augmentation 12 Aug 2014
L12. Special Matrix Operations: Permutations, Transpose, Inverse, Augmentation 12 Aug 2014 Unfortunately, no one can be told what the Matrix is. You have to see it for yourself.  Morpheus Primary concepts:
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 informationMTH 382 Number Theory Spring 2003 Practice Problems for the Final
MTH 382 Number Theory Spring 2003 Practice Problems for the Final (1) Find the quotient and remainder in the Division Algorithm, (a) with divisor 16 and dividend 95, (b) with divisor 16 and dividend 95,
More informationChapter 4: Binary Operations and Relations
c Dr Oksana Shatalov, Fall 2014 1 Chapter 4: Binary Operations and Relations 4.1: Binary Operations DEFINITION 1. A binary operation on a nonempty set A is a function from A A to A. Addition, subtraction,
More informationABSTRACT ALGEBRA. Romyar Sharifi
ABSTRACT ALGEBRA Romyar Sharifi Contents Introduction 7 Part 1. A First Course 11 Chapter 1. Set theory 13 1.1. Sets and functions 13 1.2. Relations 15 1.3. Binary operations 19 Chapter 2. Group theory
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 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 informationBasic Properties of Rings
Basic Properties of Rings A ring is an algebraic structure with an addition operation and a multiplication operation. These operations are required to satisfy many (but not all!) familiar properties. Some
More informationThe Hadamard Product
The Hadamard Product Elizabeth Million April 12, 2007 1 Introduction and Basic Results As inexperienced mathematicians we may have once thought that the natural definition for matrix multiplication would
More informationWeek 5: Binary Relations
1 Binary Relations Week 5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
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 information5.1 Text HW Number Theory Math 210 pbf8 1. Illustrate = 34 as in theorem 1.5 [i.e. showing that EVEN + EVEN = EVEN!].
.1 Text HW Number Theory Math 10 pbf8 1. Illustrate 1+18 = 4 as in theorem 1. [i.e. showing that EVEN + EVEN = EVEN!]. 1 18 4 11 48. Illustrate + 449 = 781 as in theorem 1.: EVEN + ODD = ODD 449 781 4a.
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 information