# 3 Some Integer Functions

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple functions. The first (and most important) of these is the floor function. We denote this function by lxm although it can be denoted by floor(x) It is also widely known as the greatest integer function and is found in some computer languages as the integer function (sometimes denoted INT(x)). The floor of x is the greatest integer lessthan-or-equal-to x. For example, l4m = 4, l2.5m = 2, l-2m = -2, l-2.5m = -3, lbm = 3, l-bm = -4. (Beware of using the truncate function found in computer languages as it will only be correct for positive numbers). Note that the floor function is an integer function in that it always returns an integer, although it is applied to all real numbers. The ceiling function complements the floor function. It is denoted by jxk or ceiling(x). The ceiling of x is the least integer greater-than-or-equal-to x. For example, j4k = 4, j2.5k = 3, j-2k = -2, j-2.5k = -2, jbk = 4, j-bk = Informally, the floor function lxm rounds x down. The ceiling function jxk rounds x up. If x is an integer, lxm = jxk = x. lxm = jxk if and only if x is an integer. jxk - lxm = 0 if x is an integer; otherwise it is 1. 1 A rather exotic example of the ceiling function is as follows: the following function for integers greater than 4 evaluates to 1 if n is a prime otherwise it is 0. f(n) = later section. ( n 1)! ( n )! n 1 n. This is based upon Wilson s Theorem which is given in a 1

2 Basic Applications of the Floor Function If we want to round the number x to the nearest integer, rounding up (as usual) when the number is exactly an integer plus a half then lx +.5m does the trick (proving this is an exercise). Integer division, which is sometime denoted by \ means division without remainder. For example, 8 \ 3 = 2, 6 \ 2 = 3, 7 \ 2 = 3. x \ y is equivalent to x y. To round a number to 100x 100 exactly two digits, for example to round to 3.14, we can use the formula. Suppose we want to divide the interval of real numbers 0 # x # 1 into twenty subinterval of length.05. Given a number, y, such that 0 # y # 1, we might ask which sub-interval does y fall into, and the answer is y For example the number.07 falls in the second sub-interval. 07 because = 2

3 The next two exercises more or less call for proofs. However, this book is not just for math, science, or engineering majors. If you are uncomfortable with proofs, or if you are merely reading this book, try to use examples to convince yourself that the statements of the exercises are true. For these particular exercises, examples will not prove the statements, but they can convince you that the statements are true and that is the most important thing. G Exercise 1 G Exercise 2 Almost every computer language has the floor function or some equivalent. Show that you can define the ceiling function in terms of the floor function by jxk = -l-xm (in other words, show that this identity is true). Show that the function round(x), which rounds x to the nearest integer, can be defined by round(x) = lx+.5m. An Application of the Floor Function to Random Numbers Section 11 covers computer generation of random numbers. Typically random number generators return uniform variates. These are numbers that are intended to be between 0 and 1 and such that all numbers are equally likely to be chosen. 1 Suppose, for some reason we want to take uniform variates from two generators and combine them. For instance, the first generator gives us u and the second generator gives us v. We add them together to get a new variate w = u + v. The range of w is from 0 to 2, so if we divide w by 2, our new variate w'2 lies between 0 and 1. However, w'2 is not uniformly distributed. It is triangular; it is much more likely to be close to.5 than to either.0 or.1. However, if we define w by w = u + v! lu + vm 1 Many computer programs return random numbers in a variety of schemes. However, numbers randomly distributed from 0 to 1 are to be preferred. It is almost always possible in a relatively simple way to transform these numbers into the form you want, whether integers uniformly distributed from 1 to 100 or Normal variates with a given mean and standard deviation. 3

4 it is uniformly distributed between 0 and 1. To understand why it is only necessary to look at the graph of the distribution of u + v. When we take a uniform variate u distributed from 0 to 1, if we create the new variable v = au + b, v is uniformly distributed from b to b + a. In particular v = au is uniformly distributed from 0 to a. Let u be a variate uniformly distributed from 0 to 1. Let n be a positive integer. lnaum + 1 gives the integers 1, 2, 3 through n (uniformly distributed). If a is any integer lnaum + a gives the integers a, a+1, a+2 through a+n!1. 4

