The group (Z/nZ) February 17, In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer.

Size: px
Start display at page:

Download "The group (Z/nZ) February 17, In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer."

Transcription

1 The group (Z/nZ) February 17, Introduction In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer. If we factor n = p e 1 1 pe, where the p i s are distinct primes, then since gcd(p e i Chinese Remainder Theorem guarantees that i, pe j j Z/nZ = Z/p e 1 1 Z... Z/pe Z ) = 1 for i j, the as rings. Taing the unit groups of both sides of this isomorphism yields (Z/nZ) = (Z/p e 1 1 Z)... (Z/p e Z). This shows us that in order to understand the structure of (Z/nZ) it suffices to understand the structure of (Z/p e Z) where p is a prime and e 1 is an integer. For a positive integer n, we define ϕ(n) := (Z/nZ), then the above isomorphism shows that ϕ(n) = i=1 ϕ(p e i i ). A positive integer a p e has a multiplicative inverse in Z/p e Z if and only if 1 = gcd(a, p e ) = gcd(a, p). Thus ϕ(p e ) equals the number of positive integers less than p e which are relatively prime to p. Of course gcd(a, p) 1 1

2 if and only if p a, so the number of elements in Z/p e Z without inverses equals p e p = pe 1. Thus In this document we will prove ϕ(p e ) = p e p e 1 = p e 1 (p 1). Theorem 1.1. Let p be a prime and e 1 an integer. Then 1. (Z/p e Z) is cyclic of size (p 1)p e 1 if p is odd. 2. (Z/2 e Z) is isomorphic to the direct product of a cyclic group of order 2 and a cyclic group of order 2 e 2 when e 2. 2 Preliminaries Before getting to the main theorem, we need to better understand properties of abelian groups. Let G be an abelian group, then we have Proposition 2.1. Suppose G contains an element of order a 1 and an element of order b 1. Then G contains an element of order lcm(a, b). Proof. Let x G have order a and y G have order b. Write a = p e 1 1 pe 2 2 pe b = p f 1 1 pf 2 2 pf where the p i s are prime and e i, f i 0. Then we have the formula lcm(a, b) = p g 1 1 pg 2 2 pg where g i = max(e i, f i ). Reorder the p i s so that e i f i for 1 i j and e i < f i for j + 1 i and define m = p e 1 1 pe 2 2 pe j j n = p f j+1 j+1 pf. Then gcd(m, n) = 1 and mn = lcm(a, b). By definition, m a and n b. Thus r = x a/m G has order m and s = y b/n has order n. I claim that rs has order mn. To prove this, first note that (rs) mn = r m s n = x a y b = 1 2

3 showing that rs has finite order and that its order is at most mn. For the converse, let t denote the order of rs. Then 1 = (rs) tm = (r m ) t (s tm ) = s tm. Since the order of n is n, we see that n tm but gcd(m, n) = 1 implies n t. A similar argument with tn in place of tm shows that m t, and since gcd(m, n) = 1 we must have mn t hence mn t. Thus t = mn and hence G contains an element of order mn = lcm(a, b). As a corollary of this proposition, we obtain the following result for finite abelian groups. Corollary 2.2. Let G be a finite abelian group. Suppose that M is the maximal order of any element in G. Then a M = 1 for every a G. Proof. Assume for the sae of contradiction that there exists x G with x M 1. If t denotes the order of x, then certainly t does not divide M. By definition of M we now that G contains an element of order M and hence by Proposition 2.1 we see that G contains an element of order lcm(t, M) > M. This contradicts the maximality assumption on M, and therefore a M = 1 for every a G. With Corollary 2.2 on hand we can now prove that the unit group of any finite field is cyclic. Theorem 2.3. Let F be a finite field. Then F is a cyclic group under multiplication. Proof. We now that F is a finite abelian group under multiplication. Let M be the maximal order of an element in F. Then by Corollary 2.2 we now that a M = 1 for every a F. This implies that the polynomial x M 1 F [x] has F many roots. But x M 1 can not have more than M roots, so in fact F M. By Lagrange we now that M F and hence we get equality. Since the maximal order of an element in F equals F, we see that in fact F must be a cyclic group. An immediate corollary that we will use is 3

