12 Greatest Common Divisors. The Euclidean Algorithm


 Tyler Adams
 1 years ago
 Views:
Transcription
1 Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to establish a condition on n so that (Z n, ) is a group. This section provides the tool needed for that. We start this section with the following definition. Definition 12.1 Let a and b be two integers, not both zero. A positive integer d is called a greatest common divisor of a and b if the following two conditions hold: (1) d a and d b. (2) If c a and c b then c d. We write d = (a, b) or d = gcd(a, b). Example 12.1 The greatest common divisor of 42 and 56 is 14. The greatest common divisor is useful for writing fractions in lowest term. For example, 42 = where we cancelled 14 = (42, 56). We next discuss a systematic procedure for finding the greatest commom divisor of two integers, known as the Euclid s Algorithm. For that purpose, we need the following result. Theorem 12.1 If a, b, q, and r are integers such that a = bq + r then (a, b) = (b, r). Let d 1 = (a, b) and d 2 = (b, r). We will show that d 1 = d 2. Since d 2 bq and d 2 r then by Theorem 10.2(a)(b), d 2 (bq + r). That is d 2 a. Thus, by Definition 12.1, d 2 d 1. Since d 1 b then by Theorem 10.2(a) d 1 bq. Since d 1 a then by Theorem 10.2(b)d 1 (a bq). That is, d 1 r. Hence, from the definition of 1
2 d 2, we have d 1 d 2. Since d 1 and d 2 are positive then by Theorem 10.2(d), we have d 1 = d 2. The following theorem, establishes the existence and uniqueness of the greatest common divisor and provide an algorithm of how to find it. Theorem 12.2 (The Euclidean Algorithm) If a and b are two integers, not both zero, then there exists a unique positive integer d such that the two conditions (1) and (2) of Definition 12.1 are satisfied. Uniqueness: Let d 1 and d 2 be two positive integers that satisfy conditions (1) and (2). Then by (2) we can write d 1 d 2 and d 2 d 1. Since d 1 and d 2 are both positive then Theorem 10.2 (d) implies that d 1 = d 2. Existence: Without loss of generality, we may assume that b 0. Note that if a = 0 then d = b. Indeed, b 0 and b b. Moreover, if c is a common divisor of a and b then b = cq so that b = cq. That is, c b. So assume that a 0. By the Division algorithm there exist unique integers q 1 and r 1 such that a = bq 1 + r 1, 0 r 1 < b. If r 1 = 0 then as above, one can easily check that d = b. So assume that r 1 0. Using the Division algorithm for a second time to find unique integers q 2 and r 2 such that b = r 1 q 2 + r 2 0 r 2 < r 1. We keep this process going and eventually we will find integers r n and r n+1 such that r n 2 = r n 1 q n + r n, 0 r n < r n 1 and r n 1 = r n q n+1. That is, r n is the last nonzero remainder in the process. By Theorem 12.1, we have (a, b) = (b, r 1 ) = (r 1, r 2 ) = = (r n 1, r n ) = r n. 2
3 Example 12.2 Performing the arithmetic for the Euclidean algorithm we have So (1776, 1492) = = (1)(1492) = (5)(284) = (3)(72) = (1)(68) = 4(17) An alternative proof for the existence of the greatest common divisor which does not provide a systematic way for finding (a, b) is given next. The theorem is important for its theoretical applications. Theorem 12.3 If a and b are two integers, not both zero, then there exist integers m and n such that (a, b) = ma + nb. That is, (a, b) can be expressed as a linear combination of a and b. Without loss of generality, we assume that b 0. Let S = {xa + yb > 0 : x, y Z}. We first show that S. To see this, note that if b > 0 then b = 0a + (1)b S. If b < 0 then b = 0a + ( 1)b S. Note that 0 S. By Theorem 10.1, S has a smallest element d. Thus, d = ma + nb > 0 for some integers m and n. We will show that d = (a, b). Applying the Division algorithm we can find unique integers q and r such that a = dq + r with 0 r < d. From this equation we see that r = a dq = a (ma + nb)q = (1 mq)a + ( nq)b If r > 0 then r S and r < d. This contradicts the definition of d. Therefore, r = 0 and this gives a = dq and hence d a. A similar argument holds for d b. Finally, if c is an integer such that c a and c b then a = cq and b = cq. Thus, d = ma + nb = mcq + ncq = c(mq + nq ) This means that c d. Thus, d = (a, b). This ends a proof of the Theorem. 3
4 Remark 12.1 The integers m and n in Theorem 12.3 are not unique. Indeed, (a, b) = ma + nb = ma + ab + nb ab = (m + b)a + (n a)b = m a + n b Example 12.3 From Example 12.2, we found that (1776, 1492) = 4. Let s write this as a linear combination of 1776 and We use the equations in Example 12.2, beginning with 72 = (1)(68) + 4 and working backward one step at a time. 4 = 72 (1)(68). Solve the equation 284 = (3)(72) + 68 for 68 and substitute in the previous equation and simplify to obtain 4 = 72 (1)( ) = 72 (4) 284 Solve the equation 1492 = (5)(284)+72 for 72 and substitute in the previous equation and simplify to obtain 4 = ( ) = Finally, solve the equation 1776 = for 284 and substitute to obtain 4 = ( ) = Theorem 12.4 If a and b are integers, not both zero, then (a, b) = 1 if and only if ma+nb = 1 for some integers m and n. Suppose first that (a, b) = 1. By Theorem 12.3, there exist integers m and n such that ma + nb = 1. Conversely, suppose that ma+nb = 1 for some integers m and n. If d = (a, b) then d a and d b so d (ma + nb) (Theorem 10.2 (a)(b)). That is, d 1, 1 d and d > 0 then by Theorem 10.2(d) we must have d = 1. 4
5 Definition 12.2 If a and b are integers such that (a, b) = 1 then we say that a and b are relatively prime. The next result, characterizes those elements of Z n that have multiplicative inverses. Theorem 12.5 [a] Z n has a multiplicative inverse if and only if (a, n) = 1. Suppose first that [a] has a multiplicative inverse [b] in Z n. Then [a] [b] = [ab] = [1]. This implies that ab 1(mod n). Therefore, ab = nq + 1 for some integer q. This last equality can be written in the form ba + ( q)n = 1. Suppose that d = (a, n). By Theorem 10.2(a)(b), d 1. Since 1 d then by Theorem 10.2(d), d = (a, n) = 1. Conversely, suppose that (a, n) = 1. Then by Theorem 12.4, there exist integers m and q such that ma + qn = 1. Thus, ma 1 = ( q)n and hence ma 1(mod n). In terms of, we have [m] [a] = [1]. Thus, [a] has a multiplicative inverse in Z n. As a consequence of the above theorem we have Theorem 12.6 Every nonzero element of Z n has a multiplicative inverse if and only if n is a prime number. Thus, (Z n, ) is a group if and only if n is prime. Suppose first that [a] has a multiplicative inverse for all 1 a < n. Then by Theorem 12.5, (a, n) = 1 for 1 a < n. This is true only if n is prime. Conversely, suppose that n is prime then (a, n) = 1 for every 1 a < n. By Theorem 12.5, [a] has a multiplicative inverse for all 1 a < n. 5
GREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
More informationSection 4.2: The Division Algorithm and Greatest Common Divisors
Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationMA Number Theory Spring Semester Prof. Meuser MIDTERM EXAM  March 1, 2013
MA 341  Number Theory Spring Semester  13  Prof. Meuser MIDTERM EXAM  March 1, 2013 1) (16 points) Let a, b N. a) (4 points) Give the definition of gcd(a, b). b) (6 points) Use the definition of gcd(a,
More informationThe Euclidean Algorithm and Multiplicative Inverses
1 The Euclidean Algorithm and Multiplicative Inverses Lecture notes for Access 2011 The Euclidean Algorithm is a set of instructions for finding the greatest common divisor of any two positive integers.
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More information1.2 Properties of Integers
10 CHAPTER 1. PRELIMINARIES 1.2 Properties of Integers 1.2.1 The Well Ordering Principle and the Division Algorithm We now focus on a special set, the integers, denoted Z, as this set plays an important
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
More informationGreatest common divisors
Greatest common divisors Robert Friedman Long division Does 5 divide 34? It is easy to see that the answer is no, for many different reasons: 1. 34 does not end in a 0 or 5. 2. Checking directly by hand,
More information2. Integers and Algorithms Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers
2. INTEGERS AND ALGORITHMS 155 2. Integers and Algorithms 2.1. Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers with a b > 0. (1) Apply the division algorithm: a = bq + r, 0 r < b.
More informationMATH 118 HW 1 LINDSAY CROSS, KELLY DOUGAN, KEVIN LIU
MATH 118 HW 1 LINDSAY CROSS, KELLY DOUGAN, KEVIN LIU 1.2 Problem 2. Find the greatest common divisor g of the numbers 1819 and 3574, and then find integers x and y to satisfy 1819x + 3587y = g. Use the
More informationGREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
More information25 Integral Domains. Subrings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 25 Integral Domains. Subrings In Section 24 we defined the terms unitary rings and commutative rings. These terms together
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 informationBasic Notation and Properties of Integers
Basic Notation and Properties of Integers Denote the set of natural numbers N = {1, 2, 3,...} and the set of integers Z = {..., 3, 2, 1, 0, 1, 2, 3,...}. Let a and b be integers. We say that a divides
More information17 Lagrange s Theorem
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 17 Lagrange s Theorem A very important corollary to the fact that the left cosets of a subgroup partition a group is Lagrange
More informationAlgebra for Digital Communication
EPFL  Section de Mathématiques Algebra for Digital Communication Fall semester 2008 Solutions for exercise sheet 1 Exercise 1. i) We will do a proof by contradiction. Suppose 2 a 2 but 2 a. We will obtain
More informationDivides. Note a b is a statement, a/b is a number.
Divides Given integers a and b we say a divides b and write a b provided there exists and integer q such that aq = b. Examples Does 3 divide 6? Does 3 divide 6? Does 7 divide 15? Does 5 divide 0? Does
More informationPractice Problems for First Test
Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the human mind will never penetrate.
More informationTheorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.
Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,
More informationMath 135 Algebra Midterm Solutions
Math 135  Midterm Examination 1 Math 135 Algebra Midterm Solutions Question 1. (a) [4 marks] Consider the following two statements: x y(p (x) = Q(y)), and ( x P (x)) = ( y Q(y)) Give an example of a universe
More informationBasic Properties of Rings
LECTURE 15 Basic Properties of Rings Theorem 15.1. For any element a in a ring R, the equation a + x 0 R has a unique solution. We know that a + x 0 R has at least one solution u R by Axiom (5) in the
More informationPROBLEM SET # 2 SOLUTIONS
PROBLEM SET # 2 SOLUTIONS CHAPTER 2: GROUPS AND ARITHMETIC 2. Groups.. Let G be a group and e and e two identity elements. Show that e = e. (Hint: Consider e e and calculate it two ways.) Solution. Since
More informationAbstract Algebra. Ch 0: Preliminaries. Properties of Integers
Abstract Algebra Ch 0: Preliminaries Properties of Integers Note: Solutions to many of the examples are found at the end of this booklet, but try working them out for yourself first. 1. Fundamental Theorem
More informationYour Name: MA 261 Worksheet Monday, April 21, 2014
Your Name: MA 261 Worksheet Monday, April 21, 2014 1. Show that 2 11,213 1 is not divisible by 11. Solution: To say that 2 11,213 1 is divisible by 11 is equivalent to saying that 2 11,213 1 (mod 11).
More informationMATH Algebra for High School Teachers Integral Domains
MATH 57091  Algebra for High School Teachers Integral Domains Professor Donald L. White Department of Mathematical Sciences Kent State University D.L. White (Kent State University) 1 / 8 Cancellation
More informationMODULAR ARITHMETIC STEVEN DALE CUTKOSKY
MODULAR ARITHMETIC STEVEN DALE CUTKOSKY 1. Relations, Rational Numbers and Modular Arithmetic 1.1. Relations. Suppose that X is a set. a relation on X is a subset R X X = {(a, b) a, b X}. Write a b if
More informationAlgebra. Sample Solutions for Test 1
EPFL  Section de Mathématiques Algebra Fall semester 20082009 Sample Solutions for Test 1 Question 1 (english, 30 points) 1) Let n 11 13 17. Find the number of units of the ring Z/nZ. 2) Consider the
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationAlgebra Interactive. Reader. Arjeh M. Cohen, Hans Cuypers, Hans Sterk. Eindhoven University of Technology
Algebra Interactive Reader Arjeh M. Cohen, Hans Cuypers, Hans Sterk Eindhoven University of Technology iii Preface Algebra Interactive is designed as modern course material for undergraduate courses in
More informationHave two operations addition and multiplication. Multiplication is associative, commutative, has identity
The integers Have two operations addition and multiplication Addition is associative, commutative, has identity and each element has an additive inverse Multiplication is associative, commutative, has
More informationFinding Multiplicative Inverses Modulo n
Fall 2005 Chris Christensen Cryptology Notes Finding Multiplicative Inverses Modulo n It is not necessary to do trial and error to determine the multiplicative inverse of an integer modulo n. If the modulus
More informationBASIC CONCEPTS ON NUMBER THEORY
BASIC CONCEPTS ON NUMBER THEORY This is a brief introduction to number theory. The concepts to cover will enable us to answer questions like: How many integers between 50 and 150 are divisible by 4? How
More informationa = bq + r where 0 r < b.
Lecture 5: Euclid s algorithm Introduction The fundamental arithmetic operations are addition, subtraction, multiplication and division. But there is a fifth operation which I would argue is just as fundamental
More informationMath 453: Elementary Number Theory Definitions and Theorems
Math 453: Elementary Number Theory Definitions and Theorems (Class Notes, Spring 2011 A.J. Hildebrand) Version 1302011 1 About these notes One purpose of these notes is to serve as a handy reference
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationDefinition 1 An algorithm is a definite procedure for solving a problem using a finite number of steps.
3. The Fundamentals 3.1 Algorithms Definition 1 An algorithm is a definite procedure for solving a problem using a finite number of steps. Searching Algorithms Problem: Locate an element x in a list of
More informationDefinition: Twin Primes.
4.5.. Definition: Twin Primes. If p and p + are both prime numbers, then p and p + are called twin primes Examples: Find all twin primes between 5 and 50. The primes 5 50 are: 7, 9, 3, 9, 3, 37, 4, 43,
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationLinear Congruences. The subject of this lecture is how to solve any linear congruence. ax b (mod m)
Linear Congruences In ordinary algebra, an equation of the form ax = b (where a and b are given real numbers) is called a linear equation, and its solution x = b/a is obtained by multiplying both sides
More informationBasic Number Theory 1
Basic Number Theory 1 Divisibility Basic number theory uncovers the multiplicative structure of the integers. As such, the most important relation between integers is divisibility: the nonzero integer
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More information3. Applications of Number Theory
3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationNOTES ON BASIC NUMBER THEORY
NOTES ON BASIC NUMBER THEORY 1. DIVISORS AND GREATEST COMMON DIVISORS Definition 1.1. Let a,b be nonzero integers. We say b is divisible by a (or a divides b) if there is an integer x such that a x =
More informationSection 41 Divisibility. Even integers can be represented by the algebraic expression: Odd integers can be represented by the algebraic expression:
Section 41 Divisibility Even and Odd Numbers: A number is even if: It has 2 as a factor It is divisible by 2 (when divided by 2 the remainder is 0) A number is odd if: It does not have a factor of 2 When
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationInteger Divisibility and Division
Integer Divisibility and Division Let a and b be integers. We say that a divides b, if b = ka for some integer k. In symbols, this relationship is written as a b. In this case we also say that a is a divisor
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 informationELEMENTS OF NUMBER THEORY: LECTURE NOTES. The goal of these several lectures is to discuss in more details some properties of
ELEMENTS OF NUMBER THEORY: LECTURE NOTES FELIX LAZEBNIK The goal of these several lectures is to discuss in more details some properties of integers. In what follows Z = {0, 1, 1, 2, 2, 3, 3,..., n, n,...
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationClock Arithmetic and Euclid s Algorithm
Clock Arithmetic and Euclid s Algorithm Lecture notes for Access 2006 by Erin Chamberlain. Earlier we discussed Caesar Shifts and other substitution ciphers, and we saw how easy it was to break these ciphers
More informationTopics in Number Theory
Chapter 8 Topics in Number Theory 8.1 The Greatest Common Divisor Preview Activity 1 (The Greatest Common Divisor) 1. Explain what it means to say that a nonzero integer m divides an integer n. Recall
More informationFurther linear algebra. Chapter I. Integers.
Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides
More information1. The Natural Numbers Denition 1.1. Given sets a and b, the order pair of a and b is dened as the set
1. The Natural Numbers Denition 1.1. Given sets a and b, the order pair of a and b is dened as the set (a, b) = {{a}, {a, b}}. For two sets A and B we dene the Cartesian product of A and B as We often
More information, but this gives r Q, so there are no 2 PT s in a geometric progression.
(1) (Niven 5.3.3) Find all PT s whose terms form an (a) Arithmetic progression Such a triple would be of the form (b d, b, b + d) for b, d Z +. To be Pythagorean triples, we require (b d) + b = (b + d)
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More information2 The Euclidean algorithm
2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In
More informationMATH10101: problems for supervision in week 12 SOLUTIONS
MATH10101: problems for supervision in week 12 SOLUTIONS Q37.. Use the table below to sieve the integers up to 200 for primes. Thus calculate π200. What is the smallest composite number greater than 200
More informationChapter 6. Number Theory. 6.1 The Division Algorithm
Chapter 6 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More informationGiven two integers a, b with a 0. We say that a divides b, written
1 Divisibility Given two integers a, b with a 0. We say that a divides b, written a b, if there exists an integer q such that b = qa. When this is true, we say that a is a factor (or divisor) of b, and
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: November 8, 2016) 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 information10 The Euclidean Algorithm
Division 10 The Euclidean Algorithm Number theory is the mathematics of integer arithmetic. In this chapter we will restrict ourselves to integers, and in particular we will be concerned primarily with
More informationDefinition 1 Let a and b be positive integers. A linear combination of a and b is any number n = ax + by, (1) where x and y are whole numbers.
Greatest Common Divisors and Linear Combinations Let a and b be positive integers The greatest common divisor of a and b ( gcd(a, b) ) has a close and very useful connection to things called linear combinations
More informationMath 31  Homework 1 Solutions
Math 31  Homework 1 Solutions 1. Find gcd(a, b) and express gcd(a, b) as ma + nb for: (a) (116, 84) Solution. Use the Euclidean algorithm: 116 = ( 1)( 84) + 32 84 = ( 3)(32) + 12 32 = (2)(12) + 8 12 =
More informationChapter 5 Number Theory. 5.1 Primes, composites, and tests for divisibility
Chapter 5 Number Theory 5.1 Primes, composites, and tests for divisibility Primes and Composites Prime number (prime) a counting number with exactly two different factors Composite number (composite) a
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationCLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010
CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010 1. Greatest common divisor Suppose a, b are two integers. If another integer d satisfies d a, d b, we call d a common divisor of a, b. Notice that as
More informationHomework 5 Solutions
Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which
More information5. Integers, Whole Numbers And Rational Numbers
5. Integers, Whole Numbers And Rational Numbers The set of natural numbers,, is the building block for most of the real number system. But is inadequate for measuring and describing physical quantities,
More informationMTH 382 Number Theory Spring 2003 Practice Problems for the Final
MTH 382 Number Theory Spring 2003 Practice Problems for the Final (1) Find the quotient and remainder in the Division Algorithm, (a) with divisor 16 and dividend 95, (b) with divisor 16 and dividend 95,
More informationModular arithmetic. Number Theory. Modular arithmetic and GCD. Misha Lavrov. ARML Practice 9/22/2013
Number Theory Modular arithmetic and Misha Lavrov ARML Practice 9/22/2013 Modular arithmetic Definition If a, b, m are integers, m > 0, we say a and b are equivalent mod m, written a b (mod m), if a b
More informationGCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!
GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!!! Challenge Problem 2 (Mastermind) due Fri. 9/26 Find a fourth guess whose scoring will allow you to determine the secret code (repetitions are
More informationSolutions to Practice Problems
Solutions to Practice Problems March 205. Given n = pq and φ(n = (p (q, we find p and q as the roots of the quadratic equation (x p(x q = x 2 (n φ(n + x + n = 0. The roots are p, q = 2[ n φ(n+ ± (n φ(n+2
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationMATH10040 Chapter 3: Congruences and the Chinese Remainder Theorem
MATH10040 Chapter 3: Congruences and the Chinese Remainder Theorem 1. Congruence modulo m Recall that R m (a) denotes the remainder of a on division by m. Thus, by the division algorithm, 0 R m (a) < m
More informationDiscrete Mathematics, Chapter 4: Number Theory and Cryptography
Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility
More informationNumber Theory Review for Exam #2
Number Theory Review for Exam #2 1. Applications of Continued Fractions Be able to: Use convergents of a continued fraction to find the smallest solution to Pell s equation x 2 + dy 2 = 1 Find other solutions
More information7.2 Applications of Euler s and Fermat s Theorem.
7.2 Applications of Euler s and Fermat s Theorem. i) Solving nonlinear congruences. Example Find a solution to x 12 3 mod 11. Solution Any solution of this must satisfy gcd (x, 11) = 1 so Fermat s Little
More information26 Ideals and Quotient Rings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 26 Ideals and Quotient Rings In this section we develop some theory of rings that parallels the theory of groups discussed
More informationLinear Diophantine Equations By Frederick Dooe. Number Theory Boston University, summer 09 Instructor Kalin Kostadinov
By Frederick Dooe Number Theory Boston University, summer 09 Instructor Kalin Kostadinov I. Introduction Diophantine equations are named for Diophantus of Alexandria who lived in the third century. He
More informationAPPLICATIONS OF THE ORDER FUNCTION
APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and
More informationNUMBER THEORY. Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen
NUMBER THEORY Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen NUMBER THEORY Study of the set of integers and their properties DIVISIBILITY Division When one integer is divided
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationElementary Number Theory
Elementary Number Theory Ahto Buldas December 3, 2016 Ahto Buldas Elementary Number Theory December 3, 2016 1 / 1 Division For any m > 0, we define Z m = {0, 1,... m 1} For any n, m Z (m > 0), there are
More informationMODULAR ARITHMETIC (SHORT VERSION)
MODULAR ARITHMETIC (SHORT VERSION) KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic, which lets
More informationLearn basic proofing techniques for greatest common divisors ,
Learning Module 3 The Greatest Common Divisor Objectives. Understand the definition of greatest common divisor (gcd). Learn the basic the properties of the gcd. Understand Euclid s algorithm. Learn basic
More information35 Greatest Common Divisor
35 Greatest Common Divisor Tom Lewis Fall Term 2010 Tom Lewis () 35 Greatest Common Divisor Fall Term 2010 1 / 10 Outline 1 The gcd 2 The Euclidean algorithm 3 An important theorem Tom Lewis () 35 Greatest
More informationSUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
More informationCOMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
More informationIntroduction to Finite Fields Yunghsiang S. Han
Introduction to Finite Fields Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan Email: yshan@mail.ntpu.edu.tw Y. S. Han Finite fields 1 Groups Let G
More informationBasic properties of the integers
Basic properties of the integers MA 341 Spring 2011 1 Definitions The natural numbers are the numbers 1, 2, 3,... (some authors include zero, as well), and for shorthand, we will denote the collection
More informationSolutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2)
Solutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2) Problems from 21 211 Prove that a b (mod n) if and only if a and b leave the same remainder when divided by n Proof Suppose a
More informationUniversity of Tokyo: Advanced Algorithms Summer Lecture 4 13 May
University of Tokyo: Advanced Algorithms Summer 2010 Lecture 4 13 May Lecturer: François Le Gall Scribe: Martsinkevich Tatiana Definition: A prime number is an integer p > 1 whose only divisors are 1 and
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationChapter Two. Number Theory
Chapter Two Number Theory 2.1 INTRODUCTION Number theory is that area of mathematics dealing with the properties of the integers under the ordinary operations of addition, subtraction, multiplication and
More informationthe LCD is the product found by using certain prime number factors of each denominator.
DETAILED SOLUTIONS AND CONCEPTS  RATIONAL EXPRESSIONS AND EQUATIONS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions Comments to ingrid.stewart@csn.edu. Thank you! PLEASE
More information(3) Greatest common divisor
(3) Greatest common divisor In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more nonzero integers, is the largest
More informationPMTH338 NUMBER THEORY
PMTH338 NUMBER THEORY The tutorial questions contained in this booklet have mostly been selected from Elementary Number Theory and its Applications by Kenneth H. Rosen, 3rd ed. Addison Wesley. References
More information