5 The Modulo Function Figure 1 The Integers Modulo 3. There are two incarnations of modulo: one is the modulo function used by computer scientists and the other is the modulo relation used by mathematicians. We will explore both versions starting with the modulo relation. 1 Consider the graph in Figure 1. The vertices are numbered 0, 1, and 2. The brackets next to each vertex count the number of arcs to travel from Vertex 0 to the vertex in question. The brackets next to Vertex 0 contains the integer 0 because we choose to agree that one can go from Vertex 0 to Vertex 0 in zero steps. By following the arcs from Vertex 0 to Vertex 1 to Vertex 2 and back to Vertex 0, we have transversed 3 arcs. If we travel the same path in the opposite order, that is against the directions of the arcs, we say we have transversed -3 arcs. Similarly we can travel from Vertex 0 to Vertex 0 in -6 arcs, or 9 arcs, or 102 arcs. Clearly there are an infinite number of possibilities as indicated by the ellipses (...). The brackets next to Vertex 1 indicate that it is possible to go from Vertex 0 to Vertex 1 in 1 step or 4 steps or -2 steps, and so on. Notice that the numbers in the three brackets partition 1 This strategy enables me to maximize the all-important confusion function that is so important to text writers everywhere. 5

6 all of the integers into three classes. Let us denote these classes next to the vertices as follows: [0] will denote the class [..., -6, -3, 0, 3, 6, 9,...] and the other classes are denoted [1] and [2] respectively. There are several observations that can be made about these classes of numbers. Class [0] has the property that it contains the differences of every pair of numbers in the class. For example, since 18 and 54 belong to the class so do = -36 and = 36. We define a module as any class of numbers containing at least two numbers and containing the differences of every pair of numbers in the class. Hence, we say that [0] is a module but [1] and [2] are not. If we take any of the three classes, the difference in any two numbers belongs to [0]. More concisely, the difference between any two numbers in any class is a multiple of three the number of nodes in the graph. Let us pick any two of the three classes or better yet, you the reader, pick any two of the three classes (you can choose the same class twice). Now choose two numbers one from each class. First add the numbers and find out what class the sum is in. Now do the same experiment again and again but with the same two classes. You will find that the sum always falls in the same class it did the first time. Try this for multiplication and you will get the same phenomenon. For example, every time we add a number from [1] to a number from [1] we get a number in [2] regardless of which numbers we choose. Similarly, every time we multiply a number in [2] times a number in [2], we get a number in [1]. Hence, we can save time by operating on just the classes [0], [1], [2]. 6

7 G Exercise 3 Write addition and multiplication tables for the classes [0], [1], [2]. As per the preceding discussion, to build the table you simply pick a sample number from each class. In fact the simplest choices are the numbers 0, 1, 2. Notice that we have in effect discovered an algebra consisting of three numbers, 1 since we have partitioned the integers into three classes. Belonging to the same class is an equivalence relation. In the parlance of mathematics, we indicate that integers A and B belong to the same class by saying A / B (mod 3) or in words: A is congruent to B mod 3. If you like extra syllables then say A is congruent to B modulo 3. In general, we can use any integer greater than one as a modulus. In any case, a graphical interpretation such as in Figure 1 applies. < Integer division will be important for a while, so we will use special notation for it. We say that the integer, x, is divided by the integer y, if there is another integer z, such that x = yaz. We write this as y*x. If the integer x divides both y and z, we write x*y,z. In other words, A / B (mod n) is equivalent to n*a - B. We can also define modulo arithmetic by saying A / B (mod n) whenever, n divides A! B. This is both quick and practical. This relation partitions the integers into n classes. It is customary to write parentheses around the words mod n. However, I often leave off the parentheses on the grounds that they are redundant. There is no significance to this other than I am inconsistent. 1 This was discovered for the first time by C. F. Gauss while he was still a boy in the 1790's. Those of you who are math, science, or engineering majors may want to figure out how many of the properties this system has as compared to the properties of the real numbers you were given in basic algebra. A hint: you should find virtually all of the familiar properties of addition and multiplication. Division is trickier. You have division in this case, modulo 3 arithmetic, but you do not have it in modulo 4 arithmetic as will be explained later. 7

