D i v i s i b i l i t y
|
|
- Arline Hill
- 5 years ago
- Views:
Transcription
1 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," is substantially more difficult to establish (see Lemma 2.13 in Section 2.1). Finally, it is presumed that you are familiar with the usual formulation of mathematical propositions. In particular, if A and B are two assertions, the following statements are logically equivalent they are just different ways of saying the same thing. A implies B. If A is true, then B is true. In order that A be true it is necessary that B be true. B is a necessary condition for A. A is a sufficient condition of B. If A implies B and B implies A, then one can say that B is a necessary and sufficient condition for A to hold. In general, we shall use letters of the roman alphabet, a, b,c,, m,n,,x,y,z to designate integers unless otherwise specified. We let Z denote the set {, -2, -1,0,1,2, } of all integers, Q the set of all rational numbers, U the set of all real numbers, and C the set of all complex numbers. 1.2 DIVISIBILITY Divisors, multiples, and prime and composite numbers are concepts that have been known and studied at least since the time of Euclid, about 350 b.c. The fundamental ideas are developed in this and the next section. Definition 1.1 An integer b is diuisible by an integer a, not zero, if there is an integer x such that b = ax, and we write a \b. In case b is not divisible by a, we write axb. Other language for the divisibility property a \ b is that a divides b, that a is a divisor of b, and that 6 is a multiple of a. If a\b and 0 < a < b, then a is called a proper divisor of b. It is understood that we never use 0 as the left member of the pair of integers in a \b. On the other hand, not only may 0 occur as the right member of the pair, but also in such instances we always have divisibility. Thus a 10 for every integer a not zero. The notation ak\\b is sometimes used to indicate that ak\b but ak+l/b.
2 1. 2 D i v i s i b i l i t y 5 Theorem 1.1 (1) a\b implies a \be for any integer c; (2) a\b and b\c imply a\c; (3) a\b and a\c imply a\(bx + cy) for any integers x and y; (4) a\b and b\a imply a = ±b; (5) a\b, a > 0, b > 0, imply a < b; (6) if m * 0, a\b implies and is implied by ma\mb. Proof The proofs of these results follow at once from the definition of divisibility. Property 3 admits an obvious extension to any finite set, thus: a\bua\b2,-,a\bn imply a 52 bjxj for any integers Xj, Property 2 can be extended similarly. To give a sample proof, consider item 3. Since a\b and a\c are given, this implies that there are integers r and s such that b = ar and c = as. Hence, bx + cy can be written as a(rx + sy), and this proves that a is a divisor of bx + cy. The next result is a formal statement of the outcome when any integer b is divided by any positive integer. For example, if 25 is divided by 7, the quotient is 3 and the remainder is 4. These numbers are related by the equality 25 = Now we formulate this in the general case. Theorem 1.2 The division algorithm. Given any integers a and b, with a > 0, there exist unique integers q and r such that b=qa+r,0<r<a. If axb, then r satisfies the stronger inequalities 0 < r < a. Proof Consider the arithmetic progression -, b - 3 a, b - 2 a, b - a, b, b + a, b + 2 a, b + 3 a, extending indefinitely in both directions. In this sequence, select the smallest non-negative member and denote it by r. Thus by definition r satisfies the inequalities of the theorem. But also r, being in the sequence, is of the form b - qa, and thus q is defined in terms of r. To prove the uniqueness of q and r, suppose there is another pair q{ and r, satisfying the same conditions. First we prove that r, = r. For if not, we may presume that r < r, so that 0 < r, r < a, and then we see
3 6 D i v i s i b i l i t y that r, - r = a(q - qx) and so a\(rx - r), a contradiction to Theorem 1.1, part 5. Hence r = r,, and also q = qv We have stated the theorem with the assumption a > 0. However, this hypothesis is not necessary, and we may formulate the theorem without it: given any integers a and b, with a * 0, there exist integers q and r such that b " qa + r, 0 < r < d. Theorem 1.2 is called the division algorithm. An algorithm is a mathe matical procedure or method to obtain a result. We have stated Theorem 1.2 in the form "there exist integers q and r," and this wording suggests that we have a so-called existence theorem rather than an algorithm. However, it may be observed that the proof does give a method for obtaining the integers q and r, because the infinite arithmetic progression,b - a,b,b + a, need be examined only in part to yield the smallest positive member r. In actual practice the quotient q and the remainder r are obtained by the arithmetic division of a into b. Remark on Calculation Given integers a and b, the values of q and r can be obtained in two steps by use of a hand-held calculator. As a simple example, if b = 963 and a = 428, the calculator gives the answer 2.25 if 428 is divided into 963. From this we know that the quotient q = 2. To get the remainder, we multiply 428 by 2, and subtract the result from 963 to obtain r = 107. In case b = 964 and a = 428 the calculator gives as the answer when 428 is divided into 964. This answer is approximate, not exact; the exact answer is an infinite decimal. Nevertheless, the value of q is apparent, because q is the largest integer not exceeding 964/428; in this case q = 2. In symbols we write q = [964/428]. (In general, if x is a real number then [x] denotes the largest integer not exceeding x. That is, [x] is the unique integer such that [x] < x < [x] + 1. Further proper ties of the function [x] are discussed in Section 4.1.) The value of r can then also be determined, as r = b - qa = = 108. Because the value of q was obtained by rounding down a decimal that the calculator may not have determined to sufficient precision, there may be a question as to whether the calculated value of q is correct. Assuming that the calculator performs integer arithmetic accurately, the proposed value of q is confirmed by checking that the proposed remainder b - qa = 108 lies in the interval 0 < r < a = 428. In case r alone is of interest, it would be tempting to note that 428 times is , and then round to the nearest integer. The method we have described, though longer, is more reliable, as it depends only on integer arithmetic.
4 2. 2 D i v i s i b i l i t y ' Definition 1.2 The integer a is a common divisor ofb and c in case a\b and a\c. Since there is only a finite number of divisors of any nonzero integer, there is only a finite number of common divisors ofb and c, except in the case b = c = 0. If at least one of b and c is not 0, the greatest among their common divisors is called the greatest common divisor of b and c and is denoted by (b,c). Similarly, we denote the greatest common divisor g of the integers bx, b2,-, b, not all zero, by (fe,, b2,- -,bn). Thus the greatest common divisor (b, c) is defined for every pair of integers b, c except b = 0, c = 0, and we note that (b, c) > 1. Theorem 1.3 If g is the greatest common divisor of b and c, then there exist integers x0 and y such that g = (b, c) = bx() + cy0. Another way to state this very fundamental result is that the greatest common divisor (abbreviated g.c.d.) of two integers b and c is expressible as a linear combination of b and c with integral multipliers x0 and y0. This assertion holds not just for two integers but for any finite collection, as we shall see in Theorem 1.5. Proof Consider the linear combinations bx + cy, where x and y range over all integers. This set of integers (bx + cy) includes positive and negative values, and also 0 by the choice x = y = 0. Choose jc and y0 so that bxt) + cy0 is the least positive integer / in the set; thus / = bxa + cy{). Next we prove that l\b and l\c. We establish the first of these, and the second follows by analogy. We give an indirect proof that l\b, that is, we assume l/b and obtain a contradiction. From l/b it follows that there exist integers q and r, by Theorem 1.2, such that b = Iq + r with 0 < r < I. Hence we have r = b - Iq = b - q(bx{) + cy0) = Ml - qx0) + c(-qyf)), and thus r is in the set {bx + cy}. This contradicts the fact that / is the least positive integer in the set {bx + cy}. Now since g is the greatest common divisor of b and c, we may write b = gb, c = gc, and I = bxn + cy{) = g(bx() + Cy0). Thus g\l, and so by part 5 of Theorem 1.1, we conclude that g < /. Now g < I is impossible, since g is the greatest common divisor, so g = / = bx() + cy0. Theorem 1.4 The greatest common divisor g ofb and c can be characterized in the following two ways: (1) It is the least positive value of bx + cy where x and y range over all integers; (2) it is the positive common divisor of b and c that is divisible by every common divisor.
5 c o D i v i s i b i l i t y Proof Part 1 follows from the proof of Theorem 1.3. To prove part 2, we observe that if d is any common divisor of b and c, then d\g by part 3 of Theorem 1.1. Moreover, there cannot be two distinct integers with prop erty 2, because of Theorem 1.1, part 4. If an integer d is expressible in the form d = bx + cy, then d is not necessarily the g.c.d. (b, c). However, it does follow from such an equation that {b, c) is a divisor of d. In particular, if bx + cy = 1 for some integers x and y, then (b,c) = 1. Theorem 1.5 Given any integers />,, b2,- -,bn not all zero, with greatest common divisor g, there exist integers xt,x2,---, xn such that n g = {bx,b2,---,b ) = bjxj. /-i Furthermore, g is the least positive value of the linear form E"=iV, where the y range over all integers; also g is the positive common divisor of b1,b2,- -,b that is divisible by every common divisor. Proof This result is a straightforward generalization of the preceding two theorems, and the proof is analogous without any complications arising in the passage from two integers to n integers. Theorem 1.6 For any positive integer m, (ma, mb) = m(a, b). Proof By Theorem 1.4 we have (ma,mb) = least positive value of max + mby = m {least positive value of ax + by} = m(a, b). Theorem 1.7 If d\a and d\b and d > 0, then I a b \ 1 If (a, b) = g, then a b -, J. g 8
6 1. 2 D i v i s i b i l i t y 9 Proof The second assertion is the special case of the first obtained by using the greatest common divisor g of a and b in the role of d. The first assertion in turn is a direct consequence of Theorem 1.6 obtained by replacing m, a, b in that theorem by d, a/d, b/d respectively. Theorem 1.8 // (a, m) = (b,m) = 1, then (ab, m) = 1. Proof By Theorem 1.3 there exist integers x0, y0, xx, y, such that 1 = ax0 + myq = bx{ + myx. Thus we may write (axqxbxx) = (1 - my0) (1 - myx) = 1 - my2 where y2 is defined by the equation y2 = yn + y) - my0y{. From the equation abx0xt + my2 = 1 we note, by part 3 of Theorem 1.1, that any common divisor of ab and m is a divisor of 1, and hence (ab, m) = 1. Definition 1.3 We say that a and b are relatively prime in case (a, b) = 1, and that ax, a2,-,an are relatively prime in case (a{, a2,-, an) = 1. We say that av a2,-, an are relatively prime in pairs in case (a,, a ) = 1 for all i = \,2,-,n and j = 1,2,, n with i + j. The fact that (a, b) = 1 is sometimes expressed by saying that a and b are coprime, or by saying that a is prime to b. Theorem 1.9 For any integer x, (a, b) = (b, a) = (a, - b) = (a,b + ax). Proof Denote (a, b) by d and (a, b + ax) by g. It is clear that (b, a) = (a,-b) = d. By Theorem 1.3, we know that there exist integers x{) and yn such that d = ax0 + by0. Then we can write d = a(x{] - xy0) + (b + ax)y{]. It follows that the greatest common divisor of a and b + ax is a divisor of d, that is, g\d. Now we can also prove that d\g by the following argument. Since d\a and d\b, we see that d\(b + ax) by Theorem 1.1, part 3. And from Theorem 1.4, part 2, we know that every common divisor of a and b + ax is a divisor of their g.c.d., that is, a divisor of g. Hence, d\g. From d\g and g\d, we conclude that d = ±g by Theorem 1.1, part 4. However, d and g are both positive by definition, so d = g.
LECTURE 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 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 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 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 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 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 informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
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 informationFACTORIZATION AND THE PRIMES
I FACTORIZATION AND THE PRIMES 1. The laws of arithmetic The object of the higher arithmetic is to discover and to establish general propositions concerning the natural numbers 1, 2, 3,... of ordinary
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 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 informationExecutive Assessment. Executive Assessment Math Review. Section 1.0, Arithmetic, includes the following topics:
Executive Assessment Math Review Although the following provides a review of some of the mathematical concepts of arithmetic and algebra, it is not intended to be a textbook. You should use this chapter
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
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 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 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 information1 Solving Algebraic Equations
Arkansas Tech University MATH 1203: Trigonometry Dr. Marcel B. Finan 1 Solving Algebraic Equations This section illustrates the processes of solving linear and quadratic equations. The Geometry of Real
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 information. As the binomial coefficients are integers we have that. 2 n(n 1).
Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor
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 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 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 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 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 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 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 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 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 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 informationMATH10040: Numbers and Functions Homework 1: Solutions
MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3
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 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 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 informationMathematical Reasoning & Proofs
Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0
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 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 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 information1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.
000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =
More informationEDULABZ INTERNATIONAL NUMBER SYSTEM
NUMBER SYSTEM 1. Find the product of the place value of 8 and the face value of 7 in the number 7801. Ans. Place value of 8 in 7801 = 800, Face value of 7 in 7801 = 7 Required product = 800 7 = 00. How
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 information1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.
000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. College Algebra for STEM
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics College Algebra for STEM Marcel B. Finan c All Rights Reserved 2015 Edition To my children Amin & Nadia Preface From
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 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 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 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 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 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 informationP.1 Prerequisite skills Basic Algebra Skills
P.1 Prerequisite skills Basic Algebra Skills Topics: Evaluate an algebraic expression for given values of variables Combine like terms/simplify algebraic expressions Solve equations for a specified variable
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
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 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2
Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2 April 11, 2016 Chapter 10 Section 1: Addition and Subtraction of Polynomials A monomial is
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 informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationDivisibility. Chapter Divisors and Residues
Chapter 1 Divisibility Number theory is concerned with the properties of the integers. By the word integers we mean the counting numbers 1, 2, 3,..., together with their negatives and zero. Accordingly
More informationMAS114: Solutions to Exercises
MAS114: s to Exercises Up to week 8 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to
More 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 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 informationELEMENTS OF NUMBER THEORY
ELEMENTS OF NUMBER THEORY Examination corner 1 one mark question in part A 1 - two mark question in part B 1 five mark OR 3mark+2 mark question in part C 1 two or four mark question in part E concepts
More informationAssociative property
Addition Associative property Closure property Commutative property Composite number Natural numbers (counting numbers) Distributive property for multiplication over addition Divisibility Divisor Factor
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationElementary Number Theory
Elementary Number Theory CIS002-2 Computational Alegrba and Number Theory David Goodwin david.goodwin@perisic.com 09:00, Tuesday 25 th October 2011 Contents 1 Some definitions 2 Divisibility Divisors Euclid
More informationINTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.
INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b
More 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 informationLecture 7.4: Divisibility and factorization
Lecture 7.4: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
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 information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
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 informationAlgebra for error control codes
Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationMODEL ANSWERS TO HWK #10
MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it
More informationMath 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 informationMath Review. for the Quantitative Reasoning measure of the GRE General Test
Math Review for the Quantitative Reasoning measure of the GRE General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important for solving
More informationFunctions and Equations
Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario Euclid eworkshop # Functions and Equations c 006 CANADIAN
More information32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
More informationLP03 Chapter 5. A prime number is a natural number greater that 1 that has only itself and 1 as factors. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
LP03 Chapter 5 Prime Numbers A prime number is a natural number greater that 1 that has only itself and 1 as factors. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, Question 1 Find the prime factorization of 120.
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 information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
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 informationExam 2 Review Chapters 4-5
Math 365 Lecture Notes S. Nite 8/18/2012 Page 1 of 9 Integers and Number Theory Exam 2 Review Chapters 4-5 Divisibility Theorem 4-1 If d a, n I, then d (a n) Theorem 4-2 If d a, and d b, then d (a+b).
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 informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationCISC-102 Fall 2017 Week 6
Week 6 page 1! of! 15 CISC-102 Fall 2017 Week 6 We will see two different, yet similar, proofs that there are infinitely many prime numbers. One proof would surely suffice. However, seeing two different
More information0.Axioms for the Integers 1
0.Axioms for the Integers 1 Number theory is the study of the arithmetical properties of the integers. You have been doing arithmetic with integers since you were a young child, but these mathematical
More informationPOLYNOMIALS. x + 1 x x 4 + x 3. x x 3 x 2. x x 2 + x. x + 1 x 1
POLYNOMIALS A polynomial in x is an expression of the form p(x) = a 0 + a 1 x + a x +. + a n x n Where a 0, a 1, a. a n are real numbers and n is a non-negative integer and a n 0. A polynomial having only
More informationAll work must be shown or no credit will be awarded. Box all answers!! Order of Operations
Steps: All work must be shown or no credit will be awarded. Box all answers!! Order of Operations 1. Do operations that occur within grouping symbols. If there is more than one set of symbols, work from
More informationMath 299 Supplement: Modular Arithmetic Nov 8, 2013
Math 299 Supplement: Modular Arithmetic Nov 8, 2013 Numbers modulo n. We have previously seen examples of clock arithmetic, an algebraic system with only finitely many numbers. In this lecture, we make
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 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 informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationNumber Theory and Graph Theory. Prime numbers and congruences.
1 Number Theory and Graph Theory Chapter 2 Prime numbers and congruences. By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-1:Primes
More information3 Finite continued fractions
MTH628 Number Theory Notes 3 Spring 209 3 Finite continued fractions 3. Introduction Let us return to the calculation of gcd(225, 57) from the preceding chapter. 225 = 57 + 68 57 = 68 2 + 2 68 = 2 3 +
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationA FIRST COURSE IN NUMBER THEORY
A FIRST COURSE IN NUMBER THEORY ALEXANDRU BUIUM Contents 1. Introduction 2 2. The integers 4 3. Induction 6 4. Finite sets, finite sums, finite products 7 5. The rationals 8 6. Divisibility and Euclid
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 information