4 Corollary 2.4. The group (Z/pZ) is cyclic for any prime p. Proof. F p = Z/pZ is a field. This will be our base case in trying to find the structure of (Z/p e Z) in the next sections. 3 The case p is odd In this section we will prove that (Z/p e Z) is cyclic for all e 1. We already now this result in the case e = 1 since Z/pZ is a field. Notice that Z/p e Z is NOT a field if e > 1, so we must use other techniques. The basic idea here is the following. We ve already computed that ϕ(p e ) = p e 1 (p 1). Thus to show that (Z/p e Z) is cyclic, we must produce an element of order p e 1 (p 1). Since gcd(p e 1, p 1) = 1, Proposition 2.1 tells us that this will be accomplished once we produce elements of order p e 1 and p 1. Proposition 3.1. The group (Z/p e Z) contains an element of order p 1. Proof. In Z, the ideal (p) contains the ideal (p e ). Thus by the third isomorphism theorem, Z/pZ = (Z/p e Z)/(pZ/p e Z). Thus there is a surjective quotient map π e : Z/p e Z Z/pZ. Let g Z/pZ be a generator for the cyclic group (Z/pZ), and let h Z/p e Z satisfy π e (h) = g. If t is the order of h, then 1 = π e (h t ) = π e (h) t = g t. Since the order of g is p 1, we see that p 1 t. Therefore, the order of h t/(p 1) in Z/p e Z is p 1. Proposition 3.2. For p an odd prime, the order of 1 + p in Z/p e Z is p e 1. Proof. We will prove by induction on the stronger statement (1 + p) p = 1 + p +1 t where t Z is relatively prime to p. This is clearly true for = 0 with t = 1. Assume that we now (1 + p) p = 1 + p +1 t 4

5 for some 0 where gcd(p, t) = 1. By binomial expansion we have (1 + p) p+1 = (1 + p +1 t) p = p i=0 ( ) p (p +1 t) i. i We now that for any 0. Thus modulo p +3 this expression equals p i=0 ( ) p (p +1 t) i = 1 + p p +1 p(p 1) t + p 2+2 t 2 (mod p +3 ). i 2 = 1 + p +2 t + p 2+3 t 2 p 1 2 We also have for 0 so in fact we get This means that 1 + p +2 t (mod p +3 ). (mod p +3 ). (1 + p) p+1 = 1 + p +2 t + p +3 m = 1 + p +2 (t + pm) for some m Z. Since gcd(t, p) = 1, we also have gcd(t + pm, p) = 1 and hence the inductive step is correct. For e 1, the above computation shows that (1 + p) pe 1 1 (mod p e ) and that there exists t Z relatively prime to p with (1 + p) pe p e 1 t 1 (mod p e ). Thus the order of 1 + p is indeed p e 1 in (Z/p e Z). Corollary 3.3. Let p be an odd prime. Then the group (Z/p e Z) is cyclic. Proof. Proposition 3.1 shows that (Z/p e Z) contains an element of order p 1 while Proposition 3.2 shows that (Z/p e Z) contains an element of order p e 1. By Proposition 2.1 we see that (Z/p e Z) contains an element of order lcm(p 1, p e 1 ) = (p 1)p e 1 = ϕ(p e ) and hence (Z/p e Z) is cyclic. 5

6 4 The case p = 2 The above proof cannot wor for p = 2. The group is not cyclic since (Z/8Z) = {1, 3, 5, 7} (mod 8). Before proving what is correct, let s try to understand what fails in the proof. The fact that (Z/2 e Z) contains an element of order 2 1 = 1 is trivial. Thus something must fail with the order of We have (1 + 2) 20 = = (1 + 2) 21 = = Strangely enough, the only thing that goes wrong in the induction is the claim from above that ( ) p p(p 1) = 2 2 is a multiple of p. This is true if p is odd, but false for p = 2. We will need a new idea here. We will prove that 5 always has order 2 e 2 in (Z/2 e Z). The extra power of 2 in 5 = will be useful for fixing the proof. Proposition 4.1. The element 5 = has order p e 2 in (Z/p e Z) whenever e 2. Proof. We prove by induction the stronger statement that for 0, ( ) 2 = t where t Z is odd. This is clearly true for = 0 and t = 1 so assume it is true for some 0. Then ( ) 2+1 = ( t) 2 = t t 2 = (t t 2 ) and t t 2 is odd since t is odd. This proves the result by induction, and hence 5 2e 2 1 (mod 2 e ) 6

