Chapter 1 A Survey of Divisibility 14
|
|
- Erica Cobb
- 5 years ago
- Views:
Transcription
1 Chapter 1 A Survey of Divisibility 14 SECTION C Euclidean Algorithm By the end of this section you will be able to use properties of the greatest common divisor (gcd) obtain the gcd using the Euclidean algorithm solve linear equations C1 Properties of the Greatest Common Divisor In this section we investigate some of the properties of the gcd and we introduce the Euclidean Algorithm, which provides a way to find the gcd of two integers. We begin by looking at solution at equations of the form: ax by gcd( a,), b where a, b, x and y are integers. Example 14 In Example 8 from Section A we found and y: Solution 36x 60y 12 gcd 36, 60 12, let us solve for integers x We have a linear equation with two unknowns. How can we solve this equation? First divide through by 12 as it is a common factor, this reduces it to: Now rearrange to make y the subject:, 3x 5y x y. 5 Remember that x and y are integers (they could be negative). This means that we can choose any integer x as long as and the resulting value for y is also an integer. For example, letting x 2 then y 1. 5 There are going to be many other pairs of x and y which work. We can also solve the equation using graphs because 36x 60y 12 is equivalent to 1 3x y (see Example 14), which is a straight line as shown in 3: 5
2 Chapter 1 A Survey of Divisibility 15 Figure 3 The graph shows two integer solutions to 36x 60y 12 As you can observe from the graph there are two integer points (pairs) which are on the line 36x 60y 12. For instance the point 2, 1 that we found in Example 14, but we could also have found the solution x 3, y 2 which is the point 3, 2. Indeed there are an infinite number of integer points on the line 36x 60y 12. This leads us to ask, can we always find integers x and y such that ax by g where g gcd a, b It turns out that indeed we can, as we now prove.? Proposition (1.9). There are integers x and y such that How do we prove this result? ax by gcd a, b g First we show ax by is a common divisor of a and b and then we prove ax by is the largest of these common divisors. Proof. Common Divisor Consider the set S given by where both integers a and b are not zero. The set S is non-empty. Why? Let the integers x S ax by : ax by 0 a and y b (we select these integers so that ax by 0 ) then ax by a b 2 2 Therefore S is non-empty so by Well Ordering Principle (WOP): 0
3 Chapter 1 A Survey of Divisibility 16 Let S be a non-empty set of positive integers and zero. Then the set S has a least element. Let d be the least element of the above set S. This means there are integers x and y such that ax by d. (*) To show that d is a common divisor of a and b we make use of the Division Algorithm (1.7) of the last section: Given any integers m and n with n 1 m qn r 0 r n there exist unique integers q and r such that We start by showing that d is a divisor of a by applying the Division Algorithm (1.7): a qd r 0 r d ( ) Suppose r 0, then transposing a qd r to make r the subject yields r a qd Substituting ax by d from (*) into this gives 1 r a q ax by qx a qyb a 1 qx b qy 0 Because r 0 integer integer This implies that r is in the set S because S is defined as S ax by : ax by 0 But if r is in the set then since r<d we would have a contradiction as d is the least element. Therefore, our supposition r 0 is wrong, meaning r 0, and so a qd, which implies d a. Similarly by applying the Division Algorithm to integers b and d we can show that d b. Hence d is a common divisor of a and b. Since d a and d b it follows from Proposition (1.3): d a d b then d ax by If and that d () ax by. Largest Common Divisor for any integers x and y. Next we show d to be the greatest common divisor, gcd, of a and b. Let c be another divisor of ax by d then by (1.2) part (e) (e) If a b and b 0 then a b.
4 Chapter 1 A Survey of Divisibility 17 It follows that as c d where d and c are both positive c d which means d must be the greatest common divisor, gcd, of integers a and b. That is, d=g. By the above proof we also have the following two propositions: Proposition (1.10). Let gcd a, b g then (i) If d a and d b then d g. (ii) The gcd a, b g is the least positive integer value of ma nb range over all the integers. where m and n Proof. See proof of the above Proposition (1.9). Proposition (1.11). Let gcd a, b g. For any positive integer m gcd, Proof. ma mb mg By applying the above Proposition (1.10) part (ii) we have ma mb least positive value of max mby gcd, m (least positive value of ax by ) mg C2 Relatively Prime We encountered the idea of two numbers being relatively prime back in Section A. The two integers 10 and 21 are relatively prime as they have no factor in common apart from 1. The formal definition is: Definition (1.12). Integers a and b not both zero are relatively prime if gcd a, b 1 Another example of relatively prime numbers is: gcd 5, 13 1 therefore 5 and 13 are relatively prime In the next example we use the fact that 5 and 13 are relatively prime.
5 Chapter 1 A Survey of Divisibility 18 An important result concerning relatively prime numbers is Euclid s Lemma. It is worth learning this result as it is used throughout number theory. (Usually lemma means an intermediate result or a result used to deduce an important theorem or proposition but in this case Euclid s Lemma is a critical result in its own right.) Euclid s Lemma (1.13). If a b c gcd a, b 1 then a c. with Before we prove this let us see it in action. Example 15 Given show that Solution gcd 13, 5 1 and so by Euclid s Lemma (1.13) we have Let us now prove the Lemma. Proof. By Proposition (1.5) of the last section: Proposition (1.5). If gcd a, b g There are integers m and n such that then there are integers m and n such that ma nb g ma nb 1. [Because we are given gcd a, b g 1 ] Multiplying both sides by an integer c gives cma cnb m ac n bc c. (*) Now, we are given that a b c therefore there is an integer k such that Substituting this into (*) gives The result a mc nk c This completes our proof. ak bc. () m ac n bc m ac n ak a mc nk c means that a integer Factorizing By (*) c so we have a c
6 Chapter 1 A Survey of Divisibility 19 Figure 4 Euclid is famously known for his work The Elements which is also called Euclid s Elements. This work has been used in mathematics teaching for over two thousand years and was first published as a book in Only the bible has been printed more times than Euclid s Elements. Up until the 1970 s school mathematics in Britain consisted of learning various parts of Euclid s Elements. The concept of mathematical proof and logical reasoning is what made this work survive for so long. C3 Euclidean Algorithm The Euclidean algorithm is used to find the gcd of any two positive integers. Say we are asked to determine the gcd5291, How are we going to find the greatest common divisor of these numbers? Listing the divisors of each and looking for divisors which are common to both numbers will take considerable time. We need a simpler approach the Euclidean algorithm. The Euclidean algorithm is the most efficient way of finding the gcd of any two integers as it removes the need to find all the factors of the two given integers. This is quicker and less tedious than finding all the factors, especially if the integers are large. Next we describe the Euclidean algorithm which is based on the repeated application of the Division Algorithm (1.7) of the last section: Division Algorithm (1.7) Given any integers a and b with b 1 integers q and r such that a bq r 0 r b there exist unique We repeated apply the Division Algorithm to the two given integers a and b, the gcd of these given integers a and b turns out to be the last non-zero remainder as the next example demonstrates: Example 16 Determine gcd666, 31. Solution We underline the remainder at each step for clarity. Applying the division algorithm to 666 and 31 gives
7 Chapter 1 A Survey of Divisibility 20 The remainder is 15 which is non-zero so we apply the division algorithm to 31 and 15: Again the remainder 1 is non-zero so we continue to apply the division algorithm to 15 and 1: Now we have a remainder of zero which means we stop the process. What is gcd 666, 31 equal to? It is the last non-zero remainder which is 1. Hence gcd666, 31 1 relatively prime. that is they are The general Euclidean algorithm procedure for a b 1 is given by: 1. Dividing a and b and applying the division algorithm gives 2. If the remainder r 1 0 then a bq1 a bq r 0 r b and gcd, gcd, means we are done because we have found gcd a, b b. a b bq b b. This 3. If r1 0 then a bq1 r1 and we divide b by r 1. Writing this in terms of quotient q2 and remainder r 2 gives 4. If the remainder r2 0 b r q r 0 r r then we are done. Otherwise we repeat the above process of applying the division algorithm to r 1 and r 2. We continue in this manner until we get a remainder of zero. 5. The last non-zero remainder is the gcd of the given integers a and b. We will prove step 2 below. However prior to the proof of this we will demonstrate the Euclidean algorithm with an example. Example 17 By applying the Euclidean algorithm find gcd 5291, 3108 and simplify Solution Dividing 5291 by 3108 gives Since we do not have a zero remainder we continue to apply the division algorithm until we get a zero remainder: 1
8 Chapter 1 A Survey of Divisibility 21 The last non-zero remainder is 37 so gcd 5291, How can we simplify the given fraction ? By Proposition (1.5) of Section A: Last non-zero remainder. If gcd a, b g a b then gcd, 1. g g This means that dividing the numerator 5291 and denominator 3108 by 37 which is the gcd gives no factors in common after division. Therefore Cancelling 37's This 143/84 is the simplest fraction of 5291/3108 because by (1.5) we have gcd 143, 84 1 So these numbers (143 and 84) are relatively prime. We need to prove that the gcd of given integers a and b is equal to the gcd of b and r where r is the remainder when we divide a and b. [This was step 2 of the Euclidean algorithm.] Proposition (1.14). If a bq r 0 r b Then g gcd a, b gcd b, r Proof... Required to prove that g g. 1 2 Let g gcd a, b 1 and g gcd 2 b, r From g gcd 1 a, b we have g, g 1 1 a b and we are given a bq r so g 1 r. Since g b and g 1 1 r so g 1 is a common divisor of b and r so by the definition (1.4): (ii) if for any c we have c x and c y then c g where g gcd x, y.
9 Chapter 1 A Survey of Divisibility 22 We have g g because g gcd b, r Similarly by considering g2 gcd b, r Hence g g we can deduce that g g. 2 1 C4 Solving Linear Equations We can use the Euclidean algorithm in reverse order to solve linear Diophantine equations like 666 x 31 y gcd 666, 31 In Example 16 we found gcd 666, Thus this linear equation is 666x 31y 1 It is going to have an infinite number of solutions. Why? Drawing the graph of this straight line 666x 31y 1 : Figure 5 Showing an integer solution of the line 666x 31y 1. Any point on this straight line is a solution to 666x 31y 1. However we are only interested in integer solutions to this equation. How can we find integer solutions? We can use Example 16 because we had: From (**) we have (*) ** By (*) Expanding the brackets Collecting like terms
10 Chapter 1 A Survey of Divisibility 23 We have of x and y?. We wanted to solve 666x 31y 1. What are the values Clearly x 2 and y 43. This is the point shown on the above graph in Fig. 5. Example 18 Solve 5291x 3108y gcd 5291, 3108 Solution for integer solutions. What are we trying to find? The integer values of x and y which satisfy the given equation. We have already found the gcd of 5291 and 3108 in Example 17. We had the following (step numbers have been added): was the last non-zero remainder so gcd 5291, reverse order to obtain integer values of x and y such that From step (6) we can write 37 as 5291x 3108y Using step (5) Collecting like terms Using step (4) Collecting like terms Using step (3) Collecting like terms Using step (2) Collecting like terms Using step (1) Collecting like terms We have =37. What are the values of x and y in Re-writing this = x 3108y 37? as. We use these 6 steps in
11 Chapter 1 A Survey of Divisibility =37 yields x 37 and y 63 The value 37 is the smallest positive integer of 5291x 3108y. How do we know this? Because of Proposition (1.10) part (ii): (ii) The gcd a, b g is the least positive integer value of ma nb range over all the integers. What can you say about the linear equation 5291x 3108y 36? It has no integer solutions because the least value of this linear combination 5291x 3108y is 37. where m and n Note that by applying the Euclidean algorithm we can find the gcd of any two positive integers a and b plus solve the linear equation for integer solutions. SUMMARY ax by gcd a, b We use the Euclidean algorithm to find the gcd of two numbers a and b. By reversing the steps of the Euclidean algorithm we can solve the linear equation ax by gcd a, b
2x 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 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 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 informationDivisibility. Def: a divides b (denoted a b) if there exists an integer x such that b = ax. If a divides b we say that a is a divisor of b.
Divisibility Def: a divides b (denoted a b) if there exists an integer x such that b ax. If a divides b we say that a is a divisor of b. Thm: (Properties of Divisibility) 1 a b a bc 2 a b and b c a c 3
More informationDivision Algorithm B1 Introduction to the Division Algorithm (Procedure) quotient remainder
A Survey of Divisibility Page 1 SECTION B Division Algorithm By the end of this section you will be able to apply the division algorithm or procedure Our aim in this section is to show that for any given
More informationThe Fundamental Theorem of Arithmetic
Chapter 1 The Fundamental Theorem of Arithmetic 1.1 Primes Definition 1.1. We say that p N is prime if it has just two factors in N, 1 and p itself. Number theory might be described as the study of the
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 informationEuclidean Domains. Kevin James
Suppose that R is an integral domain. Any function N : R N {0} with N(0) = 0 is a norm. If N(a) > 0, a R \ {0 R }, then N is called a positive norm. Suppose that R is an integral domain. Any function N
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 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 information(e) Commutativity: a b = b a. (f) Distributivity of times over plus: a (b + c) = a b + a c and (b + c) a = b a + c a.
Math 299 Midterm 2 Review Nov 4, 2013 Midterm Exam 2: Thu Nov 7, in Recitation class 5:00 6:20pm, Wells A-201. Topics 1. Methods of proof (can be combined) (a) Direct proof (b) Proof by cases (c) Proof
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 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 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. Introduction
Number Theory Introduction Number theory is the branch of algebra which studies the properties of the integers. While we may from time to time use real or even complex numbers as tools to help us study
More information4 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 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 informationThe following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers:
Divisibility Euclid s algorithm The following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers: Divide the smaller number into the larger, and
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 informationNOTES ON INTEGERS. 1. Integers
NOTES ON INTEGERS STEVEN DALE CUTKOSKY The integers 1. Integers Z = {, 3, 2, 1, 0, 1, 2, 3, } have addition and multiplication which satisfy familar rules. They are ordered (m < n if m is less than n).
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 informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
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 informationREAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.
REAL NUMBERS Introduction Euclid s Division Algorithm Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Fundamental
More informationThe Chinese Remainder Theorem
Sacred Heart University DigitalCommons@SHU Academic Festival Apr 20th, 9:30 AM - 10:45 AM The Chinese Remainder Theorem Nancirose Piazza Follow this and additional works at: http://digitalcommons.sacredheart.edu/acadfest
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 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 informationProofs. Methods of Proof Divisibility Floor and Ceiling Contradiction & Contrapositive Euclidean Algorithm. Reading (Epp s textbook)
Proofs Methods of Proof Divisibility Floor and Ceiling Contradiction & Contrapositive Euclidean Algorithm Reading (Epp s textbook) 4.3 4.8 1 Divisibility The notation d n is read d divides n. Symbolically,
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 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 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 informationCommutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
More informationChapter 3: The Euclidean Algorithm and Diophantine. Math 138 Burger California State University, Fresno
Chapter 3: The Euclidean Algorithm and Diophantine Equations Math 138 Burger California State University, Fresno Greatest Common Divisor d is the greatest common divisor of integers a and b if d is the
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationD i v i s i b i l i t y
a D i v i s i b i l i t y statement which asserts that all numbers possess a certain property cannot be proved in this manner. The assertion, "Every prime number of the form An + 1 is a sum of two squares,"
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 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 informationSolution Sheet (i) q = 5, r = 15 (ii) q = 58, r = 15 (iii) q = 3, r = 7 (iv) q = 6, r = (i) gcd (97, 157) = 1 = ,
Solution Sheet 2 1. (i) q = 5, r = 15 (ii) q = 58, r = 15 (iii) q = 3, r = 7 (iv) q = 6, r = 3. 2. (i) gcd (97, 157) = 1 = 34 97 21 157, (ii) gcd (527, 697) = 17 = 4 527 3 697, (iii) gcd (2323, 1679) =
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationCHAPTER 3. Congruences. Congruence: definitions and properties
CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write
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 informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationCool Results on Primes
Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why
More informationThe theory of numbers
1 AXIOMS FOR THE INTEGERS 1 The theory of numbers UCU Foundations of Mathematics course 2017 Author: F. Beukers 1 Axioms for the integers Roughly speaking, number theory is the mathematics of the integers.
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 informationFinding Prime Factors
Section 3.2 PRE-ACTIVITY PREPARATION Finding Prime Factors Note: While this section on fi nding prime factors does not include fraction notation, it does address an intermediate and necessary concept to
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 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 informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Factorise each polynomial: a) x 2 6x + 5 b) x 2 16 c) 9x 2 25 2) Simplify the following algebraic fractions fully: a) x 2
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 information2 Elementary number theory
2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},
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 informationnot to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results
REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 1 Introduction and Divisibility By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 1 DIVISION
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 informationACCUPLACER MATH 0310
The University of Teas at El Paso Tutoring and Learning Center ACCUPLACER MATH 00 http://www.academics.utep.edu/tlc MATH 00 Page Linear Equations Linear Equations Eercises 5 Linear Equations Answer to
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 informationCSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 10: Proofs by Contradiction and Contraposition 1. Prove the following statement
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 informationMATH10040 Chapter 1: Integers and divisibility
MATH10040 Chapter 1: Integers and divisibility Recall the basic definition: 1. Divisibilty Definition 1.1. If a, b Z, we say that b divides a, or that a is a multiple of b and we write b a if there is
More informationcse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska
cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 12 CHAPTER 4 NUMBER THEORY PART1: Divisibility PART 2: Primes PART 1: DIVISIBILITY Basic Definitions Definition Given m,n Z, we say
More informationPolynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example:
Polynomials Monomials: 10, 5x, 3x 2, x 3, 4x 2 y 6, or 5xyz 2. A monomial is a product of quantities some of which are unknown. Polynomials: 10 + 5x 3x 2 + x 3, or 4x 2 y 6 + 5xyz 2. A polynomial is a
More informationIntroduction Integers. Discrete Mathematics Andrei Bulatov
Introduction Integers Discrete Mathematics Andrei Bulatov Discrete Mathematics - Integers 9- Integers God made the integers; all else is the work of man Leopold Kroenecker Discrete Mathematics - Integers
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 information1 Continued Fractions
Continued Fractions To start off the course, we consider a generalization of the Euclidean Algorithm which has ancient historical roots and yet still has relevance and applications today.. Continued Fraction
More informationDivisibility in Z. Definition Let a, b Z be integers. We say that b divides a, if there exists c Z such that a = b c; we write b a.
Divisibility in Z Tomáš Madaras 2016 Definition Let a, b Z be integers. We say that b divides a, if there exists c Z such that a = b c; we write b a. The divisibility of integers is thus a kind of relation
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 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 informationDeepening Mathematics Instruction for Secondary Teachers: Algebraic Structures
Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures Lance Burger Fresno State Preliminary Edition Contents Preface ix 1 Z The Integers 1 1.1 What are the Integers?......................
More informationa the relation arb is defined if and only if = 2 k, k
DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),
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 informationMath Circles - Lesson 2 Linear Diophantine Equations cont.
Math Circles - Lesson 2 Linear Diophantine Equations cont. Zack Cramer - zcramer@uwaterloo.ca March 7, 2018 Last week we discussed linear Diophantine equations (LDEs), which are equations of the form ax
More information+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4
Math 4030-001/Foundations of Algebra/Fall 2017 Polynomials at the Foundations: Rational Coefficients The rational numbers are our first field, meaning that all the laws of arithmetic hold, every number
More informationand LCM (a, b, c) LCM ( a, b) LCM ( b, c) LCM ( a, c)
CHAPTER 1 Points to Remember : REAL NUMBERS 1. Euclid s division lemma : Given positive integers a and b, there exists whole numbers q and r satisfying a = bq + r, 0 r < b.. Euclid s division algorithm
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More information4. Number Theory (Part 2)
4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.
More 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 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 informationL1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen
L1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen In this section you will apply the method of long division to divide a polynomial by a binomial. You will also learn to
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 informationFactoring and Algebraic Fractions
Worksheet. Algebraic Fractions Section Factoring and Algebraic Fractions As pointed out in worksheet., we can use factoring to simplify algebraic expressions, and in particular we can use it to simplify
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 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 informationExample: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)
Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationAn Introduction to Mathematical Thinking: Algebra and Number Systems. William J. Gilbert and Scott A. Vanstone, Prentice Hall, 2005
Chapter 2 Solutions An Introduction to Mathematical Thinking: Algebra and Number Systems William J. Gilbert and Scott A. Vanstone, Prentice Hall, 2005 Solutions prepared by William J. Gilbert and Alejandro
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 informationHomework 3, solutions
Homework 3, solutions Problem 1. Read the proof of Proposition 1.22 (page 32) in the book. Using simialr method prove that there are infinitely many prime numbers of the form 3n 2. Solution. Note that
More informationL1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen
L1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen In this section you will apply the method of long division to divide a polynomial by a binomial. You will also learn to
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
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 informationI Foundations Of Divisibility And Congruence 1
Contents I Foundations Of Divisibility And Congruence 1 1 Divisibility 3 1.1 Definitions............................. 3 1.2 Properties Of Divisibility..................... 5 1.3 Some Basic Combinatorial
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationSignature: (In Ink) UNIVERSITY OF MANITOBA TEST 1 SOLUTIONS COURSE: MATH 2170 DATE & TIME: February 11, 2019, 16:30 17:15
PAGE: 1 of 7 I understand that cheating is a serious offence: Signature: (In Ink) PAGE: 2 of 7 1. Let a, b, m, be integers, m > 1. [1] (a) Define a b. Solution: a b iff for some d, ad = b. [1] (b) Define
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 informationWriting Assignment 2 Student Sample Questions
Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Simplify: a) 3x 2 5x 5 b) 5x3 y 2 15x 7 2) Factorise: a) x 2 2x 24 b) 3x 2 17x + 20 15x 2 y 3 3) Use long division to calculate:
More informationA Readable Introduction to Real Mathematics
Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 7: The Euclidean Algorithm and Applications 1. Find the greatest
More information18 Divisibility. and 0 r < d. Lemma Let n,d Z with d 0. If n = qd+r = q d+r with 0 r,r < d, then q = q and r = r.
118 18. DIVISIBILITY 18 Divisibility Chapter V Theory of the Integers One of the oldest surviving mathematical texts is Euclid s Elements, a collection of 13 books. This book, dating back to several hundred
More informationGreatest Common Divisor MATH Greatest Common Divisor. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Greatest Common Divisor Benjamin V.C. Collins James A. Swenson The world s least necessary definition Definition Let a, b Z, not both zero. The largest integer d such that d a and d b is called
More information