Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures
|
|
- David Noel Kennedy
- 6 years ago
- Views:
Transcription
1 Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures Lance Burger Fresno State Preliminary Edition
2 Contents Preface ix 1 Z The Integers What are the Integers? The Euclidean Algorithm History Division Algorithm Proof of the Euclidean Algorithm Linear Diophantine Equations in Z Solving ax + by = c Linear Diophantine Equation Proofs Chapter 1 Exercises v
3 Preface This text is for students who want to become secondary mathematics teachers. The theme is to show the structural algebraic connections between sets of numbers and sets of polynomials. One approach to this is the study of Diophantine equations in multiple settings, such as integers, integers modulon and single variable polynomials. This approach also emphasizes the role of questioning and justification in learning mathematics, as well as rich-problem lesson design. With an understanding of this book, it is anticipated that a secondary mathematics teacher will understand the importance of even primary mathematics, in terms of its connection to higher more abstract treatments found at the university level. Lance Burger January, 2014 ix
4
5 Chapter 1 Z The Integers 1.1 What are the Integers? Most all of you can recall that integers are the counting numbers, along with their opposites. One of the integers, though, is its own opposite, namely 0 needs to be included, thus: Z = {..., 3, 2, 1, 0, 1, 2, 3,...} More precisely in terms of what is called abstract algebra, the integers are a GROUP. Definition 1 A Group (G, ) is a set with a binary operation, having the following properties: 1. CLOSED-The set G is closed under the operation. In the integers the operation is +, or addition, and adding any two integers is still an integer, so everything stays in the set. For example, 309+( 26) = 283 and 283 is an integer. 2. ASSOCIATIVE-The operation * is associative, meaning: (a b) c = a (b c). For example, (2 + 3) + ( 5) = 5 + ( 5) = 0 and 2 + (3 + ( 5)) = 2 + ( 2) = IDENTITY- The set G has an identity element, e, for the operation, such that: e a = a e = a for every element a in G. (a G). For the integers e = 0 and 0 + a = a + 0 = a for all integers. 1
6 2 CHAPTER 1 Z THE INTEGERS 4. INVERSES-For every element a in the set G there is an inverse element b G such that a b = b a = e. Typically, for an additive group b = a and for a multiplicative group b = a 1. As an example in the integers, the inverse of the element 234 is 234 since ( 234) = ( 234) = 0. Definition 2 A binary operation is COMMUTATIVE if a b = b a for ALL of the elements in the set the operation is defined on. Remark 1 It is important to point out that in the definition for a group, commutativity is required for identity elements and inverse elements, but this doesn t mean the operation is commutative for ALL of the elements in the group. Definition 3 An ABELIAN GROUP,named after the mathematician Niels Abel ( ), is a group (G, ) such that a b = b a for ALL of the elements in G. Is the set of natural numbers {1, 2, 3,...}, closed under the operation of subtraction? Are the integers closed under the operation of division? Is the set of integers a group under the operation of multiplication? Is subtraction an associative operation in the integers? a counter example? Can you give Is (Z, ) a group? Is (Z, ) a group? Is (Z, ) a group? Is (Z, +) an abelian group? Is the subtraction operation commutative for the integers? subtraction is defined as: a b = a + ( b). Note that
7 1.2 THE EUCLIDEAN ALGORITHM The Euclidean Algorithm History Though the algorithm was coined after mathematician Euclid after appearing in Euclid s Elements around 300 BC, the algorithm itself is thought to have been in existence since around 500 BC. Euclid s method however, was applied geometrically as a method to find a common measure between two line lengths Division Algorithm Before going over the Euclidean Algorithm, I will first describe the Division Algorithm, the backbone of the Euclidean Algorithm. Definition 4 Division Algorithm. Given any integer a and b, with a > 0, there exists a unique integer q and r such that b = qa + r, where 0 r < a. The integer a is called the DIVIDEND, b is called the DIVISOR, q is called the QUOTIENT, and r is called the REMAINDER. Example 1 To show the simplicity in the Euclidean Algorithm, we go over a short example. Let b = 325 and a = 53. Solve for q and r. We begin the example by dividing the smaller number, a, into the larger number, b to get 325/53 = We can easily see that 6 is the quotient. To find the remainder, we go through a few short steps. We multiply the quotient by the smaller number to get, 53x6 = 318. Then, we subtract that result from the larger to number to get, = 7. Therefore, we find that 7 is our remainder, and in all, q = 6 and r = 7. Now, the Euclidean Algorithm is simply an application of the Division Algorithm.
8 4 CHAPTER 1 Z THE INTEGERS Proof of the Euclidean Algorithm Proof. Given integers b and c with c > 0, we make repeated applications of the Division Algorithm to obtain a series of equations: b = cq 1 + r 1, where 0 < r 1 < c. This continues with, c = r 1 q 2 + r 2, r 1 = r 2 q 3 + r 3, with 0 < r 2 < r 1 and 0 < r 3 < r 2 until we reach, r j 1 = r j a j + 1 where gcd(b, c) = r j, the last nonzero remainder. Variables x and y in gcd(b, c) = bx + cy is obtained by writing each r j as a linear combination b and c. The proof is very simple. The chain of equations is obtained by dividing c into b, r 1 into c, r 2 into r 1, and so forth until r j is divided into r j 1. The process of division stops when the remainder is 0. A key difference between the Division Algorithm and the Euclidean Algorithm is the equality signs on the conditions. For the Division Algorithm 0 r < c, however, for the Euclidean Algorithm, it is simply 0 < r < c. The reason being is that if r = 0, then the series of equations would stop at b = cq 1, implying the gcd(b, c) = c. Last, we need to prove that r j is the greatest common divisor or b and c. First, we observe the following: gcd(b, c) = gcd(b cq 1, c) = gcd(r 1, c) = gcd(r 1, c r 1 q 2 ) = gcd(r 1, r 2 ) = gcd(r 1 r 2 q 3, r 2 ) = gcd(r 3, r 2 ) By mathematical induction, we end up seeing that gcd(b, c) = gcd(r j 1, r j ) = gcd(r j, 0) = r j. Concluding the proof that r j = gcd(b, c).
9 1.2 THE EUCLIDEAN ALGORITHM 5 Corollary 1 As a consequence of the above proof, back substitution can be performed, similar to the following example, so that a linear combination can always be found such that: bx + cy = gcd(b, c) Example 2 Find the greatest common divisor of and We first let b = and c = By applying the Division Algorithm, we divide c into b to see that 42823/6409 = Making the quotient q 1 = 6. Then, we multiply the quotient by c to get = Finally, we subtract from b to get = 4369, making 4369 the remainder, r 1. Next, we apply the Euclidean Algorithm to see the series of equations: = = = = = Because the last remainder of the algorithm is 0, the gcd(42823,6409) = 17. Definition 5 The integers have the DISTRIBUTIVE PROPERTY for multiplication OVER addition, or a (b + c) = a b + a c for all elements a, b and c in Z. Definition 6 In the integers, we say that n a if there is an integer b such that a = n b. For exampe, 6 24 because there is an integer, 4, such that 6 ( 4) = 24. Verbally, n a is said as n divides a.
10 6 CHAPTER 1 Z THE INTEGERS Reflection Question(s) 1 Based on the previous definition does 0 12 make any sense? Definition 7 The gcd(a, b), or greatest common divisor of two integers a and b, is the largest positive integer that divides both a and b. Definition 8 A PRIME number is a positive integer p with exactly two factors, p and 1. Example 3 How many positive factors are there for the integer 75? 75 = The possible factors are all of the combinations of {3 0, 3 1 } {5 0, 5 1, 5 2 }. There are 2 3 = 6 possible factors = 1 1 = = 1 5 = = 1 25 = = 3 1 = = 3 5 = = 3 25 = 75 As a quick way to solve problems such as this, simply write the prime factoriation and add 1 to each of the powers to account for the 0 power possibility that none of that prime is a factor, and then multiply the (powers+1) together: = 6. Lecture Problem 1 How many positive factors does 5400 have? Definition 9 Integers a and b are RELATIVELY PRIME iff gcd(a, b) = 1.
11 1.2 THE EUCLIDEAN ALGORITHM 7 Definition 10 n is an EVEN integer iff 2 n, or n = 2k, for some k Z. If n is not even, then it is ODD and of the form n = 2k + 1 for some k Z. Example 4 Reduce the fraction 42 by finding the gcd(42, 56). 56 One way to find the gcd of a group of integers is to find the common prime factors and multiply them together. 42 = 6 7 = and 56 = 8 7 = so the common prime factors are 2 and 7, which multiply to = 3 and = 4. This means that 42 = 14 3 = 1 3 = Example 5 The Calculator Trick is a quick way to find gcd s and is demonstrated here as a way to reduce a diffi cult fraction using the Euclidean Algorithm: Reduce the fraction The following use of the calculator works because of the distributive property = (Since this is a rational number, it must be a repeating decimal.) 2. Now, subtract off the integer part of the decimal number: = Next multiply this decimal part by the original divisor: 8051 ( ) = 582 This is the remainder. Again, why this works is because of the 8633 distributive property. = ( ). After cross multiplying the 8051 one obtains: 8633 = ( ) = Since the decimal part is less than 1, it must be that not all of an 8051 went into 8633, which is why it is the remainder. The Euclidean algorithm now continues by dividing 8051 by = Again, using the calculator trick, = and 582 ( ) = = = (0.2) = = 5 This is the final step of the Euclidean Algorithm, since there is no remainder. This imlplies that gcd(8051, 8633) = Now it is much easier to reduce the fraction, since we know the largest common factor of both numbers = 83 and = 89. The answer is
12 8 CHAPTER 1 Z THE INTEGERS 1.3 Linear Diophantine Equations in Z Solving ax + by = c Definition 11 A DIOPHANTINE EQUATION is any equation in which the solutions are over the integers. Remark 2 The most famous diophantine equation is x n + y n = z n, which is known as Fermat s Last Theorem, which was conjectured by the Frenchman Pierre de Fermat in 1637 and finally proven by the British mathematician Andrew Wiles in The theorem conjectured that for n > 2, there are no integer solutions. Figure 1 Diophantus. Example 6 x 3 +y 3 = z 3 has many solutions over the real numbers R, such as x = 1.y = 1 and z = 3 2; but it is known now that there are no solutions over the integers, due to Fermat s Last Theorem. The term Diophantine derives from the ancient Greek mathematician Diophantus, known as the Father of Algebra. Diophantus lived in Alexandria around AD 250 and wrote one of the earliest books on algebra, Arithmetica. The equation 2x + 3 = 4 is not a Diophantine equation. Why not? The equation 2x + 6y = 12 is a Diophantine equation. Can you find several solutions in integers? How many solutions are there? The simplest Diophantine equation in a single variable is ax = b, with a 0. Under what condition is it solvable in integers?
13 1.3 LINEAR DIOPHANTINE EQUATIONS IN Z Linear Diophantine Equation Proofs Preliminaries: Definition 12 The integers have the DISTRIBUTIVE PROPERTY for multiplication OVER addition, or a (b + c) = a b + a c for all elements a, b and c in Z. Definition 13 In the integers, we say that n a if there is an integer b such that a = n b. For exampe, 6 24 because there is an integer, 4, such that 6 ( 4) = 24. Lemma 1 Given a, b, c, d, n Z, if n a and n b then n ac + bd. Proof. Since n a and n b, then there must be integers k and l such that a = nk and b = nl. So, upon substitution: ac + bd = nkc + nld = n (kc + ld). Since the integers are CLOSED under addition and multiplication, then kc + ld Z, so this implies that n ac + bd Remark 3 The reverse of the DISTRIBUTIVE PROPERTY was used above to obtain nkc + nld = n (kc + ld). This is called FACTORING. Here is the main Theorem for solving Diophantine Equations in this Chapter. Theorem 2 Let a, b, c Z. Consider the Diophantine equation ax + by = c. Claim 1 If gcd(a, b) c then there are no solutions. Claim 2 If gcd(a, b) c, then there are infinitely many solutions of the form: b x = x 0 + gcd(a, b) k a y = y 0 gcd(a, b) k where (x 0, y 0 ) is a particular solution, and k Z.
14 10 CHAPTER 1 Z THE INTEGERS Claim 3 Any integer solution (x, y) to ax + by = c has the form in part (b), given ax 0 + by 0 = c. Proof. Claim 1-(Proof by contradiction) Suppose gcd(a, b) c and there IS a solution (x, y). Then by the previous Lemma, since gcd(a, b) a and gcd(a, b) b, then gcd(a, b) ax + by = c (these two implication arrows going opposite directions means there is a contradiction in the logic, so it must be the case that if gcd(a, b) c then there are NO solutions.) Claim 2-Suppose gcd(a, b) c. Then by definition, there is an integer k such that c = k gcd(a, b). By the previous theorem, there are integers s and t such that: as + bt = gcd(a, b) therefore; giving a particular solution; ask + btk = k gcd(a, b) = c. x 0 y 0 = sk = tk. Given this particular solution, the general solution now follows: ( ) ( ) b a x 0 + gcd(a, b) k a + b y 0 gcd(a, b) k = ax 0 + abk gcd(a, b) + by 0 = ax 0 + by 0 + abk gcd(a, b) = ax 0 + by 0 = c bak gcd(a, b) abk gcd(a, b) Claim 3-Suppose ax + by = ax 0 + by 0 = c. Then:ax + by (ax 0 + by 0 ) = c c = 0 ax + by ax 0 by 0 = c c = 0 = ax ax 0 + by by 0 = a(x x 0 ) + b(y y 0 ) a(x x 0 ) = b(y y 0 ) But recall that gcd(a.b), by definition, divides a and b.
15 1.3 LINEAR DIOPHANTINE EQUATIONS IN Z 11 Example 7 Solve the Diophantine equation 42823x y = 51. The first step in solving a Diophantine equation, is to check to see if it is even solvable. To do that, it is necessary to use the previous listed theorems and find the gcd(a, b) and then see if the gcd divides the c terms. In Example 2, it was found that gcd(42823, 6409) = 17. Since 17 51, i.e., 51 = 3 17, then this Diophantine equation is solvable. The next step is to find integers x and y such that: 42823x y = 17 To do this, a series of substitutions are required. Going back to Example 2, recall the following steps in finding the gcd, but this time, in each case, solve for the remainder as follows: = (1) ( 6) = = (1) ( 1) = = (1) ( 2) = = (1) + 289( 7) = 17 Now, beginning with the last equation, a long string of back substitutions and distributive multiplication must be performed as follows: 2040(1) + 289( 7) = (1) + [4369(1) ( 2)]( 7) = 2040(1) ( 7) (14) = 2040(1 + 14) ( 7) = 2040(15) ( 7) = (15) ( 7) = [6409(1) ( 1)](15) ( 7) = 6409(15) ( 15) ( 7) = 6409(15) ( 22) = 17
16 12 CHAPTER 1 Z THE INTEGERS 6409(15) ( 22) = 6409(15) + [42823(1) ( 6)]( 22) = 6409(15) ( 22) (132) = ( 22) (147) = 17 Hence, x = 22 and y = 147 for the equation 42823x+6409y = 17. Now to solve the original problem, since 51 = 3 17, we can multiply both sides of the gcd equation by 3 and distribute it in to the x and y solutions as follows: 3[42823( 22) (147)] = (3 ( 22)) (3 147) = ( 66) (441) = 51 The solution to the original problem is: x = 66 and y = 441. Lecture Problem 2 If solvable, find integer solutions for 6x + 12y = 30. Lecture Problem 3 If solvable, find integer solutions for 18x+72y = 55. Lecture Problem 4 If solvable, find integer solutions for 60x+770y = 500.
17 1.4 CHAPTER 1 EXERCISES Chapter 1 Exercises Exercise 1 Which of the following Diophantine equations can not be solved? Explain with mathematical justifications. a. 6x + 51y = 22 b. 33x + 14y = 115 c. 14x + 35y = 93 Exercise 2 Solve the Diophantine equation 56x + 72y = 40. Exercise 3 Solve the Diophantine equation 24x + 138y = 18. Exercise 4 Solve the Diophantine equation 85x + 30y = 215. Exercise 5 One of the Diophantine equations below is solvable. solution to the solvable equation: Find the 195x + 221y = 12 Exercise 6 Reduce the fraction x + 123y = 12 by finding gcd(7739, 31937). Exercise 7 Reduce the fraction by finding gcd(96496, ) Historical Applications Exercise AD Alcuin of York- A hundred bushels of grain are distributed among 100 people in such a way that each man receives 3 bushels, each woman 2 bushels and each child a half a bushel. How many men, women and children are there?
18 14 CHAPTER 1 Z THE INTEGERS Exercise 9 850AD-Mahavira-There were 63 equal piles of plantain fruit put together with seven single plantains. They were divided evenly among 23 travelers. How many plantains did each traveler get? [Hint: Consider 63x + 7 = 23y.] Figure 2 Exercise AD-Yen Kung-We have an unknown number of coins which were put on a number of strings in equal amounts (see Fig.2). If you make 77 strings of them you are 50 coins short, but if you make 78 strings then you have the exact number of coins. Find the number of coins [Hint: Consider 77x 50 = 78y.]
Deepening Mathematics Instruction: Algebraic Structures for Teachers
Deepening Mathematics Instruction: Algebraic Structures for Teachers Lance Burger Fresno State Preliminary Edition Contents Preface ix 1 Z The Integers 1 1.1 What are the Integers?-Groups.................
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 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 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 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 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 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 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 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 elements of number theory
Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a
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 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 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 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 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 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 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 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 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 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 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 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 informationChapter 1. Greatest common divisor. 1.1 The division theorem. In the beginning, there are the natural numbers 0, 1, 2, 3, 4,...,
Chapter 1 Greatest common divisor 1.1 The division theorem In the beginning, there are the natural numbers 0, 1, 2, 3, 4,..., which constitute the set N. Addition and multiplication are binary operations
More informationWith Question/Answer Animations. Chapter 4
With Question/Answer Animations Chapter 4 Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their properties. Key ideas in number theory include divisibility
More information4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus...
PREFACE These notes have been prepared by Dr Mike Canfell (with minor changes and extensions by Dr Gerd Schmalz) for use by the external students in the unit PMTH 338 Number Theory. This booklet covers
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 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 informationRemainders. We learned how to multiply and divide in elementary
Remainders We learned how to multiply and divide in elementary school. As adults we perform division mostly by pressing the key on a calculator. This key supplies the quotient. In numerical analysis and
More informationElementary Algebra Chinese Remainder Theorem Euclidean Algorithm
Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we
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 informationOn the Cardinality of Mersenne Primes
On the Cardinality of Mersenne Primes Garimella Rama Murthy, Associate Professor, International Institute of Information Technology (IIIT), Gachibowli, Hyderabad-32,AP,INDIA ABSTRACT In this research paper,
More informationChapter 1 A Survey of Divisibility 14
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
More informationThis is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.
8 Modular Arithmetic We introduce an operator mod. Let d be a positive integer. For c a nonnegative integer, the value c mod d is the remainder when c is divided by d. For example, c mod d = 0 if and only
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 informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
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 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 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 informationLECTURE 1: DIVISIBILITY. 1. Introduction Number theory concerns itself with studying the multiplicative and additive structure of the natural numbers
LECTURE 1: DIVISIBILITY 1. Introduction Number theory concerns itself with studying the multiplicative and additive structure of the natural numbers N = {1, 2, 3,... }. Frequently, number theoretic questions
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 informationMATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6
MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS PETE L. CLARK Contents 1. Polynomial Functions 1 2. Rational Functions 6 1. Polynomial Functions Using the basic operations of addition, subtraction,
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 informationLeLing13: Polynomials and complex numbers. Division of polynomials. Euclides s algorithm and multiple roots. R ecommended exercises: Geoling 15.
LeLing13: Polynomials and complex numbers. C ontents: Polynomials and non-polynomial expressions. The roots of x + 1 = 0: the complex numbers. The inverse 1 and the conjugate. z Roots of polynomials. Conjugate
More informationRings and modular arithmetic
Chapter 8 Rings and modular arithmetic So far, we have been working with just one operation at a time. But standard number systems, such as Z, have two operations + and which interact. It is useful to
More 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 informationCS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II
CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA
More 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 informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More 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 informationChapter 14: Divisibility and factorization
Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter
More informationA number that can be written as, where p and q are integers and q Number.
RATIONAL NUMBERS 1.1 Definition of Rational Numbers: What are rational numbers? A number that can be written as, where p and q are integers and q Number. 0, is known as Rational Example:, 12, -18 etc.
More informationMath 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition. Todd Cochrane
Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition Todd Cochrane Department of Mathematics Kansas State University Contents Notation v Chapter 0. Axioms for the set of Integers Z. 1 Chapter 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 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya Resources: Kenneth Rosen,
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More 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 informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More informationInteger and Polynomial Arithmetic First Steps towards Abstract Algebra. Arjeh M. Cohen Hans Cuypers Hans Sterk
Integer and Polynomial Arithmetic First Steps towards Abstract Algebra Arjeh M. Cohen Hans Cuypers Hans Sterk October 8, 2007 2 Contents 1 Integer arithmetic 7 1.1 Divisors and multiples......................
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 informationECE 646 Lecture 5. Mathematical Background: Modular Arithmetic
ECE 646 Lecture 5 Mathematical Background: Modular Arithmetic Motivation: Public-key ciphers RSA as a trap-door one-way function PUBLIC KEY message ciphertext M C = f(m) = M e mod N C M = f -1 (C) = C
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 informationNumbers, Groups and Cryptography. Gordan Savin
Numbers, Groups and Cryptography Gordan Savin Contents Chapter 1. Euclidean Algorithm 5 1. Euclidean Algorithm 5 2. Fundamental Theorem of Arithmetic 9 3. Uniqueness of Factorization 14 4. Efficiency
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 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 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 informationLecture 7.5: Euclidean domains and algebraic integers
Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley
More 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 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 informationMathematical Foundations of Cryptography
Mathematical Foundations of Cryptography Cryptography is based on mathematics In this chapter we study finite fields, the basis of the Advanced Encryption Standard (AES) and elliptical curve cryptography
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
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 informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a Let a 975 and b161 Find d gcda, b and find s, t Z such that as + bt d Solution: The Euclidean Algorithm gives 161 975 1 + 86, 975 86 3 + 117, 86 117 + 5,
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 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 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 informationNumber theory lectures
Number theory lectures By Dr. Mohammed M. AL-Ashker Associated professor Mathematics Department E.mail:mashker @ mail.iugaza.edu Islamic University of Gaza P.O.Box 108, Gaza, Palestine 1 Contents 1 Divisibility
More informationModular Arithmetic and Elementary Algebra
18.310 lecture notes September 2, 2013 Modular Arithmetic and Elementary Algebra Lecturer: Michel Goemans These notes cover basic notions in algebra which will be needed for discussing several topics of
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 information= 5 2 and = 13 2 and = (1) = 10 2 and = 15 2 and = 25 2
BEGINNING ALGEBRAIC NUMBER THEORY Fermat s Last Theorem is one of the most famous problems in mathematics. Its origin can be traced back to the work of the Greek mathematician Diophantus (third century
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 information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
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 informationDaniel A. Klain. Essentials of Number Theory. Draft
Daniel A. Klain Essentials of Number Theory Daniel A. Klain Essentials of Number Theory Preliminary Edition last updated June 30, 2017 Copyright c 2017 by Daniel A. Klain Permission is granted to copy
More informationLecture 4: Number theory
Lecture 4: Number theory Rajat Mittal IIT Kanpur In the next few classes we will talk about the basics of number theory. Number theory studies the properties of natural numbers and is considered one of
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 informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationPMATH 340 Lecture Notes on Elementary Number Theory. Anton Mosunov Department of Pure Mathematics University of Waterloo
PMATH 340 Lecture Notes on Elementary Number Theory Anton Mosunov Department of Pure Mathematics University of Waterloo Winter, 2017 Contents 1 Introduction............................. 3 2 Divisibility.
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Nov 13, 2014 Quiz announcement The second quiz will be held on Thursday,
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 informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationCHAPTER 4: EXPLORING Z
CHAPTER 4: EXPLORING Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction In this chapter we continue the study of the ring Z. We begin with absolute values. The absolute value function Z N is the identity
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 informationElementary Number Theory MARUCO. Summer, 2018
Elementary Number Theory MARUCO Summer, 2018 Problem Set #0 axiom, theorem, proof, Z, N. Axioms Make a list of axioms for the integers. Does your list adequately describe them? Can you make this list as
More informationWarm-Up. Use long division to divide 5 into
Warm-Up Use long division to divide 5 into 3462. 692 5 3462-30 46-45 12-10 2 Warm-Up Use long division to divide 5 into 3462. Divisor 692 5 3462-30 46-45 12-10 2 Quotient Dividend Remainder Warm-Up Use
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 information