8 Again, when we look at the classes of integers modulo 3, which are the three classes given in Figure 1, we can choose any number from a class to represent the class. The standard representative of a class is the first non-negative integer in that class. Example Consider the integers mod 5. This gives us five classes of integers whose standard representatives are 0, 1, 2, 3, 4. For example, 0 is the standard representative of the class {...!10,!5,0,5,10,15...}. We write: [0] = {...!10,!5,0,5,10,15...} [1] = {...!9,!4,1,6,11,16...} [2] = {...!8,!3,2,7,12,17...} [3] = {...!7,!2,3,8,13,18...} [4] = {...!6,!1,4,9,14,19...}. Given an integer, say 10, what is the standard representative of its class mod 3? Since 10 is in the class [1], the answer is 1, and we write 1 / 10 mod 3. Clearly this definition works for any modulus (by which we mean a positive integer greater than one). From Figure 1 we can see that -5 mod 3 is 1, that is, 1 = -5 mod 3. However, a word of warning! Do not trust a compiler to give you the correct answer when taking the modulus of a negative number. The general implementation of the mod function, which is basically as we will use it, is that mod is a function of two numbers sometimes written mod(x, y) and in most implementations written x mod y, and y is a positive integer and x is a non-negative integer with the function x mod y defined to be the remainder of x divided by y. For example: 7 mod 2 = 1, 25 mod 7 = 4, 5 mod 6 = 5, 0 mod 8 = 0. Ordinary twelve-hour clock time is done in modulo arithmetic. If a job starts at 10 o'clock and lasts 4 hours then it is finished at 2 o'clock. The only difference between clock time and arithmetic mod 12 is that in mod 12 we say usually 0 instead of 12. 8

9 G Exercise 4 A very nice application of the mod function is to formatting computer output. Try writing a program that will print the first n positive integers in m columns where you give n and m as inputs. Another application of the mod function is to monitoring a program. If you have a large number of iterations of i and you print each i, you lose an enormous amount of time writing to the screen and the i's change too fast to read. Instead use a statement like: If i MOD 100 = 0 Then Print i. In that case, only multiples of 100 are printed. k mod n = h means that h is the remainder of k divided by n. k mod n / h means that n*h! k (that is: n divides the difference of h and k). G Exercise 5 G Exercise 6 The difference between the mod function and the mod relation is subtle. Show that if A mod n = B that A / B (mod n), but that the implication does not work in the other direction. Suppose that you have a compiler which does the mod function for positive integers. Write an extension of that function so that it works for negative integers. In other words, suppose that your computer will return x mod y when x is non-negative and y is positive. Write a function definition, say FNMOD(x, y) so that FNMOD works whether x is negative as well as non-negative (y is always positive). Example We are writing a program to simulate dealing from a deck of cards. We want to deal one card from the deck with each card having equal probability of being chosen. First, we use the built-in random number generator to give us a real 9

10 number, rand, with 0 < rand < 1. We then compute the floor of randa52: lranda52m. This gives the integers 0, 1, 2, through 51, each with equal probability of occurrence. Let n = lranda52m. To find the value of the card we use lranda52m mod For example, 9 mod = 10; 51 mod = 13 is a King; 26 mod = 1 is an Ace. If we take lranda52m mod 4, that tells us the suit. 9 mod 4 = 1 is a diamond; 51 mod 4 = 3 is a spade; 2 mod 4 = 2 is a heart; 8 mod 4 = 0 is a club. The following definition is always correct. It works even for negative u (v must be positive) and it is frequently useful. Another Definition for the Mod Function Modulo Arithmetic One of the cute aspects of modulo numbers is that they almost obey the usual rules we know for algebra and arithmetic. < Let us review for a moment: Going back to our first example, we built the integers mod 3 as three classes of numbers [0], [1], [2]. We realized the classes gave us an arithmetic because we can use any representative of a class to represent the class in arithmetic and we always get the same result. In general, we choose the standard representatives to be the least non-negative element of its class. In the case of arithmetic mod n, these numbers are 0, 1, 2, 3,..., n! 1. They give us an arithmetical system and mathematicians often denote this system of integers mod n by Z n. Within Z n we no longer write A / B (mod n), but we write A = B. If, for example, in Z 8 you have a number, X, outside the domain 0,1,...,7 you should view it as equivalent to X mod 8. For example, in mod 8 we write 23 = 7, 16 = 0, -3 = 5. 10

