Math 412: Number Theory Lecture 26 Gaussian Integers II
|
|
- Neal McLaughlin
- 5 years ago
- Views:
Transcription
1 Math 412: Number Theory Lecture 26 Gaussian Integers II Gexin Yu College of William and Mary
2 Let i = 1. Complex numbers of the form a + bi with a, b Z are called Gaussian integers. Let z = a + bi and define the norm N(z) = z 2 = zz = a 2 + b 2 Def: α divides β if β = αγ for some γ Z[i]; and write as α β. Units: e is called a unit if e 1. The units are 1, 1, i, i. When e is a unit, ea is an associate of the Gaussian integer a. Thm: let α and β be Gaussian integers with β 0. Then there exist γ, ρ Z[i] such that α = βγ + ρ, and 0 N(ρ) < N(β). The GCD of two Gaussian integers α and β is the Gaussian integer γ so that (a) γ α and γ β; (b) if δ α and δ β, then δ γ. THM: if α and β are Gaussian integers, not both zero, then there exists a gcd γ of α and β; also there exists u, v Z[i] (Bezout coefficients of α and β) such that γ = uα + vβ.
3 GCD THM: if γ 1 and γ 2 are both gcd of α and β, not both zero, then γ 1 and γ 2 are associates of each other.
4 GCD THM: if γ 1 and γ 2 are both gcd of α and β, not both zero, then γ 1 and γ 2 are associates of each other. Def: α and β are coprime if their gcd are 1, 1, i, i.
5 GCD THM: if γ 1 and γ 2 are both gcd of α and β, not both zero, then γ 1 and γ 2 are associates of each other. Def: α and β are coprime if their gcd are 1, 1, i, i. Euclidean Algorithm: one can do the algorithm so that ρ i = ρ i+1 γ i+1 + r i+2 so that when N(ρ j ) = 0, ρ j 1 is the gcd.
6 Ex: Find the gcd of i and 6 + 5i.
7 Gaussian Prime A nonzero Gaussian integer π is a Gaussian prime if it is not a unit and is divisible only by units and its associates.
8 Gaussian Prime A nonzero Gaussian integer π is a Gaussian prime if it is not a unit and is divisible only by units and its associates. THM: if π is a Gaussian integer and N(π) = p, where p is a rational prime, then π and π are Gaussian primes, and p is not a Gaussian prime.
9 Gaussian Prime A nonzero Gaussian integer π is a Gaussian prime if it is not a unit and is divisible only by units and its associates. THM: if π is a Gaussian integer and N(π) = p, where p is a rational prime, then π and π are Gaussian primes, and p is not a Gaussian prime. Ex: 2 i is a Gaussian prime, and 5 is not a Gaussian prime; 2 + 3i is a Gaussian prime, and 13 is not a Gaussian prime.
10 Gaussian Prime A nonzero Gaussian integer π is a Gaussian prime if it is not a unit and is divisible only by units and its associates. THM: if π is a Gaussian integer and N(π) = p, where p is a rational prime, then π and π are Gaussian primes, and p is not a Gaussian prime. Ex: 2 i is a Gaussian prime, and 5 is not a Gaussian prime; 2 + 3i is a Gaussian prime, and 13 is not a Gaussian prime. Ex: 3 is a Gaussian prime, but N(3) = 9 is not a rational prime.
11 Gaussian Prime A nonzero Gaussian integer π is a Gaussian prime if it is not a unit and is divisible only by units and its associates. THM: if π is a Gaussian integer and N(π) = p, where p is a rational prime, then π and π are Gaussian primes, and p is not a Gaussian prime. Ex: 2 i is a Gaussian prime, and 5 is not a Gaussian prime; 2 + 3i is a Gaussian prime, and 13 is not a Gaussian prime. Ex: 3 is a Gaussian prime, but N(3) = 9 is not a rational prime. Ex: 2 is not a Gaussian prime, since 2 = (1 + i)(1 i), but 1 + i and 1 i are both prime.
12 Unique factorization THM: if π is a Gaussian prime and α and β are Gaussian integers such that π αβ, then π α or π β.
13 Unique factorization THM: if π is a Gaussian prime and α and β are Gaussian integers such that π αβ, then π α or π β. THM: suppose that γ is a nonzero Gaussian integer that is not a unit, then γ can be written as a product of Gaussian primes and up to associates, the factorization is unique.
14 Unique factorization THM: if π is a Gaussian prime and α and β are Gaussian integers such that π αβ, then π α or π β. THM: suppose that γ is a nonzero Gaussian integer that is not a unit, then γ can be written as a product of Gaussian primes and up to associates, the factorization is unique. Ex: 20 = (1 + i) 4 (1 + 2i)(1 2i).
15 Fermat s two square theorem Revisit THM: every prime of the form 4k + 1 can be written as a sum of two perfect squares, and the sum is unique.
16 Fermat s two square theorem Revisit THM: every prime of the form 4k + 1 can be written as a sum of two perfect squares, and the sum is unique. Pf: We observe that t 2 1 (mod p) has a solution, since 1 is quadratic residue modulo p. So p (t 2 + 1) = (t + i)(t i). But p t + i and p t i, so p is not a Gaussian prime. Let p = αβ. Then N(p) = N(αβ) = N(α)N(β) and thus p = N(α) = N(β).
17 Fermat s two square theorem Revisit THM: every prime of the form 4k + 1 can be written as a sum of two perfect squares, and the sum is unique. Pf: We observe that t 2 1 (mod p) has a solution, since 1 is quadratic residue modulo p. So p (t 2 + 1) = (t + i)(t i). But p t + i and p t i, so p is not a Gaussian prime. Let p = αβ. Then N(p) = N(αβ) = N(α)N(β) and thus p = N(α) = N(β). Lem: Let π be a Gaussian prime, then there is exactly one rational prime p such that π p.
18 Fermat s two square theorem Revisit THM: every prime of the form 4k + 1 can be written as a sum of two perfect squares, and the sum is unique. Pf: We observe that t 2 1 (mod p) has a solution, since 1 is quadratic residue modulo p. So p (t 2 + 1) = (t + i)(t i). But p t + i and p t i, so p is not a Gaussian prime. Let p = αβ. Then N(p) = N(αβ) = N(α)N(β) and thus p = N(α) = N(β). Lem: Let π be a Gaussian prime, then there is exactly one rational prime p such that π p. pf: π π = N(π) = p 1 p 2..p k, so π p i for some i. If π p 1 and π p 2, then π mp 1 + np 2 = 1, so π is a unit.
19 THM: let p be a rational prime. Then
20 THM: let p be a rational prime. Then (a) if p = 2, then p = (1 + i)(1 i) = i(1 i) 2 ;
21 THM: let p be a rational prime. Then (a) if p = 2, then p = (1 + i)(1 i) = i(1 i) 2 ; (b) if p 3 (mod 4), then p is a Gaussian prime.
22 THM: let p be a rational prime. Then (a) if p = 2, then p = (1 + i)(1 i) = i(1 i) 2 ; (b) if p 3 (mod 4), then p is a Gaussian prime. (c) if p 1 (mod 4), then p = ππ, where π and π are Gaussian primes that are not associates with N(π) = N(π ) = p.
23 THM: let p be a rational prime. Then (a) if p = 2, then p = (1 + i)(1 i) = i(1 i) 2 ; (b) if p 3 (mod 4), then p is a Gaussian prime. (c) if p 1 (mod 4), then p = ππ, where π and π are Gaussian primes that are not associates with N(π) = N(π ) = p. THM: if n = 2 m p e pe k k qf 1 1..qt ft with m 0, f i even, and p i of form 4t + 1, and q i of form 4t + 3, then n has 4(e 1 + 1)(e 2 + 1)...(e k + 1) ways to write as a sum of two squares.
24 Pythagorean triples: another application of Gaussian integers z 2 = x 2 + y 2 = (x + yi)(x yi):
25 Pythagorean triples: another application of Gaussian integers z 2 = x 2 + y 2 = (x + yi)(x yi): Claim: if (x, y) = 1 as rational integers, then x + yi and x yi are coprime as Gaussian integers.
26 Pythagorean triples: another application of Gaussian integers z 2 = x 2 + y 2 = (x + yi)(x yi): Claim: if (x, y) = 1 as rational integers, then x + yi and x yi are coprime as Gaussian integers. Lemma: if αβ = γ 2 and α and β are coprime, then α = uδ1 2 and β = δ2 2 /u, where u is a unit. (hw)
27 Pythagorean triples: another application of Gaussian integers z 2 = x 2 + y 2 = (x + yi)(x yi): Claim: if (x, y) = 1 as rational integers, then x + yi and x yi are coprime as Gaussian integers. Lemma: if αβ = γ 2 and α and β are coprime, then α = uδ1 2 and β = δ2 2 /u, where u is a unit. (hw) Therefore we have x + yi = (s + ti) 2, (s + ti) 2, i(s + ti) 2, i(s + ti) 2.
Math 412: Number Theory Lecture 25 Gaussian Integers
Math 412: Number Theory Lecture 25 Gaussian Integers Gexin Yu gyu@wm.edu College of William and Mary Gaussian Integers and norm function Let i = p 1. Complex numbers of the form a + bi with a, b 2 Z are
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
More informationSchool of Mathematics
School of Mathematics Programmes in the School of Mathematics Programmes including Mathematics Final Examination Final Examination 06 22498 MSM3P05 Level H Number Theory 06 16214 MSM4P05 Level M Number
More informationSolving 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. In particular if a b then N(
Gaussian Integers II Let us summarise what we now about Gaussian integers so far: If a, b Z[ i], then N( ab) N( a) N( b). In particular if a b then N( a ) N( b). Let z Z[i]. If N( z ) is an integer prime,
More informationHomework 6 Solution. Math 113 Summer 2016.
Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x
More informationTHE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION ADVANCED ALGEBRA I.
THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION 2006 110.401 - ADVANCED ALGEBRA I. Examiner: Professor C. Consani Duration: take home final. No calculators allowed.
More informationLecture Notes for Math 492 Fall 2014 (Algebraic Number Theory)
Lecture Notes for Math 49 Fall 014 (Algebraic Number Theory) 1. Outline: Properties of the integers through unique factorization. The division algorithm and Euclid s algorithm. Greatest common divisor,
More informationIntroduction to Algebraic Number Theory Part I
Introduction to Algebraic Number Theory Part I A. S. Mosunov University of Waterloo Math Circles November 7th, 2018 Goals Explore the area of mathematics called Algebraic Number Theory. Specifically, we
More informationMath 412: Number Theory Lecture 3: Prime Decomposition of
Math 412: Number Theory Lecture 3: Prime Decomposition of Integers Gexin Yu gyu@wm.edu College of William and Mary Prime numbers Definition: a (positive) integer p is prime if p has no divisor other than
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationOSTROWSKI S THEOREM FOR Q(i)
OSTROWSKI S THEOREM FOR Q(i) KEITH CONRAD We will extend Ostrowki s theorem from Q to the quadratic field Q(i). On Q, every nonarchimedean absolute value is equivalent to the p-adic absolute value for
More informationQUADRATIC 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 informationTHE GAUSSIAN INTEGERS
THE GAUSSIAN INTEGERS KEITH CONRAD Since the work of Gauss, number theorists have been interested in analogues of Z where concepts from arithmetic can also be developed. The example we will look at in
More information1. Fermat, Euler, and Nonunique Factorization
1. Fermat, Euler, and Nonunique Factorization The purpose of this chapter is mainly motivational. More precise definitions of the objects we will study will be given later. 1.1 Euler and Quadratic Irrationals
More informationMath Theory of Number Homework 1
Math 4050 Theory of Number Homework 1 Due Wednesday, 015-09-09, in class Do 5 of the following 7 problems. Please only attempt 5 because I will only grade 5. 1. Find all rational numbers and y satisfying
More informationMATH 216T TOPICS IN NUMBER THEORY
California State University, Fresno MATH 6T TOPICS IN NUMBER THEORY Spring 00 Instructor : Stefaan Delcroix Chapter Diophantine Equations Definition. Let f(x,..., x n ) be a polynomial with integral coefficients
More informationJust like the ring of Gaussian integers, the ring of Eisenstein integers is a Unique Factorization Domain.
Fermat s Infinite Descent PMATH 340 Assignment 6 (Due Monday April 3rd at noon). (0 marks) Use Femtat s method of infinite descent to prove that the Diophantine equation x 3 + y 3 = 4z 3 has no solutions
More informationApplication of the Euler Phi Function in the Set of Gaussian Integers
University of North Georgia Nighthawks Open Institutional Repository Honors Theses Honors Program 2015 Application of the Euler Phi Function in the Set of Gaussian Integers Catrina A. May University of
More informationContinuing the pre/review of the simple (!?) case...
Continuing the pre/review of the simple (!?) case... Garrett 09-16-011 1 So far, we have sketched the connection between prime numbers, and zeros of the zeta function, given by Riemann s formula p m
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationPerfect Numbers in Quadratic Rings of Integers
Julius-Maximilians-Universität Würzburg Fakultät für Mathematik und Informatik Institut für Mathematik Master Thesis Perfect Numbers in Quadratic Rings of Integers Author: Patrick Giron Supervisor: Prof.
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationMath 412: Number Theory Lecture 13 Applications of
Math 412: Number Theory Lecture 13 Applications of Gexin Yu gyu@wm.edu College of William and Mary Partition of integers A partition λ of the positive integer n is a non increasing sequence of positive
More informationChuck Garner, Ph.D. May 25, 2009 / Georgia ARML Practice
Some Chuck, Ph.D. Department of Mathematics Rockdale Magnet School for Science Technology May 25, 2009 / Georgia ARML Practice Outline 1 2 3 4 Outline 1 2 3 4 Warm-Up Problem Problem Find all positive
More informationEfficient algorithms for gcd and cubic residuosity in the ring of Eisenstein integers
Efficient algorithms for gcd and cubic residuosity in the ring of Eisenstein integers Ivan Bjerre Damgård and Gudmund Skovbjerg Frandsen BRICS Department of Computer Science University of Aarhus Ny Munkegade
More informationMATH 216T TOPICS IN NUMBER THEORY
California State University, Fresno MATH 6T TOPICS IN NUMBER THEORY Spring 008 Instructor : Stefaan Delcroix Chapter Diophantine Equations Definition. Let f(x,..., x n ) be a polynomial with integral coefficients
More informationM381 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 informationExtension and Generalization of Fermat s Little Theorem to the Gaussian Integers
Ball State Undergraduate Mathematics Exchange http://www.bsu.edu/libraries/beneficencepress/mathexchange Vol. 0, No. (Fall 206) Pages 22-30 Extension and Generalization of Fermat s Little Theorem to the
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationPRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.
PRACTICE FINAL MATH 18.703, MIT, SPRING 13 You have three hours. This test is closed book, closed notes, no calculators. There are 11 problems, and the total number of points is 180. Show all your work.
More informationDivisibility Sequences for Elliptic Curves with Complex Multiplication
Divisibility Sequences for Elliptic Curves with Complex Multiplication Master s thesis, Universiteit Utrecht supervisor: Gunther Cornelissen Universiteit Leiden Journées Arithmétiques, Edinburgh, July
More informationM3P14 LECTURE NOTES 8: QUADRATIC RINGS AND EUCLIDEAN DOMAINS
M3P14 LECTURE NOTES 8: QUADRATIC RINGS AND EUCLIDEAN DOMAINS 1. The Gaussian Integers Definition 1.1. The ring of Gaussian integers, denoted Z[i], is the subring of C consisting of all complex numbers
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 J. E. CREMONA Contents 0. Introduction: What is Number Theory? 2 Basic Notation 3 1. Factorization 4 1.1. Divisibility in Z 4 1.2. Greatest Common
More informationPerspectives of Mathematics
Perspectives of Mathematics Module on Diophantine Equations and Geometry Fall 2004 Michael Stoll What is a diophantine equation? 1. Introduction and Examples Being diophantine is not so much a property
More informationNumber Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:
Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1
More informationSPECIAL CASES OF THE CLASS NUMBER FORMULA
SPECIAL CASES OF THE CLASS NUMBER FORMULA What we know from last time regarding general theory: Each quadratic extension K of Q has an associated discriminant D K (which uniquely determines K), and an
More informationMATH 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 informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationContents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains
Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and
More informationChapter 1. From Euclid to Gauss. 1.1 Prime numbers. If a, b Z we say that a divides b (or is a divisor of b) and we write a b, if.
Chapter 1 From Euclid to Gauss 1.1 Prime numbers If a, b Z we say that a divides b (or is a divisor of b) and we write a b, if for some c Z. Thus 2 0 but 0 2. b = ac Definition 1.1. The number p N is said
More informationA CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract
A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave
More informationCongruence of Integers
Congruence of Integers November 14, 2013 Week 11-12 1 Congruence of Integers Definition 1. Let m be a positive integer. For integers a and b, if m divides b a, we say that a is congruent to b modulo m,
More informationStudy Guide and Intervention
Study Guide and Intervention Pure Imaginary Numbers A square root of a number n is a number whose square is n. For nonnegative real numbers a and b, ab = a b and a b = a, b 0. b The imaginary unit i is
More informationMODEL ANSWERS TO HWK #10
MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it
More informationMATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.
MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number
More informationTHUE S LEMMA AND IDONEAL QUADRATIC FORMS
THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Abstract. The representation of integers by binary quadratic forms is one of the oldest problems in number theory, going back at least to Fermat s
More information1. 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 informationFactorization of zeta-functions, reciprocity laws, non-vanishing
(January, 0 Factorization of zeta-functions, reciprocity laws, non-vanishing Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/. Gaussian integers o Z[i]. Eisenstein integers o Z[ω] 3.
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also
More informationTHUE S LEMMA AND IDONEAL QUADRATIC FORMS
THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Introduction Recently I learned about Thue s Lemma, an elementary result on congruences due to the Norwegian mathematician Axel Thue (1863-1922).
More informationMath 1302 Notes 2. How many solutions? What type of solution in the real number system? What kind of equation is it?
Math 1302 Notes 2 We know that x 2 + 4 = 0 has How many solutions? What type of solution in the real number system? What kind of equation is it? What happens if we enlarge our current system? Remember
More information4 Number Theory and Cryptography
4 Number Theory and Cryptography 4.1 Divisibility and Modular Arithmetic This section introduces the basics of number theory number theory is the part of mathematics involving integers and their properties.
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationQuadratics. Shawn Godin. Cairine Wilson S.S Orleans, ON October 14, 2017
Quadratics Shawn Godin Cairine Wilson S.S Orleans, ON Shawn.Godin@ocdsb.ca October 14, 2017 Shawn Godin (Cairine Wilson S.S.) Quadratics October 14, 2017 1 / 110 Binary Quadratic Form A form is a homogeneous
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Define and use the congruence modulo m equivalence relation Perform computations using modular arithmetic
More informationNumber Theory. Final Exam from Spring Solutions
Number Theory. Final Exam from Spring 2013. Solutions 1. (a) (5 pts) Let d be a positive integer which is not a perfect square. Prove that Pell s equation x 2 dy 2 = 1 has a solution (x, y) with x > 0,
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationINTEGERS. 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 informationMATH 310: Homework 7
1 MATH 310: Homework 7 Due Thursday, 12/1 in class Reading: Davenport III.1, III.2, III.3, III.4, III.5 1. Show that x is a root of unity modulo m if and only if (x, m 1. (Hint: Use Euler s theorem and
More information(January 14, 2009) q n 1 q d 1. D = q n = q + d
(January 14, 2009) [10.1] Prove that a finite division ring D (a not-necessarily commutative ring with 1 in which any non-zero element has a multiplicative inverse) is commutative. (This is due to Wedderburn.)
More informationA CLASSIFICATION OF GAUSSIAN PRIMES
A CLASSIFICATION OF GAUSSIAN PRIMES LEE A. BUTLER Abstract. This essay gives an elementary classification of the prime elements of Z[i], the Gaussian integers. 2 LEE A. BUTLER The history of our number
More informationMATH 152 Problem set 6 solutions
MATH 52 Problem set 6 solutions. Z[ 2] is a Euclidean domain (i.e. has a division algorithm): the idea is to approximate the quotient by an element in Z[ 2]. More precisely, let a+b 2, c+d 2 Z[ 2] (of
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationCS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II
CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
More informationTHE NUMBERS THAT CAN BE REPRESENTED BY A SPECIAL CUBIC POLYNOMIAL
Commun. Korean Math. Soc. 25 (2010), No. 2, pp. 167 171 DOI 10.4134/CKMS.2010.25.2.167 THE NUMBERS THAT CAN BE REPRESENTED BY A SPECIAL CUBIC POLYNOMIAL Doo Sung Park, Seung Jin Bang, and Jung Oh Choi
More informationMATH 361: NUMBER THEORY TWELFTH LECTURE. 2 The subjects of this lecture are the arithmetic of the ring
MATH 361: NUMBER THEORY TWELFTH LECTURE Let ω = ζ 3 = e 2πi/3 = 1 + 3. 2 The subjects of this lecture are the arithmetic of the ring and the cubic reciprocity law. D = Z[ω], 1. Unique Factorization The
More informationQuadratic Prime-Generating Polynomials Over the Gaussian Integers
Quadratic Prime-Generating Polynomials Over the Gaussian Integers Frank Fuentes Monta Meirose Erik R. Tou March 23, 2017 1 Introduction In 1772 [2], the Swiss mathematician Leonhard Euler discovered that
More informationALGEBRAIC NUMBER THEORY - COURSE NOTES
ALGEBRAIC NUMBER THEORY - COURSE NOTES STEVE DONNELLY Housekeeping (1) There ll be a final exam (3 hours or so) on the whole semester (representation theory and algebraic number theory) weighted towards
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationMath 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.
Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let
More information44.(ii) In this case we have that (12, 38) = 2 which does not divide 5 and so there are no solutions.
Solutions to Assignment 3 5E More Properties of Congruence 40. We can factor 729 = 7 3 9 so it is enough to show that 3 728 (mod 7), 3 728 (mod 3) and 3 728 (mod 9). 3 728 =(3 3 ) 576 = (27) 576 ( ) 576
More informationRings and modular arithmetic
Chapter 8 Rings and modular arithmetic So far, we have been working with just one operation at a time. But standard number systems, such as Z, have two operations + and which interact. It is useful to
More informationFibonacci Diophantine Triples
Fibonacci Diophantine Triples Florian Luca Instituto de Matemáticas Universidad Nacional Autonoma de México C.P. 58180, Morelia, Michoacán, México fluca@matmor.unam.mx László Szalay Institute of Mathematics
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationTOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction
TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS KEITH CONRAD A (monic) polynomial in Z[T ], 1. Introduction f(t ) = T n + c n 1 T n 1 + + c 1 T + c 0, is Eisenstein at a prime p when each coefficient
More informationLecture 7.5: Euclidean domains and algebraic integers
Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley
More informationRSA in extensions of the ring of integers
Degree project RSA in extensions of the ring of integers Author: Alessia Pina Supervisor: Per-Anders Svensson Examiner: Karl-Olof Lindahl Date: 2017-12-22 Course Code: 5MA41E Subject: Mathematics Level:
More informationDiscrete Math, Fourteenth Problem Set (July 18)
Discrete Math, Fourteenth Problem Set (July 18) REU 2003 Instructor: László Babai Scribe: Ivona Bezakova 0.1 Repeated Squaring For the primality test we need to compute a X 1 (mod X). There are two problems
More informationTomáš Madaras Congruence classes
Congruence classes For given integer m 2, the congruence relation modulo m at the set Z is the equivalence relation, thus, it provides a corresponding partition of Z into mutually disjoint sets. Definition
More informationPrimes. Rational, Gaussian, Industrial Strength, etc. Robert Campbell 11/29/2010 1
Primes Rational, Gaussian, Industrial Strength, etc Robert Campbell 11/29/2010 1 Primes and Theory Number Theory to Abstract Algebra History Euclid to Wiles Computation pencil to supercomputer Practical
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationarxiv: v1 [math.nt] 29 Feb 2016
PERFECT NUMBERS IN THE RING OF EISENSTEIN INTEGERS ZACHARY PARKER, JEFF RUSHALL, AND JORDAN HUNT arxiv:1602.09106v1 [math.nt] 29 Feb 2016 Abstract. One of the many number theoretic topics investigated
More informationNumber Theory and Group Theoryfor Public-Key Cryptography
Number Theory and Group Theory for Public-Key Cryptography TDA352, DIT250 Wissam Aoudi Chalmers University of Technology November 21, 2017 Wissam Aoudi Number Theory and Group Theoryfor Public-Key Cryptography
More informationMath Midterm Solutions
Math 145 - Midterm Solutions Problem 1. (10 points.) Let n 2, and let S = {a 1,..., a n } be a finite set with n elements in A 1. (i) Show that the quasi-affine set A 1 \ S is isomorphic to an affine set.
More information7.2 Applications of Euler s and Fermat s Theorem.
7.2 Applications of Euler s and Fermat s Theorem. i) Finding and using inverses. From Fermat s Little Theorem we see that if p is prime and p a then a p 1 1 mod p, or equivalently a p 2 a 1 mod p. This
More informationIdeals: Definitions & Examples
Ideals: Definitions & Examples Defn: An ideal I of a commutative ring R is a subset of R such that for a, b I and r R we have a + b, a b, ra I Examples: All ideals of Z have form nz = (n) = {..., n, 0,
More informationCISC-102 Winter 2016 Lecture 11 Greatest Common Divisor
CISC-102 Winter 2016 Lecture 11 Greatest Common Divisor Consider any two integers, a,b, at least one non-zero. If we list the positive divisors in numeric order from smallest to largest, we would get two
More informationNumber theory (Chapter 4)
EECS 203 Spring 2016 Lecture 10 Page 1 of 8 Number theory (Chapter 4) Review Questions: 1. Does 5 1? Does 1 5? 2. Does (129+63) mod 10 = (129 mod 10)+(63 mod 10)? 3. Does (129+63) mod 10 = ((129 mod 10)+(63
More informationGAUSSIAN INTEGERS HUNG HO
GAUSSIAN INTEGERS HUNG HO Abstract. We will investigate the ring of Gaussian integers Z[i] = {a + bi a, b Z}. First we will show that this ring shares an imortant roerty with the ring of integers: every
More informationMath 210B: Algebra, Homework 1
Math 210B: Algebra, Homework 1 Ian Coley January 15, 201 Problem 1. Show that over any field there exist infinitely many non-associate irreducible polynomials. Recall that by Homework 9, Exercise 8 of
More informationAlgorithms. Shanks square forms algorithm Williams p+1 Quadratic Sieve Dixon s Random Squares Algorithm
Alex Sundling Algorithms Shanks square forms algorithm Williams p+1 Quadratic Sieve Dixon s Random Squares Algorithm Shanks Square Forms Created by Daniel Shanks as an improvement on Fermat s factorization
More informationON THE EXTENSIBILITY OF DIOPHANTINE TRIPLES {k 1, k + 1, 4k} FOR GAUSSIAN INTEGERS. Zrinka Franušić University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 43(63)(2008), 265 291 ON THE EXTENSIBILITY OF DIOPHANTINE TRIPLES {k 1, k + 1, 4k} FOR GAUSSIAN INTEGERS Zrinka Franušić University of Zagreb, Croatia Abstract. In this paper,
More informationNUMBER THEORY AND CODES. Álvaro Pelayo WUSTL
NUMBER THEORY AND CODES Álvaro Pelayo WUSTL Talk Goal To develop codes of the sort can tell the world how to put messages in code (public key cryptography) only you can decode them Structure of Talk Part
More informationMathematics of Cryptography
Modulo arithmetic Fermat's Little Theorem If p is prime and 0 < a < p, then a p 1 = 1 mod p Ex: 3 (5 1) = 81 = 1 mod 5 36 (29 1) = 37711171281396032013366321198900157303750656 = 1 mod 29 (see http://gauss.ececs.uc.edu/courses/c472/java/fermat/fermat.html)
More informationHomework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn
Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn Problem 1: 4.4 # 2:x 3 + 8x 2 x 1 0 (mod 1331). a) x 3 + 8x 2 x 1 0 (mod 11). This does not break down, so trial and error gives: x = 0 : f(0)
More informationGalois theory (Part II)( ) Example Sheet 1
Galois theory (Part II)(2015 2016) Example Sheet 1 c.birkar@dpmms.cam.ac.uk (1) Find the minimal polynomial of 2 + 3 over Q. (2) Let K L be a finite field extension such that [L : K] is prime. Show that
More information