7 yet for some odd t Z, 5 2e 3 = e 1 t 1 (mod 2 e ). This proves that 5 has order 2 e 2 is (Z/2 e Z). This shows that 5 (Z/2 e Z) is a subgroup of index 2 since ϕ(2 e ) = 2 e 1. We will prove that 1 5. To do this, notice that the order of 1 in (Z/2 e Z) is 2. Any cyclic group has at most one element of order 2, so all we need to do is to find an element of order 2 in 5 and chec that it is not 1. Proposition 4.2. We have 1 5 in (Z/2 e Z) whenever e 2. Proof. This is obvious if e = 2. Thus we may assume that e 3. We proved in Proposition 4.1 that the order of 5 is 2 e 2. Thus 5 2e 3 has order 2 in 5. Since 1 also has multiplicative order 2, if 1 5 then we must have But then where t is some odd integer. Thus 5 2e 3 1 (mod 2 e ) e e 1 t (mod 2 e ) 2 2 e 1 (mod 2 e ) which is absurd since 2 e 1 divides 2 e yet not 2 as long as e 3. Corollary 4.3. For e 2 the group (Z/2 e Z) is isomorphic to the direct product of a cyclic group of order 2 and a cyclic group of order 2 e 2. Proof. Consider subgroups A = 5 (Z/2 e Z) B = 1 (Z/2 e Z). Proposition 4.1 and Proposition 4.2 guarantee that A = 2 e 2, B = 2 and A B = 1. Since (Z/2 e Z) is abelian, we have Of course and therefore as claimed. AB = AB = A B. A B A B = (2e 2 ) 2 = 2 e 1 = (Z/2 e Z) (Z/2 e Z) = A B 7

D-MATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions.

