A p-adic Euclidean Algorithm
|
|
- William McCarthy
- 5 years ago
- Views:
Transcription
1 A p-adic Euclidean Algorithm Cortney Lager Winona State University October 0, 009 Introduction The rational numbers can be completed with respect to the standard absolute value and this produces the real numbers However, there are other absolute values on the rationals besides the standard one Completing the rationals with respect to one of these produces the p-adic numbers In this paper, we take some basic number theory concepts and apply them to rational p-adic numbers Using these concepts, a p-adic division algorithm is developed along with a p-adic Euclidean Algorithm These algorithms produce a generalized greatest common divisor in the p-adics along with a p-adic simple continued fraction In Section, we describe the p-adic numbers, and in Section 3 we present our p- adic Division Algorithm and Euclidean Algorithm In Section 4, we show some applications, including a connection to Browkin s p-adic continued fractions, which motivatored our investigations in the first place Finally, in Section 5, we give some open questions for further study p-adic Numbers Since we will use different absolute value functions in this paper, to avoid confusion we will denote the standard absolute value as rather than For each prime p there exists an absolute value on the rationals p : Q Q defined by a = p v(b) v(a) b p where v(n) is the number of times p divides the integer n Also 0 p = 0 This is called a p-adic absolute value, and in the context of measuring the size of a number (ie its distance to zero), it states that the more a rational number is divisible by p, the smaller it is For example, 6 3 = 3 4 < 5 7 = So 6 is smaller than 5 7 in the 3-adics
2 Completing the rationals with respect to the p-adic absolute value yields Q p, the p-adic numbers Let p be an odd prime for the remainder of the paper Then there are a few different ways to think about p-adic numbers ([],[3], [4], [5]) but for the purposes of this paper we will consider them in the following way Definition An element ζ Q p is a Laurent series in the odd prime p, ζ = c j p j = c m p m + c m+ p m+ + c m+ p m+ + () j=m where m is a (possibly negative) integer and c j { p,, p } Note that in the standard absolute value, the p-series in () would only converge if it had a finite number of terms However, under the p-adic absolute value, each term is in fact getting smaller, and it can be shown [3] that all such infinite Laurent series in p converge under the p-adic absolute value It s also worth noting that the rational numbers are a subset of the p-adics, although they are slightly disguised For example, / in the 7-adics is given by the power series Since the geometric series test still applies to the p-adic absolute value and to convergence in Q p, then it gives the following, ( ) = + 3 = 7 For the remainder of the paper we will use the fractional representation instead of the p-series for rationals elements of Q Q p Using the notation in (), we can define v(ζ) = m, thus ζ p = p m Further, every ζ Q p \{0} can be written as ζ = up ɛ, where ɛ = v(ζ) and u p = We also have the standard properties of a non-archimedean norm: ζ ζ p = ζ p ζ p and ζ + ζ p max( ζ p, ζ p ) The non-archimedean triangle inequality gives equality if ζ p ζ p 3 The p-adic Division Algorithm and Euclidean Algorithm Both the division algorithm and the Euclidean algorithm are elements of classical number theory With the goal of recreating the real aspects of classical number theory in the p-adics, we now re-invent these two important classical ] = { m p k algorithms Let Z [ p m, k Z addition and multiplication; in fact, it is a subring of Q } Notice that Z [ is closed under
3 Theorem (p-adic Division Algorithm) Let p be an odd prime Then given any σ and τ Q p where τ 0, there exists uniquely q Z [ with q < p, and η Q p with η p < τ p such that σ = qτ + η Proof If σ p < τ p, then let q = 0 and η=σ Otherwise, write σ=sp v(σ), τ=tp v(τ) where s p = t p = Let q = qp v(σ) v(τ), where q Z such that q st mod p v(τ) v(σ)+ and q < p v(τ) v(σ)+ / Then q < p Then let η = spv(σ) qtp v(τ) = (s qt)p v(σ) Thus, v(τ) + v(η) and therefore η p < τ p To prove uniqueness, suppose σ = τq + η = τq + η where q = m p k, and q = m p k Then, τ(q q ) = η η Thus, τ p q q p = τ(q q ) p = η η p max( η p, η p ) < τ p, which implies that p q q = m m Thus, p k+ m m However, since p k q q < p, then m m < p k+ Hence, m = m, q = q, and η = η Note in the proof of Theorem that if q 0, then in fact p q, and therefore v(q) = v(σ) v(τ) 0; that is q p Since we now have a division algorithm in the p-adics, we can iterate the process in a way similar to the classical Euclidean Algorithm Definition (p-adic Euclidean Algorithm) Let p be an odd prime The p-adic Euclidean Algorithm applied to σ and τ Q p and where τ 0 is as follows First, apply Theorem to σ and τ to produce σ = q τ + η () In each subsequent step shift to the left and apply Theorem again, τ = q η + η η = q 3 η + η 3 η i = q i η i + η i (3) This process either continues indefinitely or stops when η i = 0 The outputs of this algorithm are the sequences {q i } and {η i } When appropriate we will consider the inputs as σ = η and τ = η 0 3
4 Example The 7-adic Euclidean Algorithm applied to 865 and 0555 yields ( ) 0555 ) ( 9360 = () + 7 ( ) ( ) ( ) = ( ) ( ) ( ) ( ) ( ) ( ) = ( ) ( ) = = The algorithm stops since η 5 = 0 The outputs are the sequences { {q i } =, 7, 0 7, 50 7, } 7 and {η i } = { , 5 7, 5 74, 5 } 75 Lemma Let η i be the outputs from the p-adic Euclidean Algorithm of σ = a b pv(σ) Q, τ = c d pv(τ) Q when a b and c d are in lowest terms Then lcm(b, d) η i Z [ Proof Let l = lcm(b, d) From multiplying through by l in (), la b pv(σ) = q lc d pv(τ) + lη Since la b pv(σ), q lc d pv(τ) Z [ ] p then lη Z [ Then, inductively lη i = q i lη i + lη i [ with lη i, q i lη i Z [ Thus, lηi Z Theorem Let p be an odd prime and σ, τ Q with τ 0 Then the p-adic Euclidean Algorithm applied to σ and τ has a finite number of steps Proof For all i such that q i, η i 0, write η i = h i p ɛ i and q i = c i p δ i where ɛ i = v(η i ), δ i = v(q i ), and h i p = c i p = Then we have the following (i) By Theorem and the note afterwards, v(q i ) = v(η i ) v(η i ) Thus δ i = ɛ i ɛ i (ii) Also, ɛ i ɛ i + which implies ɛ i > ɛ i, and p ] 4
5 (iii) c i < p δ i since c i p δ i < p Then by (3), h i = p ɛi ɛi (h i c i h i ), where h i, c i Q Q p, and therefore h i p ɛi ɛi ( h i + c i h i ) by the Triangle Inequality < p ɛ i ɛ i ( h i + p δ i h i ) by (iii) = p ɛi ɛi ( h i + p+ɛi ɛi h i ) by (i) = p ɛ i ɛ i h i + p ɛ i+ɛ i h i < h i + h i by (ii) Thus, h i < h i + h i Now consider the sequence { h i + h i } of positive rational numbers From the previous inequality, h i + h i < h i + h i Therefore, h i + h i is decreasing If σ = a b pv(σ) and τ = c d pv(τ), and l = lcm(b, d), then, by the Lemma, l h i + l h i Z Therefore, l h i +l h i = 0 for some finite i and thus the p-adic Euclidean Algorithm has a finite number of steps for rational inputs 4 Applications of the p-adic Euclidean Algorithm 4 Greatest Common Divisor Recall the following definition Definition 3 Let a, b Z, not both zero Then the greatest common divisor, or gcd, of a and b is the unique positive integer g = gcd(a, b) that satisfies the following properties (i) a g, b g Z, and (ii) if there exists f Z with a f, b f Z, then g f Z We can extend the definition of the gcd to t, s Q, where t = a b and s = c d are in lowest terms, by setting gcd(t, s) = gcd(a, c) lcm(b, d) This satisfies the properties that if g = gcd(t, s) then t g, s g Z and if there exists f Q with t g, s g Z, then g f Z Recall that the classical Euclidean Algorithm applied to integers a and b computes gcd(a, b) as the last non-zero remainder The p-adic Euclidean Algorithm produces a similar computation 5
6 Theorem 3 Let nonzero σ, τ Q Q p, with σ = sp v(σ), τ = tp v(τ) Suppose the p-adic Euclidean Algorithm applied to σ and τ stops after k steps and let η i = h i p v(ηi) Then h k = gcd(t, s) Proof Since η k = q k η k then n k η k = q k Z [ ] p and thus, h k h k Z Then, proceeding inductively backwards through the p-adic Euclidean Algorithm, Hence, η k i η k = q k i η k i η k s h k = h h k Z and + η k i η k Z [ p ] t h k = h 0 h k Z Now suppose f Q such that t f, s f Z Note that v(f) 0, since v(s) = v(t) = 0, then h p v(η ) = t s f f pv(τ) q f pv(σ) Z [ ] p Thus, h f Z Then again, inductively h k f Z Our previous example of the p-adic Euclidean Algorithm shows that ( =, 0555 ) Although this computation may seem trivial when the rational numbers are presented as fractions, all calculations in the p-adic Euclidean algorithm are amenable to elements of Q p expressed as in () 4 Simple Continued Fractions In addition to the gcd, the classical Euclidean Algorithm also computes the simple continued fraction form of a b : a b = q + q + q 3 + = [q, q, q 3, ] where q i Z are the quotients obtained during the Euclidean algorithm In [] Browkin defined a simple continued fraction form of a p-adic number, ζ, as follows: ζ = b + = [b, b, b 3, ] b + b 3 + where b i Q with b i < p The following summarizes Browkin s method 6
7 For ζ with v(ζ) = m as in () define π(ζ) = { 0 if m > 0 0 j=m c jp j otherwise Theorem 4 (Browkin) Let ζ Q p \{0}, and let ζ = ζ For i, let b i = π(ζ i ), ζ i+ = (ζ i b i ) until ζ i b i = 0, then ζ = [b, b, b 3, ] The following theorem relates Browkin s method to the p-adic Euclidean Algorithm In fact, our proof of Theorem was strongly motivated by the stopping theorem in [] Theorem 5 Let ζ Q p \{0}, and let {q i } be the outputs of the p-adic Euclidean Algorithm applied to ζ and Then ζ = [q, q, q 3, ] Proof It suffices to show q i = b i However, we will also prove that ζ i = η i η i We proceed by induction In the base case, ζ = ζ = ζ = η η 0 Now, let ζ be as in (), then ( b = c j p j p c j p j j=m j=m j=m ( ) 0 p = j=m ) p j p j = p p p m p < p Also, ζ b p = ζ π(ζ ) p < = p Then since ζ = b +(ζ b ), by the uniqueness of the p-adic division algorithm, b = q In the inductive case, assume q i = b i and ζ i = η i η i Then, Thus, ζ i+ = η i n i Now consider (ζ i+ ) = ζ i b i = η i η i q i = η i q i η i η i = η i η i η i = b i+ η i + (η i b i+ η i ) Using the same logic from the base case, b i+ < p, and η i b i+ η i p = η i p ζ i+ b i+ p < η i p Thus, by the uniqueness of the p-adic division algorithm b i+ = q i+ Therefore, q i = b i, and by Theorem 4, ζ = [q, q, q 3, ] 7
8 Using the theorem in our previous example computes that = Even though the p-adic Euclidean Algorithm and Browkin s method produce the same results, the p-adic Euclidean Algorithm is computationally quicker since performing the p-adic division algorithm only requires an inversion modulo a prime power Further Theorem 5 tells us exactly under what conditions the p-adic Euclidean Algorithm terminates Corollary For σ, τ Q p, τ 0, the p-adic Euclidean Algorithm terminates in a finite number of steps if and only if σ/τ Q 5 Open Questions The following questions concerning the techniques discussed in this paper remain open to the authors How does the sequence {η i } from the computation (σ, τ) relate to the sequence {η i } from computing (τ, σ)? Examples quickly show that they are not always related in the simple way the remainders are in the classical case Do we have to use the modular representatives { p p } or would another set of representatives also work? Again, small examples will show that if we choose {0,, p } as the set of representatives, the p-adic Euclidean Algorithm applied to two rational numbers may not terminate In a more general setting, do the representatives depend on the choice of uniformizer for the local field? In the classical setting the division algorithm leads to modular arithmetic Is there a similar theory to come from the p-adic division algorithm? Lastly, as is always the case, an analagous theory remains to be worked out in the -adics Acknowledgements: The author would like to thank Erica Fremstad, another Winona State University student, who also worked on the independent study, Dr Eric Errthum for his mentorship throughout this project, and the anonymous reviewer for the many helpful comments 8
9 References [] Browkin, J Continued Fractions in Local Fields, Demonstratio Mathematica, 978 [] Gouvea, F p-adic Numbers: An Introduction, Universitext, Springer- Verlag, Berline, 993 [3] Koblitz, B p-adic Numbers, p-adic Analysis, and Zeta-Functions, Springer- Verlag, 984, nd ed [4] Rotman, J Advanced Modern Algebra, Prentice Hall, 00 [5] Serre, J-P A Course in Arithmetic, Springer, 973 9
4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationThe Euclidean Algorithm and Multiplicative Inverses
1 The Euclidean Algorithm and Multiplicative Inverses Lecture notes for Access 2009 The Euclidean Algorithm is a set of instructions for finding the greatest common divisor of any two positive integers.
More informationNOTES 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 informationCOMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635
COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationCh 4.2 Divisibility Properties
Ch 4.2 Divisibility Properties - Prime numbers and composite numbers - Procedure for determining whether or not a positive integer is a prime - GCF: procedure for finding gcf (Euclidean Algorithm) - Definition:
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 information5: The Integers (An introduction to Number Theory)
c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset
More information2. 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 informationElementary Properties of the Integers
Elementary Properties of the Integers 1 1. Basis Representation Theorem (Thm 1-3) 2. Euclid s Division Lemma (Thm 2-1) 3. Greatest Common Divisor 4. Properties of Prime Numbers 5. Fundamental Theorem of
More informationSolutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010.
Solutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010. (24) The p-adic numbers. Let p {2, 3, 5, 7, 11,... } be a prime number. (a) For x Q, define { 0 for x = 0, x p = p n for x = p n (a/b),
More informationp-adic Continued Fractions
p-adic Continued Fractions Matthew Moore May 4, 2006 Abstract Simple continued fractions in R have a single definition and algorithms for calculating them are well known. There also exists a well known
More information2 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 informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #5 09/19/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #5 09/19/2013 5.1 The field of p-adic numbers Definition 5.1. The field of p-adic numbers Q p is the fraction field of Z p. As a fraction field,
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More 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 informationA Division Algorithm Approach to p-adic Sylvester Expansions
arxiv:1508.01503v1 [math.nt] 6 Aug 2015 A Division Algorithm Approach to p-adic Sylvester Expansions Eric Errthum Department of Mathematics and Statistics Winona State University Winona, MN E-mail: eerrthum@winona.edu
More informationIntegers and Division
Integers and Division Notations Z: set of integers N : set of natural numbers R: set of real numbers Z + : set of positive integers Some elements of number theory are needed in: Data structures, Random
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More information= 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 informationa = a i 2 i a = All such series are automatically convergent with respect to the standard norm, but note that this representation is not unique: i<0
p-adic Numbers K. Sutner v0.4 1 Modular Arithmetic rings integral domains integers gcd, extended Euclidean algorithm factorization modular numbers add Lemma 1.1 (Chinese Remainder Theorem) Let a b. Then
More informationQUOTIENTS OF FIBONACCI NUMBERS
QUOTIENTS OF FIBONACCI NUMBERS STEPHAN RAMON GARCIA AND FLORIAN LUCA Abstract. There have been many articles in the Monthly on quotient sets over the years. We take a first step here into the p-adic setting,
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 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 informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,
More informationSome Facts from Number Theory
Computer Science 52 Some Facts from Number Theory Fall Semester, 2014 These notes are adapted from a document that was prepared for a different course several years ago. They may be helpful as a summary
More information1 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 informationAlgebraic Number Theory Notes: Local Fields
Algebraic Number Theory Notes: Local Fields Sam Mundy These notes are meant to serve as quick introduction to local fields, in a way which does not pass through general global fields. Here all topological
More informationAlgebra for error control codes
Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22
More informationFebruary 1, 2005 INTRODUCTION TO p-adic NUMBERS. 1. p-adic Expansions
February 1, 2005 INTRODUCTION TO p-adic NUMBERS JASON PRESZLER 1. p-adic Expansions The study of p-adic numbers originated in the work of Kummer, but Hensel was the first to truly begin developing the
More informationNotes 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 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 informationa = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let
2. Induction and the division algorithm The main method to prove results about the natural numbers is to use induction. We recall some of the details and at the same time present the material in a different
More informationFinite Fields. Mike Reiter
1 Finite Fields Mike Reiter reiter@cs.unc.edu Based on Chapter 4 of: W. Stallings. Cryptography and Network Security, Principles and Practices. 3 rd Edition, 2003. Groups 2 A group G, is a set G of elements
More information1 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 informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationEUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972)
Intro to Math Reasoning Grinshpan EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972) We all know that every composite natural number is a product
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More informationNumber Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.
CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationMTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1
MTH 310, Section 001 Abstract Algebra I and Number Theory Sample Midterm 1 Instructions: You have 50 minutes to complete the exam. There are five problems, worth a total of fifty points. You may not use
More 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 informationBasic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series
Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony
More informationAn 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 informationIntermediate Math Circles February 29, 2012 Linear Diophantine Equations I
Intermediate Math Circles February 29, 2012 Linear Diophantine Equations I Diophantine equations are equations intended to be solved in the integers. We re going to focus on Linear Diophantine Equations.
More informationDiscrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:
Discrete valuation rings Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: 1. v is surjective. 2. v(ab) = v(a) + v(b). 3. v(a + b) min(v(a), v(b)) if a + b 0. Proposition:
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
More informationBeautiful Mathematics
Beautiful Mathematics 1. Principle of Mathematical Induction The set of natural numbers is the set of positive integers {1, 2, 3,... } and is denoted by N. The Principle of Mathematical Induction is a
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationa + bi by sending α = a + bi to a 2 + b 2. To see properties (1) and (2), it helps to think of complex numbers in polar coordinates:
5. Types of domains It turns out that in number theory the fact that certain rings have unique factorisation has very strong arithmetic consequences. We first write down some definitions. Definition 5.1.
More informationChapter 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 informationLecture 2. The Euclidean Algorithm and Numbers in Other Bases
Lecture 2. The Euclidean Algorithm and Numbers in Other Bases At the end of Lecture 1, we gave formulas for the greatest common divisor GCD (a, b), and the least common multiple LCM (a, b) of two integers
More informationThe p-adic numbers. Given a prime p, we define a valuation on the rationals by
The p-adic numbers There are quite a few reasons to be interested in the p-adic numbers Q p. They are useful for solving diophantine equations, using tools like Hensel s lemma and the Hasse principle,
More informationNOTES 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 information1 Absolute values and discrete valuations
18.785 Number theory I Lecture #1 Fall 2015 09/10/2015 1 Absolute values and discrete valuations 1.1 Introduction At its core, number theory is the study of the ring Z and its fraction field Q. Many questions
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationThe set of integers will be denoted by Z = {, -3, -2, -1, 0, 1, 2, 3, 4, }
Integers and Division 1 The Integers and Division This area of discrete mathematics belongs to the area of Number Theory. Some applications of the concepts in this section include generating pseudorandom
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationMath 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6
Math 131 notes Jason Riedy 6 October, 2008 Contents 1 Modular arithmetic 2 2 Divisibility rules 3 3 Greatest common divisor 4 4 Least common multiple 4 5 Euclidean GCD algorithm 5 6 Linear Diophantine
More informationAlgebraic function fields
Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationMat Week 8. Week 8. gcd() Mat Bases. Integers & Computers. Linear Combos. Week 8. Induction Proofs. Fall 2013
Fall 2013 Student Responsibilities Reading: Textbook, Section 3.7, 4.1, & 5.2 Assignments: Sections 3.6, 3.7, 4.1 Proof Worksheets Attendance: Strongly Encouraged Overview 3.6 Integers and Algorithms 3.7
More informationElementary Number Theory. Franz Luef
Elementary Number Theory Congruences Modular Arithmetic Congruence The notion of congruence allows one to treat remainders in a systematic manner. For each positive integer greater than 1 there is an arithmetic
More informationIntermediate Math Circles February 26, 2014 Diophantine Equations I
Intermediate Math Circles February 26, 2014 Diophantine Equations I 1. An introduction to Diophantine equations A Diophantine equation is a polynomial equation that is intended to be solved over the integers.
More informationStudent Responsibilities Week 8. Mat Section 3.6 Integers and Algorithms. Algorithm to Find gcd()
Student Responsibilities Week 8 Mat 2345 Week 8 Reading: Textbook, Section 3.7, 4.1, & 5.2 Assignments: Sections 3.6, 3.7, 4.1 Induction Proof Worksheets Attendance: Strongly Encouraged Fall 2013 Week
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationChapter 3 Basic Number Theory
Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of
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 informationJeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA
#A33 INTEGERS 10 (2010), 379-392 DISTANCE GRAPHS FROM P -ADIC NORMS Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA 30118 jkang@westga.edu Hiren Maharaj Department
More information3 The fundamentals: Algorithms, the integers, and matrices
3 The fundamentals: Algorithms, the integers, and matrices 3.4 The integers and division This section introduces the basics of number theory number theory is the part of mathematics involving integers
More informationSummary: Divisibility and Factorization
Summary: Divisibility and Factorization One of the main subjects considered in this chapter is divisibility of integers, and in particular the definition of the greatest common divisor Recall that we have
More informationAN ALGEBRAIC PROOF OF RSA ENCRYPTION AND DECRYPTION
AN ALGEBRAIC PROOF OF RSA ENCRYPTION AND DECRYPTION Recall that RSA works as follows. A wants B to communicate with A, but without E understanding the transmitted message. To do so: A broadcasts RSA method,
More informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationExercises 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 information2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.
CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder
More informationFour Basic Sets. Divisors
Four Basic Sets Z = the integers Q = the rationals R = the real numbers C = the complex numbers Divisors Definition. Suppose a 0 and b = ax, where a, b, and x are integers. Then we say a divides b (or
More informationModular numbers and Error Correcting Codes. Introduction. Modular Arithmetic.
Modular numbers and Error Correcting Codes Introduction Modular Arithmetic Finite fields n-space over a finite field Error correcting codes Exercises Introduction. Data transmission is not normally perfect;
More informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going
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 informationChapter 2. Divisibility. 2.1 Common Divisors
Chapter 2 Divisibility 2.1 Common Divisors Definition 2.1.1. Let a and b be integers. A common divisor of a and b is any integer that divides both a and b. Suppose that a and b are not both zero. By Proposition
More informationNumber Theory, Algebra and Analysis. William Yslas Vélez Department of Mathematics University of Arizona
Number Theory, Algebra and Analysis William Yslas Vélez Department of Mathematics University of Arizona O F denotes the ring of integers in the field F, it mimics Z in Q How do primes factor as you consider
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationCONGRUENT NUMBERS AND ELLIPTIC CURVES
CONGRUENT NUMBERS AND ELLIPTIC CURVES JIM BROWN Abstract. In this short paper we consider congruent numbers and how they give rise to elliptic curves. We will begin with very basic notions before moving
More informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationProf. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.
1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and
More informationNumber Theory Notes Spring 2011
PRELIMINARIES The counting numbers or natural numbers are 1, 2, 3, 4, 5, 6.... The whole numbers are the counting numbers with zero 0, 1, 2, 3, 4, 5, 6.... The integers are the counting numbers and zero
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationDivisibility of Natural Numbers
10-19-2009 Divisibility of Natural Numbers We now return to our discussion of the natural numbers. We have built up much of the mathematical foundation for the natural numbers (N = 1, 2, 3,...). We used
More informationAlgorithmic 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 information11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic
11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic Bezout s Lemma Let's look at the values of 4x + 6y when x and y are integers. If x is -6 and y is 4 we
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to
More information7. Prime Numbers Part VI of PJE
7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.
More informationApplied Cryptography and Computer Security CSE 664 Spring 2017
Applied Cryptography and Computer Security Lecture 11: Introduction to Number Theory Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline What we ve covered so far: symmetric
More information