11 Within the integers mod n or within Z n (we can use these interchangeably) addition subtraction and multiplication work like usual. In particular: If X / Y (mod n) then for any integer Z Í X + Z / Y + Z (mod n) Í X - Z / Y! Z (mod n) Í Z / Z (mod n) All the above rules are as in basic algebra. However, it is not an accident that nothing is said about division. Division is covered in Chapter 11. Example We want to solve x + 8 = 5 (mod 10). By adding 2 to both sides we get x + 10 = x = 7 (mod 10). Remember, in (Mod 10) or Z 10, 10 = 0. G Exercise 7 Solve the following problems in Z 7 for X: X + 3 = 6 X + 5 = 3 X! 4 = 5 X + 1 = 6. The Two Queens Problem (Which Uses both Floor and Modulo Functions) The queen in chess moves (and captures) along rows, columns and diagonals. Suppose we number the squares of the board, starting from the left of the top row and moving from left to right until ending at the lower right square, and we number the squares from 0 to 63. Then we pick two different numbers in the range from 0 to 63 (inclusive). Let the positions of the queens be given by the two different integers. x and y. How, numerically can we decide whether either, moving as a queen can take the other? It is not hard to show that t he following rules will 11

12 x 8 y 8 work: The row numbers of the two positions are respectively and (giving numbers 0 through 7). The columns are given by x mod 8 and y mod 8, which numbers the columns from 0 to 7. The queens are on the same row or same column if they have the same row or column numbers respectively. They are on the same diagonal if the absolute difference of the row numbers equals the absolute difference of the column numbers. For example, suppose our position numbers are x = 20 and y = 41. Then the row numbers are respectively 2 (the third row) and 5 (the sixth row). The column numbers are 4 and 9. The queens are on the same diagonal if 2!5 = 4!9, that is if 3 = 5. Since this is false, they are on different diagonals. 12

13 1. First, if you haven't done so already, read the box immediately preceding this problem. Secondly, the statement is clearly true if x is an integer. If x is an integer then jxk = lxm. Hence, if x is an integer,!l!xm =!(!x) = x = jxk. (I did the case where x is an integer first because the following proof only works when x is not an integer; note that this identity is only interesting if x is not an integer.) Assume now that x is not an integer. We can define the fractional part of x, by frac(x) = x! lxm. The key observation to this proof is that frac(!x) = 1! frac(x). Note also that lxm = x! frac(x). We have that!l!xm =!(!(x)! frac(!x)) = (x + frac(!x)) = x + 1! frac(x) = lxm + 1 = jxk. It is this last equality that is true if and only if x is not an integer. 2. Notice that if x is closer to lxm than jxk, then round(x) = lxm otherwise round(x) = jxk. If it is equally close to both of them the usual convention is that round(x) = jxk. It can easily be seen that the statement is true if x is an integer. Assume x is not an integer. Then round(x) = lxm if and only if frac(x) +.5 (frac(x) is defined in the solution to the previous problem). However, frac(x) +.5 if and only if frac(x +.5) + 1 in which case lx+.5m = lxm. Otherwise, frac(x +.5) \$ 1 and lx+.5m = jxk Input n, m j 7 0 {7 is the assignment operator: See box in 3 section 4.} For i 7 1 to n print i move to the next column to the right j 7 j + 1 (mod m) if j = 0 go to first column of next line 13