D-MATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions. D-MAH Algebra II FS18 Prof. Marc Burger Solution 26 Cyclotomic extensions. In the following, ϕ : Z 1 Z 0 is the Euler function ϕ(n = card ((Z/nZ. For each integer n 1, we consider the n-th cyclotomic polynomial

More information

Chapter 5. Modular arithmetic. 5.1 The modular ring

Chapter 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 information

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

More information

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

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

More information

Math 120 HW 9 Solutions

Math 120 HW 9 Solutions Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z

More information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

CYCLICITY OF (Z/(p))

CYCLICITY OF (Z/(p)) CYCLICITY OF (Z/(p)) KEITH CONRAD 1. Introduction For each prime p, the group (Z/(p)) is cyclic. We will give seven proofs of this fundamental result. A common feature of the proofs that (Z/(p)) is cyclic

More information

Discrete Mathematics with Applications MATH236

Discrete Mathematics with Applications MATH236 Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet

More information

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. 2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say

More information

Lecture 8: Finite fields

Lecture 8: Finite fields Lecture 8: Finite fields Rajat Mittal IIT Kanpur We have learnt about groups, rings, integral domains and fields till now. Fields have the maximum required properties and hence many nice theorems can be

More information

Solving Diophantine Equations With Unique Factorization

Solving Diophantine Equations With Unique Factorization Solving Diophantine Equations With Unique Factorization February 17, 2016 1 Introduction In this note we should how unique factorization in rings like Z[i] and Z[ 2] can be used to find integer solutions

More information

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

CHAPTER 6. Prime Numbers. Definition and Fundamental Results CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n

More information

MATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4

MATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4 MATH 25 CLASS 21 NOTES, NOV 7 2011 Contents 1. Groups: definition 1 2. Subgroups 2 3. Isomorphisms 4 1. Groups: definition Even though we have been learning number theory without using any other parts

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem The Chinese Remainder Theorem R. C. Daileda February 19, 2018 1 The Chinese Remainder Theorem We begin with an example. Example 1. Consider the system of simultaneous congruences x 3 (mod 5), x 2 (mod

More information

Mathematics for Cryptography

Mathematics 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 information

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS The integers are the set 1. Groups, Rings, and Fields: Basic Examples Z := {..., 3, 2, 1, 0, 1, 2, 3,...}, and we can add, subtract, and multiply

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,

More information

Fundamental Theorem of Finite Abelian Groups

Fundamental Theorem of Finite Abelian Groups Monica Agana Boise State University September 1, 2015 Theorem (Fundamental Theorem of Finite Abelian Groups) Every finite Abelian group is a direct product of cyclic groups of prime-power order. The number

More information

Chapter 5. Number Theory. 5.1 Base b representations

Chapter 5. Number Theory. 5.1 Base b representations Chapter 5 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 information

Factorization in Polynomial Rings

Factorization 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 information

Abstract Algebra: Chapters 16 and 17

Abstract Algebra: Chapters 16 and 17 Study polynomials, their factorization, and the construction of fields. Chapter 16 Polynomial Rings Notation Let R be a commutative ring. The ring of polynomials over R in the indeterminate x is the set

More information

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1

More information

Transposition as a permutation: a tale of group actions and modular arithmetic

Transposition as a permutation: a tale of group actions and modular arithmetic Transposition as a permutation: a tale of group actions and modular arithmetic Jeff Hooper Franklin Mendivil Department of Mathematics and Statistics Acadia University Abstract Converting a matrix from

More information

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald)

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures

More information

Lecture 7 Cyclic groups and subgroups

Lecture 7 Cyclic groups and subgroups Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:

More information

Lecture 6: Finite Fields

Lecture 6: Finite Fields CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going

More information

Math 210A: Algebra, Homework 5

Math 210A: Algebra, Homework 5 Math 210A: Algebra, Homework 5 Ian Coley November 5, 2013 Problem 1. Prove that two elements σ and τ in S n are conjugate if and only if type σ = type τ. Suppose first that σ and τ are cycles. Suppose

More information

Notes on Systems of Linear Congruences

Notes on Systems of Linear Congruences MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the

More information

Algebra SEP Solutions

Algebra SEP Solutions Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since

More information

Euler s, Fermat s and Wilson s Theorems

Euler s, Fermat s and Wilson s Theorems Euler s, Fermat s and Wilson s Theorems R. C. Daileda February 17, 2018 1 Euler s Theorem Consider the following example. Example 1. Find the remainder when 3 103 is divided by 14. We begin by computing

More information

Congruences and Residue Class Rings

Congruences and Residue Class Rings Congruences and Residue Class Rings (Chapter 2 of J. A. Buchmann, Introduction to Cryptography, 2nd Ed., 2004) Shoichi Hirose Faculty of Engineering, University of Fukui S. Hirose (U. Fukui) Congruences

More information

a = mq + r where 0 r m 1.

a = mq + r where 0 r m 1. 8. Euler ϕ-function We have already seen that Z m, the set of equivalence classes of the integers modulo m, is naturally a ring. Now we will start to derive some interesting consequences in number theory.

More information

Quadratic Congruences, the Quadratic Formula, and Euler s Criterion

Quadratic Congruences, the Quadratic Formula, and Euler s Criterion Quadratic Congruences, the Quadratic Formula, and Euler s Criterion R. C. Trinity University Number Theory Introduction Let R be a (commutative) ring in which 2 = 1 R + 1 R R. Consider a quadratic equation

More information

1 Overview and revision

1 Overview and revision MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction

More information

Corollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1

Corollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1 4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.

More information

1 Structure of Finite Fields

1 Structure of Finite Fields T-79.5501 Cryptology Additional material September 27, 2005 1 Structure of Finite Fields This section contains complementary material to Section 5.2.3 of the text-book. It is not entirely self-contained

More information

1. multiplication is commutative and associative;

1. multiplication is commutative and associative; Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

More information

φ(xy) = (xy) n = x n y n = φ(x)φ(y)

φ(xy) = (xy) n = x n y n = φ(x)φ(y) Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =

More information

The primitive root theorem

The primitive root theorem The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under

More information

I216e Discrete Math (for Review)

I216e Discrete Math (for Review) I216e Discrete Math (for Review) Nov 22nd, 2017 To check your understanding. Proofs of do not appear in the exam. 1 Monoid Let (G, ) be a monoid. Proposition 1 Uniquness of Identity An idenity e is unique,

More information

Part II. Number Theory. Year

Part II. Number Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler

More information

Cosets and Normal Subgroups

Cosets and Normal Subgroups Cosets and Normal Subgroups (Last Updated: November 3, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from

More information

10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "

10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice

More information

Math 581 Problem Set 7 Solutions

Math 581 Problem Set 7 Solutions Math 581 Problem Set 7 Solutions 1. Let f(x) Q[x] be a polynomial. A ring isomorphism φ : R R is called an automorphism. (a) Let φ : C C be a ring homomorphism so that φ(a) = a for all a Q. Prove that

More information

A polytime proof of correctness of the Rabin-Miller algorithm from Fermat s Little Theorem

A polytime proof of correctness of the Rabin-Miller algorithm from Fermat s Little Theorem A polytime proof of correctness of the Rabin-Miller algorithm from Fermat s Little Theorem Grzegorz Herman and Michael Soltys November 24, 2008 Abstract Although a deterministic polytime algorithm for

More information

CYCLOTOMIC POLYNOMIALS

CYCLOTOMIC POLYNOMIALS CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where

More information

MATH 361: NUMBER THEORY FOURTH LECTURE

MATH 361: NUMBER THEORY FOURTH LECTURE MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the

More information

CYCLOTOMIC POLYNOMIALS

CYCLOTOMIC POLYNOMIALS CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where

More information

M381 Number Theory 2004 Page 1

M381 Number Theory 2004 Page 1 M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +

More information

Math 581 Problem Set 9

Math 581 Problem Set 9 Math 581 Prolem Set 9 1. Let m and n e relatively prime positive integers. (a) Prove that Z/mnZ = Z/mZ Z/nZ as RINGS. (Hint: First Isomorphism Theorem) Proof: Define ϕz Z/mZ Z/nZ y ϕ(x) = ([x] m, [x] n

More information

Math 121 Homework 5: Notes on Selected Problems

Math 121 Homework 5: Notes on Selected Problems Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements

More information

Winter Camp 2009 Number Theory Tips and Tricks

Winter Camp 2009 Number Theory Tips and Tricks Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine

More information

6 Cosets & Factor Groups

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

More information

MATH RING ISOMORPHISM THEOREMS

MATH RING ISOMORPHISM THEOREMS MATH 371 - RING ISOMORPHISM THEOREMS DR. ZACHARY SCHERR 1. Theory In this note we prove all four isomorphism theorems for rings, and provide several examples on how they get used to describe quotient rings.

More information

SUBGROUPS 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. 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 information

Introduction to Number Theory 1. c Eli Biham - December 13, Introduction to Number Theory 1

Introduction to Number Theory 1. c Eli Biham - December 13, Introduction to Number Theory 1 Introduction to Number Theory 1 c Eli Biham - December 13, 2012 206 Introduction to Number Theory 1 Division Definition: Let a and b be integers. We say that a divides b, or a b if d s.t. b = ad. If b

More information

Section 15 Factor-group computation and simple groups

Section 15 Factor-group computation and simple groups Section 15 Factor-group computation and simple groups Instructor: Yifan Yang Fall 2006 Outline Factor-group computation Simple groups The problem Problem Given a factor group G/H, find an isomorphic group

More information

Algebraic Structures Exam File Fall 2013 Exam #1

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

More information

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b

More information

NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS

NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in

More information

A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC

A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC SIDDHI PATHAK Abstract. This note gives a simple proof of a famous theorem of Burnside, namely, all groups of order n are cyclic

More information

Computations/Applications

Computations/Applications Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x

More information

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

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

More information

Math 120: Homework 6 Solutions

Math 120: Homework 6 Solutions Math 120: Homewor 6 Solutions November 18, 2018 Problem 4.4 # 2. Prove that if G is an abelian group of order pq, where p and q are distinct primes then G is cyclic. Solution. By Cauchy s theorem, G has

More information

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

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

More information

MA4H9 Modular Forms: Problem Sheet 2 Solutions

MA4H9 Modular Forms: Problem Sheet 2 Solutions MA4H9 Modular Forms: Problem Sheet Solutions David Loeffler December 3, 010 This is the second of 3 problem sheets, each of which amounts to 5% of your final mark for the course This problem sheet will

More information

ABSTRACT ALGEBRA 1 COURSE NOTES, LECTURE 11: SYLOW THEORY.

ABSTRACT ALGEBRA 1 COURSE NOTES, LECTURE 11: SYLOW THEORY. ABSTRACT ALGEBRA 1 COURSE NOTES, LECTURE 11: SYLOW THEORY. ANDREW SALCH Here s a quick definition we could have introduced a long time ago: Definition 0.1. If n is a positive integer, we often write C

More information

Math 546, Exam 2 Information.

Math 546, Exam 2 Information. Math 546, Exam 2 Information. 10/21/09, LC 303B, 10:10-11:00. Exam 2 will be based on: Sections 3.2, 3.3, 3.4, 3.5; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/546fa09/546.html)

More information

Math Introduction to Modern Algebra

Math Introduction to Modern Algebra Math 343 - Introduction to Modern Algebra Notes Rings and Special Kinds of Rings Let R be a (nonempty) set. R is a ring if there are two binary operations + and such that (A) (R, +) is an abelian group.

More information

Basic Algorithms in Number Theory

Basic Algorithms in Number Theory Basic Algorithms in Number Theory Algorithmic Complexity... 1 Basic Algorithms in Number Theory Francesco Pappalardi Discrete Logs, Modular Square Roots & Euclidean Algorithm. July 20 th 2010 Basic Algorithms

More information

Notes on Primitive Roots Dan Klain

Notes on Primitive Roots Dan Klain Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed

More information

FINITE ABELIAN GROUPS Amin Witno

FINITE ABELIAN GROUPS Amin Witno WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every

More information

An Algorithm for Prime Factorization

An Algorithm for Prime Factorization An Algorithm for Prime Factorization Fact: If a is the smallest number > 1 that divides n, then a is prime. Proof: By contradiction. (Left to the reader.) A multiset is like a set, except repetitions are

More information

Introduction to Abstract Mathematics

Introduction to Abstract Mathematics Introduction to Abstract Mathematics Notation: Z + or Z >0 denotes the set {1, 2, 3,...} of positive integers, Z 0 is the set {0, 1, 2,...} of nonnegative integers, Z is the set {..., 1, 0, 1, 2,...} of

More information

2. THE EUCLIDEAN ALGORITHM More ring essentials

2. THE EUCLIDEAN ALGORITHM More ring essentials 2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there

More information

Foundations of Cryptography

Foundations of Cryptography Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 7 1 of 18 Cosets Definition 2.12 Let G be a

More information

Simple groups and the classification of finite groups

Simple groups and the classification of finite groups Simple groups and the classification of finite groups 1 Finite groups of small order How can we describe all finite groups? Before we address this question, let s write down a list of all the finite groups

More information

NOTES IN COMMUTATIVE ALGEBRA: PART 2

NOTES IN COMMUTATIVE ALGEBRA: PART 2 NOTES IN COMMUTATIVE ALGEBRA: PART 2 KELLER VANDEBOGERT 1. Completion of a Ring/Module Here we shall consider two seemingly different constructions for the completion of a module and show that indeed they

More information

Algebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...

Algebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3... Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2

More information

SOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have

SOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have Exercise 23. (a) Solve the following congruences: (i) x 101 7 (mod 12) Answer. We have φ(12) = #{1, 5, 7, 11}. Since gcd(7, 12) = 1, we must have gcd(x, 12) = 1. So 1 12 x φ(12) = x 4. Therefore 7 12 x

More information

Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.

Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93. Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)

More information

Name: Solutions Final Exam

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

More information

LECTURE NOTES IN CRYPTOGRAPHY

LECTURE NOTES IN CRYPTOGRAPHY 1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic

More information

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works.

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Analysis I We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Copier s Message These notes may contain errors. In fact, they almost

More information

Frank Moore Algebra 901 Notes Professor: Tom Marley Direct Products of Groups:

Frank Moore Algebra 901 Notes Professor: Tom Marley Direct Products of Groups: Frank Moore Algebra 901 Notes Professor: Tom Marley Direct Products of Groups: Definition: The external direct product is defined to be the following: Let H 1,..., H n be groups. H 1 H 2 H n := {(h 1,...,

More information

LECTURE 2. Hilbert Symbols

LECTURE 2. Hilbert Symbols LECTURE 2 Hilbert Symbols Let be a local field over Q p (though any local field suffices) with char() 2. Note that this includes fields over Q 2, since it is the characteristic of the field, and not the

More information

(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d

(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers

More information

INVERSE LIMITS AND PROFINITE GROUPS

INVERSE LIMITS AND PROFINITE GROUPS INVERSE LIMITS AND PROFINITE GROUPS BRIAN OSSERMAN We discuss the inverse limit construction, and consider the special case of inverse limits of finite groups, which should best be considered as topological

More information

Math 210B: Algebra, Homework 4

Math 210B: Algebra, Homework 4 Math 210B: Algebra, Homework 4 Ian Coley February 5, 2014 Problem 1. Let S be a multiplicative subset in a commutative ring R. Show that the localisation functor R-Mod S 1 R-Mod, M S 1 M, is exact. First,

More information

A Harvard Sampler. Evan Chen. February 23, I crashed a few math classes at Harvard on February 21, Here are notes from the classes.

A Harvard Sampler. Evan Chen. February 23, I crashed a few math classes at Harvard on February 21, Here are notes from the classes. A Harvard Sampler Evan Chen February 23, 2014 I crashed a few math classes at Harvard on February 21, 2014. Here are notes from the classes. 1 MATH 123: Algebra II In this lecture we will make two assumptions.

More information

Chinese Remainder Theorem

Chinese Remainder Theorem Chinese Remainder Theorem Theorem Let R be a Euclidean domain with m 1, m 2,..., m k R. If gcd(m i, m j ) = 1 for 1 i < j k then m = m 1 m 2 m k = lcm(m 1, m 2,..., m k ) and R/m = R/m 1 R/m 2 R/m k ;

More information

QUADRATIC RINGS PETE L. CLARK

QUADRATIC RINGS PETE L. CLARK QUADRATIC RINGS PETE L. CLARK 1. Quadratic fields and quadratic rings Let D be a squarefree integer not equal to 0 or 1. Then D is irrational, and Q[ D], the subring of C obtained by adjoining D to Q,

More information

FACTORIZATION OF IDEALS

FACTORIZATION OF IDEALS FACTORIZATION OF IDEALS 1. General strategy Recall the statement of unique factorization of ideals in Dedekind domains: Theorem 1.1. Let A be a Dedekind domain and I a nonzero ideal of A. Then there are

More information

NOTES ON SIMPLE NUMBER THEORY

NOTES ON SIMPLE NUMBER THEORY NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,

More information

Finite Fields. [Parts from Chapter 16. Also applications of FTGT]

Finite Fields. [Parts from Chapter 16. Also applications of FTGT] Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory

More information

1 Adeles over Q. 1.1 Absolute values

1 Adeles over Q. 1.1 Absolute values 1 Adeles over Q 1.1 Absolute values Definition 1.1.1 (Absolute value) An absolute value on a field F is a nonnegative real valued function on F which satisfies the conditions: (i) x = 0 if and only if

More information

Wednesday, February 21. Today we will begin Course Notes Chapter 5 (Number Theory).

Wednesday, February 21. Today we will begin Course Notes Chapter 5 (Number Theory). Wednesday, February 21 Today we will begin Course Notes Chapter 5 (Number Theory). 1 Return to Chapter 5 In discussing Methods of Proof (Chapter 3, Section 2) we introduced the divisibility relation from

More information

How many units can a commutative ring have?

How many units can a commutative ring have? How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the

More information

Algorithmic number theory. Questions/Complaints About Homework? The division algorithm. Division

Algorithmic number theory. Questions/Complaints About Homework? The division algorithm. Division Questions/Complaints About Homework? Here s the procedure for homework questions/complaints: 1. Read the solutions first. 2. Talk to the person who graded it (check initials) 3. If (1) and (2) don t work,

More information

A Primer on Homological Algebra

A Primer on Homological Algebra A Primer on Homological Algebra Henry Y Chan July 12, 213 1 Modules For people who have taken the algebra sequence, you can pretty much skip the first section Before telling you what a module is, you probably

More information