14 5. If A mod n = B then B is the remainder from division of A by n. That is there must exist some integer k such that nak + B = A (with 0 # B + n). Hence, A! B = nak or equivalently A / B (mod n). Going the other way however, we have 20 / 30 (mod 5) but it is not true that 20 mod 5 = 30 (since 20 mod 5 = 0, and 0 is the unique answer). 6. Define FNMOD(x, y) If y # 0 then return "error" If x \$ 0 then return x mod y If x + 0 then z 7 (!x) mod y, return y! z. 7. Arithmetic Z 7 is equivalent to arithmetic mod 7. x + 3 = 6. Add 4 to both sides and you get x + 7 = 10. But in mod 7, 7 is 0 and 10 is 3. Thus we have x = 3. x + 5 = 3. Add 2 to both sides to get x = 5. x! 4 = 5. Add 4 to both sides to get x = 2. x + 1 = 6 implies x + 7 = 12 which implies x = 5. 14

### Mathematics of Cryptography

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter

### Elementary 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,

### MODULAR 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

### A fairly quick tempo of solutions discussions can be kept during the arithmetic problems.

Distributivity and related number tricks Notes: No calculators are to be used Each group of exercises is preceded by a short discussion of the concepts involved and one or two examples to be worked out

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem Copyright Cengage Learning. All rights reserved.

### 8 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.

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem

### Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system

CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical

### 6.4 Normal Distribution

Contents 6.4 Normal Distribution....................... 381 6.4.1 Characteristics of the Normal Distribution....... 381 6.4.2 The Standardized Normal Distribution......... 385 6.4.3 Meaning of Areas under

### In a triangle with a right angle, there are 2 legs and the hypotenuse of a triangle.

PROBLEM STATEMENT In a triangle with a right angle, there are legs and the hypotenuse of a triangle. The hypotenuse of a triangle is the side of a right triangle that is opposite the 90 angle. The legs

### CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

### a 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

### TYPES OF NUMBERS. Example 2. Example 1. Problems. Answers

TYPES OF NUMBERS When two or more integers are multiplied together, each number is a factor of the product. Nonnegative integers that have exactly two factors, namely, one and itself, are called prime

3. QUADRATIC CONGRUENCES 3.1. Quadratics Over a Finite Field We re all familiar with the quadratic equation in the context of real or complex numbers. The formula for the solutions to ax + bx + c = 0 (where

### Math 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

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic

### Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR

Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGraw-Hill The McGraw-Hill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,

### Chapter 3: Elementary Number Theory and Methods of Proof. January 31, 2010

Chapter 3: Elementary Number Theory and Methods of Proof January 31, 2010 3.4 - Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem Quotient-Remainder Theorem Given

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### MATH Fundamental Mathematics II.

MATH 10032 Fundamental Mathematics II http://www.math.kent.edu/ebooks/10032/fun-math-2.pdf Department of Mathematical Sciences Kent State University December 29, 2008 2 Contents 1 Fundamental Mathematics

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### MULTIPLICATION AND DIVISION OF REAL NUMBERS In this section we will complete the study of the four basic operations with real numbers.

1.4 Multiplication and (1-25) 25 In this section Multiplication of Real Numbers Division by Zero helpful hint The product of two numbers with like signs is positive, but the product of three numbers with

### CHAPTER 17. Linear Programming: Simplex Method

CHAPTER 17 Linear Programming: Simplex Method CONTENTS 17.1 AN ALGEBRAIC OVERVIEW OF THE SIMPLEX METHOD Algebraic Properties of the Simplex Method Determining a Basic Solution Basic Feasible Solution 17.2

### So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

### Congruences. Robert Friedman

Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition

### TI-83 Plus Graphing Calculator Keystroke Guide

TI-83 Plus Graphing Calculator Keystroke Guide In your textbook you will notice that on some pages a key-shaped icon appears next to a brief description of a feature on your graphing calculator. In this

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### CHAPTER 2. Inequalities

CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### 16. Let S denote the set of positive integers 18. Thus S = {1, 2,..., 18}. How many subsets of S have sum greater than 85? (You may use symbols such

æ. Simplify 2 + 3 + 4. 2. A quart of liquid contains 0% alcohol, and another 3-quart bottle full of liquid contains 30% alcohol. They are mixed together. What is the percentage of alcohol in the mixture?

### Fourier Series. Chapter Some Properties of Functions Goal Preliminary Remarks

Chapter 3 Fourier Series 3.1 Some Properties of Functions 3.1.1 Goal We review some results about functions which play an important role in the development of the theory of Fourier series. These results

### The Four Numbers Game

University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-2007 The Four Numbers Game Tina Thompson University

### Elementary 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

### It is time to prove some theorems. There are various strategies for doing

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

### 5.1 Radical Notation and Rational Exponents

Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots

### 4. MATRICES Matrices

4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:

### CHAPTER 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

### Linear Systems. Singular and Nonsingular Matrices. Find x 1, x 2, x 3 such that the following three equations hold:

Linear Systems Example: Find x, x, x such that the following three equations hold: x + x + x = 4x + x + x = x + x + x = 6 We can write this using matrix-vector notation as 4 {{ A x x x {{ x = 6 {{ b General

### Algebra 1A and 1B Summer Packet

Algebra 1A and 1B Summer Packet Name: Calculators are not allowed on the summer math packet. This packet is due the first week of school and will be counted as a grade. You will also be tested over the

### Euclidean Geometry. We start with the idea of an axiomatic system. An axiomatic system has four parts:

Euclidean Geometry Students are often so challenged by the details of Euclidean geometry that they miss the rich structure of the subject. We give an overview of a piece of this structure below. We start

### If a question asks you to find all or list all and you think there are none, write None.

If a question asks you to find all or list all and you think there are none, write None 1 Simplify 1/( 1 3 1 4 ) 2 The price of an item increases by 10% and then by another 10% What is the overall price

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

### Course notes on Number Theory

Course notes on Number Theory In Number Theory, we make the decision to work entirely with whole numbers. There are many reasons for this besides just mathematical interest, not the least of which is that

### 6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

### Ready, Set, Go! Math Games for Serious Minds

Math Games with Cards and Dice presented at NAGC November, 2013 Ready, Set, Go! Math Games for Serious Minds Rande McCreight Lincoln Public Schools Lincoln, Nebraska Math Games with Cards Close to 20 -

### Chapter 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,

### OPERATIONS AND PROPERTIES

CHAPTER OPERATIONS AND PROPERTIES Jesse is fascinated by number relationships and often tries to find special mathematical properties of the five-digit number displayed on the odometer of his car. Today

### Spring 2007 Math 510 Hints for practice problems

Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an -chessboard There are doors between all adjacent cells A prisoner in one

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### Mathematical Induction. Mary Barnes Sue Gordon

Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

### Zeros of a Polynomial Function

Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

### Squares and Square Roots

SQUARES AND SQUARE ROOTS 89 Squares and Square Roots CHAPTER 6 6.1 Introduction You know that the area of a square = side side (where side means the length of a side ). Study the following table. Side

### Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

### Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

### The 2016 British Informatics Olympiad

Time allowed: hours The 2016 British Informatics Olympiad Instructions You should write a program for part (a) of each question, and produce written answers to the remaining parts. Programs may be used

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### Mathematical Induction

Chapter 2 Mathematical Induction 2.1 First Examples Suppose we want to find a simple formula for the sum of the first n odd numbers: 1 + 3 + 5 +... + (2n 1) = n (2k 1). How might we proceed? The most natural

### MATH REVIEW KIT. Reproduced with permission of the Certified General Accountant Association of Canada.

MATH REVIEW KIT Reproduced with permission of the Certified General Accountant Association of Canada. Copyright 00 by the Certified General Accountant Association of Canada and the UBC Real Estate Division.

### For the purposes of this course, the natural numbers are the positive integers. We denote by N, the set of natural numbers.

Lecture 1: Induction and the Natural numbers Math 1a is a somewhat unusual course. It is a proof-based treatment of Calculus, for all of you who have already demonstrated a strong grounding in Calculus

### This section demonstrates some different techniques of proving some general statements.

Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

### TI-86 Graphing Calculator Keystroke Guide

TI-86 Graphing Calculator Keystroke Guide In your textbook you will notice that on some pages a key-shaped icon appears next to a brief description of a feature on your graphing calculator. In this guide

### Working with whole numbers

1 CHAPTER 1 Working with whole numbers In this chapter you will revise earlier work on: addition and subtraction without a calculator multiplication and division without a calculator using positive and

### Chapter 3. Algebra. 3.1 Rational expressions BAa1: Reduce to lowest terms

Contents 3 Algebra 3 3.1 Rational expressions................................ 3 3.1.1 BAa1: Reduce to lowest terms...................... 3 3.1. BAa: Add, subtract, multiply, and divide............... 5

### Mathematics for Economics (Part I) Note 5: Convex Sets and Concave Functions

Natalia Lazzati Mathematics for Economics (Part I) Note 5: Convex Sets and Concave Functions Note 5 is based on Madden (1986, Ch. 1, 2, 4 and 7) and Simon and Blume (1994, Ch. 13 and 21). Concave functions

### 1.6 The Order of Operations

1.6 The Order of Operations Contents: Operations Grouping Symbols The Order of Operations Exponents and Negative Numbers Negative Square Roots Square Root of a Negative Number Order of Operations and Negative

### 1.5. section. Arithmetic Expressions

1-5 Exponential Expression and the Order of Operations (1-9) 9 83. 1 5 1 6 1 84. 3 30 5 1 4 1 7 0 85. 3 4 1 15 1 0 86. 1 1 4 4 Use a calculator to perform the indicated operation. Round answers to three

### 9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

### Domain Essential Question Common Core Standards Resources

Middle School Math 2016-2017 Domain Essential Question Common Core Standards First Ratios and Proportional Relationships How can you use mathematics to describe change and model real world solutions? How

### (Refer Slide Time: 1:41)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 10 Sets Today we shall learn about sets. You must

### EULER S THEOREM. 1. Introduction Fermat s little theorem is an important property of integers to a prime modulus. a p 1 1 mod p.

EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If

### Math 016. Materials With Exercises

Math 06 Materials With Exercises June 00, nd version TABLE OF CONTENTS Lesson Natural numbers; Operations on natural numbers: Multiplication by powers of 0; Opposite operations; Commutative Property of

### Discrete Mathematics: Solutions to Homework (12%) For each of the following sets, determine whether {2} is an element of that set.

Discrete Mathematics: Solutions to Homework 2 1. (12%) For each of the following sets, determine whether {2} is an element of that set. (a) {x R x is an integer greater than 1} (b) {x R x is the square

### Stupid Divisibility Tricks

Stupid Divisibility Tricks 101 Ways to Stupefy Your Friends Appeared in Math Horizons November, 2006 Marc Renault Shippensburg University Mathematics Department 1871 Old Main Road Shippensburg, PA 17013

### COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about

### CHAPTER THREE. 3.1 Binary Addition. Binary Math and Signed Representations

CHAPTER THREE Binary Math and Signed Representations Representing numbers with bits is one thing. Doing something with them is an entirely different matter. This chapter discusses some of the basic mathematical

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### MATH 65 NOTEBOOK CERTIFICATIONS

MATH 65 NOTEBOOK CERTIFICATIONS Review Material from Math 60 2.5 4.3 4.4a Chapter #8: Systems of Linear Equations 8.1 8.2 8.3 Chapter #5: Exponents and Polynomials 5.1 5.2a 5.2b 5.3 5.4 5.5 5.6a 5.7a 1

### Summation Algebra. x i

2 Summation Algebra In the next 3 chapters, we deal with the very basic results in summation algebra, descriptive statistics, and matrix algebra that are prerequisites for the study of SEM theory. You

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

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

### Practice 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.-

### Fundamentals of Probability

Fundamentals of Probability Introduction Probability is the likelihood that an event will occur under a set of given conditions. The probability of an event occurring has a value between 0 and 1. An impossible

### Introduction Number Systems and Conversion

UNIT 1 Introduction Number Systems and Conversion Objectives 1. Introduction The first part of this unit introduces the material to be studied later. In addition to getting an overview of the material

### In mathematics there are endless ways that two entities can be related

CHAPTER 11 Relations In mathematics there are endless ways that two entities can be related to each other. Consider the following mathematical statements. 5 < 10 5 5 6 = 30 5 5 80 7 > 4 x y 8 3 a b ( mod

### Definition: Group A group is a set G together with a binary operation on G, satisfying the following axioms: a (b c) = (a b) c.

Algebraic Structures Abstract algebra is the study of algebraic structures. Such a structure consists of a set together with one or more binary operations, which are required to satisfy certain axioms.

### Chapter 3 RANDOM VARIATE GENERATION

Chapter 3 RANDOM VARIATE GENERATION In order to do a Monte Carlo simulation either by hand or by computer, techniques must be developed for generating values of random variables having known distributions.

### Solving a System of Equations

11 Solving a System of Equations 11-1 Introduction The previous chapter has shown how to solve an algebraic equation with one variable. However, sometimes there is more than one unknown that must be determined

### Contents. Introduction and Notes pages 2-3 (These are important and it s only 2 pages ~ please take the time to read them!)

Page Contents Introduction and Notes pages 2-3 (These are important and it s only 2 pages ~ please take the time to read them!) Systematic Search for a Change of Sign (Decimal Search) Method Explanation

### SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Numbers

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics Numbers. Factors 2. Multiples 3. Prime and Composite Numbers 4. Modular Arithmetic 5. Boolean Algebra 6. Modulo 2 Matrix Arithmetic 7. Number Systems

### Lecture 1: Elementary Number Theory

Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers

### = 1, or how to convince your parents that your math prof is crazy. We want to introduce a new number system where the only numbers are

MATH 13150: Freshman Seminar Unit 11 1. Modular arithmetic In this chapter, we discuss a new number system, where the only numbers are 0,1,2,3 and 4. The idea is to add and multiply them the way we would

### MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

### (Refer Slide Time: 00:00:56 min)

Numerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology, Delhi Lecture No # 3 Solution of Nonlinear Algebraic Equations (Continued) (Refer Slide