# Mathematical Induction

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Mathematical Induction William Cherry February 2011 These notes provide some additional examples to supplement the section of the text on mathematical induction. Inequalities. It happens that often in mathematics, the more freedom one has in creating a solution, the more difficult it is to solve a problem. Often the easiest problems to solve are those where there is really only one way to get to the solution. In particular, this means that it is often more difficult to prove an inequality than an equality. Because your textbook does not work through examples of how to use induction to prove inequalities and yet these can be some of the more difficult exercises, these notes are intended to provide some examples of using induction to prove inequalities. Proposition 1. For every n N, we have n 2 + 6n + 7 < 20n 2. Let P (n) be the proposition n 2 + 6n + 7 < 20n 2. Base Step. We check P (1), which says (1) + 7 < 20(1) 2. The left-hand-side is 14 and the right hand side is 20, so P (1) is true and the base step is complete. Assume: n 2 + 6n + 7 < 20n 2. Show: (n + 1) 2 + 6(n + 1) + 7 < 20(n + 1) 2. We will begin with the left-hand-side of the inequality we want to show because this is the more complicated looking side: (n + 1) 2 + 6(n + 1) + 7 = n 2 + 2n n [multiply out] = (n 2 + 6n + 7) + (2n + 7) [group terms to make use of our assumption] < 20n 2 + (2n + 7) [using our induction assumption] = 20n 2 + 2n + 7 < 20n n + 7 [since 2n < 40n] < 20n n + 20 [since 7 < 20] = 20(n 2 + 2n + 1) [factor out 20] = 20(n + 1) 2. [factor] Thus, (n + 1) 2 + 6(n + 1) + 7 < 20(n + 1) 2, which is what we needed to show. Remark. When we do a proof like this, it is important that all of our inequalities go the same way. In this case, they were all <. We may not mix < and >. 1

2 Mathematical Induction 2 Proposition 2. For every natural number n 12, we have 5 n < n!. Base Step. In this case, we only claim the inequality is true for n 12, so that makes our base step n = 12. Thus, we need to check whether 5 12 < 12!. Using a calculator or computer (or a lot of patience), we determine that and thus we see that the base step is true. Assume: 5 n < n!. Show: 5 n+1 < (n + 1)! = 244, 140, 625 and 12! = 479, 001, 600, We ll start with the left-hand-side of what we are trying to show: Hence, 5 n+1 < (n + 1)! as required. 5 n+1 = 5 5 n [re-write so we can use our assumption] < 5 n! [since 5 n < n! by our induction assumption] < (n + 1) n! [since n + 1 > 5 (remember n 12)] = (n + 1)!. [simplifying] Remark. This last example also shows the necessity of the base step. Notice that the only thing we needed in the induction step was that n + 1 > 5, so the induction step works as long as n > 5. However, 5 6 = 3125 and 6! = 720, so the proposition is not true for n = 6. We really need the base step too for our proof to be valid. Sometimes we might have to prove several inequalities in order to get to the one we want. For example, suppose we want to prove n 3 < 2 n. If we take a look at the induction step, it would go something like this: Assume: n 3 < 2 n. Show: (n + 1) 3 < 2 n+1. If we now start working with what we want to show, we get something like (n + 1) 3 = n 3 + 3n 2 + 3n + 1 [multiply out] < 2 n + 3n 2 + 3n + 1. But, now we are kind of stuck. If, however, we somehow knew that 3n 2 + 3n + 1 < 2 n, we could continue: 2 n + 3n 2 + 3n + 1 < 2 n + 2 n = 2 2 n = 2 n+1. Well, we should then try to prove 3n 2 + 3n + 1 < 2 n, which we can also do by induction, after taking another detour.

3 Mathematical Induction 3 Proposition 3. For each naturual number n 6, we have 6n + 6 < 2 n. Base Step. When n = 6, we have Assume: 6n + 6 < 2 n. Show: 6(n + 1) + 6 < 2 n+1. Now, as was to be shown. 6(n + 1) + 6 = 6n (6) + 6 = 42 < 64 = 2 6. < 2 n + 6 [using our induction assumption] < 2 n + 2 n [since 6 < 2 n when n 3] = 2 2 n = 2 n+1, Proposition 4. For each natural number n 8, we have 3n 2 + 3n + 1 < 2 n. Base Step. When n = 8, we have and so the base step is true. 3(8) 2 + 3(8) + 1 = 217 < 256 = 2 8, Assume: 3n 2 + 3n + 1 < 2 n. Show: 3(n + 1) 2 + 3(n + 1) + 1 < 2 n+1. Starting with the left-hand-side of what we need to show, we have 3(n + 1) 2 + 3(n + 1) + 1 = 3(n 2 + 2n + 1) + 3n as required. = 3n 2 + 6n n = (3n 2 + 3n + 1) + (6n + 6) [Re-group to apply induction assumption] < 2 n + (6n + 6) [By our induction assumption] < 2 n + 2 n [By Proposition 3] = 2 2 n = 2 n+1, We are now finally able to get to the inequality we wanted. Proposition 5. For each natural number n 10, we have n 3 < 2 n. Base Step. When n = 10, we have 10 3 = 1000 < 1024 = 2 10,

4 Mathematical Induction 4 and so the base step holds. Assume: n 3 < 2 n. Show: (n + 1) 3 < 2 n+1. Starting with the left-hand-side, and so we are done. (n + 1) 3 = n 3 + 3n 2 + 3n + 1 [multiply out] < 2 n + 3n 2 + 3n + 1 [using our induction assumption] < 2 n + 2 n [by Proposition 4] = 2 2 n = 2 n+1, Generalized Strong Induction. The method of proof by induction can be generalized as follows. Suppose we have a proposition P (n) and suppose we want to prove that P (n) is true for all integers n such that n m for some integer m. Suppose we also prove the following: Generalized base step: There exists an l Z such that P (j) is true for j = m, m + 1,..., l. Strong induction step: For each k Z such that k l, we have (P (m) P (m + 1) P (m + 2) P (k)) P (k + 1). In analogy with my stairstep explanation in class, this goes as follows. For the generalized base step, suppose we can show that we can get to any of the first five stairs on the infinite stair case. Now suppose that we can show that if we can get all the stairs before the k + 1-st step, then we can also get to k + 1-st step. Then we can climb all the stairs. Imagine, for example, that in order to go up a stair, we need to both stand on the stair before, and use the assistance of a pole resting on the stair before that. In practice, strong induction often works as follows. We do a double base step, for example, we show P (1) and P (2) are true. Then, for the induction step, we show that P (n 1) and P (n) together imply P (n + 1). That is, we use the assistance of two previous stairs to help us climb to the next step. Here is an example. Proposition 6. For each natural number n, there exist natural numbers a and b such that 5 n = a 2 + b 2. Proof by strong induction. Base step. We will do a double base step, allowing us to go two steps back in our induction step. For n = 1, we can choose a = 1 and b = 2 and we have 5 1 = 5 = = For n = 2, we can choose a = 3 and b = 4, since 5 2 =

5 Mathematical Induction 5 For this proof, instead of showing that P (n) implies P (n + 1), we will show that P (n 1) implies P (n + 1). Because we are skipping over a step each time, we need the double base step above. Assume: There exist a and b in N such that 5 n 1 = a 2 + b 2. Show: There exist c and d in N such that 5 n+1 = c 2 + d 2. We start with the left-hand-side, and write 5 n+1 = n 1. Then, we use our induction assumption that 5 n 1 = a 2 + b 2. So, we then have 5 n+1 = n 1 = 5 2 (a 2 + b 2 ) = 5 2 a b 2 = (5a) 2 + (5b) 2. Thus, we can choose c = 5a and d = 5b to get and our proof is complete. 5 n+1 = c 2 + d 2, Fibonacci numbers. The Fibonacci numbers are defined recursively as follows: F 0 = 0, F 1 = 1, and F n = F n 1 + F n 2 for n 2. So, for instance, the Fibonacci numbers start out 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233,... where the first two are 0 and 1 and each successive number is obtained by adding the previous two. Problems involving Fibonacci numbers are natural candidates for going backward two steps. Proposition 7. For each n = 0, 1, 2, 3,..., we have F n < 2 n. Proof by strong induction. Base Step. We will verify the inequality for n = 0 and n = 1 for our base step. For n = 0, we have F 0 = 0 < 1 = 2 0. For n = 1, we have F 1 = 1 < 2 = 2 1, and so we have verified the inquality for n = 0 and n = 1. Induction step. Because we have completed a double base step, we are allowed to use two induction assumptions. Assumption 1. F n 1 < 2 n 1. Assumption 2. F n < 2 n. Show. F n+1 < 2 n+1. Starting with the definition of the Fibonacci numbers, we have F n+1 = F n + F n 1 [definition of F n ] < 2 n + 2 n 1 [Using our two induction assumptions] < 2 n + 2 n [since 2 n 1 < 2 n.] = 2 2 n = 2 n+1. Hence, F n+1 < 2 n+1 as was to be shown.

6 Mathematical Induction 6 The method of strong induction can sometimes be used to shorten an induction proof of an inequalty. Earlier in these notes we proved that n 3 < 2 n for all natural numbes n 10, but our proof was rather tedius. Using strong induction, we can shorten our proof. Proposition 8. For each natural number n 10, we have n 3 < 2 n. Proof by strong induction. Base Step. First, we will do an extended base step: Induction step. Assume: n 10 and n 3 < 2 n. Show: (n + 2) 3 < 2 n+2. n n 3 2 n (n + 2) 3 = n 3 + 6n n + 8 [multiply out] < n 3 + n n + 8 [since 6 < n] < n 3 + n 3 + n [since 12 < n 2 ] < n 3 + n 3 + n 3 + n 3 [since 8 < n 3 ] = 4n 3 < 4 2 n [by our induction assumption] = 2 n+2.

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

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

### WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

### SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

### Section IV.1: Recursive Algorithms and Recursion Trees

Section IV.1: Recursive Algorithms and Recursion Trees Definition IV.1.1: A recursive algorithm is an algorithm that solves a problem by (1) reducing it to an instance of the same problem with smaller

### Section 3 Sequences and Limits, Continued.

Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

### MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,

### sin(x) < x sin(x) x < tan(x) sin(x) x cos(x) 1 < sin(x) sin(x) 1 < 1 cos(x) 1 cos(x) = 1 cos2 (x) 1 + cos(x) = sin2 (x) 1 < x 2

. Problem Show that using an ɛ δ proof. sin() lim = 0 Solution: One can see that the following inequalities are true for values close to zero, both positive and negative. This in turn implies that On the

### 3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.

SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid

### Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

### Square roots, Inequality Symbols, and More with Fractions

Square roots, Inequality Symbols, and More with Fractions This section discusses some terminology and more how on how to simplify fractions without a calculator. Square roots: The square root symbol is.

### Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

### An Interesting Way to Combine Numbers

An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis November 28, 2007 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly

### MITES Physics III Summer Introduction 1. 3 Π = Product 2. 4 Proofs by Induction 3. 5 Problems 5

MITES Physics III Summer 010 Sums Products and Proofs Contents 1 Introduction 1 Sum 1 3 Π Product 4 Proofs by Induction 3 5 Problems 5 1 Introduction These notes will introduce two topics: A notation which

### Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

### Basic Proof Techniques

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### PRINCIPLES OF PROBLEM SOLVING

PRINCIPLES OF PROBLEM SOLVING There are no hard and fast rules that will ensure success in solving problems. However, it is possible to outline some general steps in the problem-solving process and to

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

### Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the

### CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

### Full and Complete Binary Trees

Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

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

### Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

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

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

### CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010

CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010 1. Greatest common divisor Suppose a, b are two integers. If another integer d satisfies d a, d b, we call d a common divisor of a, b. Notice that as

### Section 4.1 Rules of Exponents

Section 4.1 Rules of Exponents THE MEANING OF THE EXPONENT The exponent is an abbreviation for repeated multiplication. The repeated number is called a factor. x n means n factors of x. The exponent tells

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### An Innocent Investigation

An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number

### The Epsilon-Delta Limit Definition:

The Epsilon-Delta Limit Definition: A Few Examples Nick Rauh 1. Prove that lim x a x 2 = a 2. (Since we leave a arbitrary, this is the same as showing x 2 is continuous.) Proof: Let > 0. We wish to find

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### Determine If An Equation Represents a Function

Question : What is a linear function? The term linear function consists of two parts: linear and function. To understand what these terms mean together, we must first understand what a function is. The

### 88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small

### Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

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

### The Factor Theorem and a corollary of the Fundamental Theorem of Algebra

Math 421 Fall 2010 The Factor Theorem and a corollary of the Fundamental Theorem of Algebra 27 August 2010 Copyright 2006 2010 by Murray Eisenberg. All rights reserved. Prerequisites Mathematica Aside

### Series Convergence Tests Math 122 Calculus III D Joyce, Fall 2012

Some series converge, some diverge. Series Convergence Tests Math 22 Calculus III D Joyce, Fall 202 Geometric series. We ve already looked at these. We know when a geometric series converges and what it

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### Worksheet on induction Calculus I Fall 2006 First, let us explain the use of for summation. The notation

Worksheet on induction MA113 Calculus I Fall 2006 First, let us explain the use of for summation. The notation f(k) means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

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

### The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

### Practice with Proofs

Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

### def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

### Proof of Infinite Number of Fibonacci Primes. Stephen Marshall. 22 May Abstract

Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach

### Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain

### Sequences. A sequence is a list of numbers, or a pattern, which obeys a rule.

Sequences A sequence is a list of numbers, or a pattern, which obeys a rule. Each number in a sequence is called a term. ie the fourth term of the sequence 2, 4, 6, 8, 10, 12... is 8, because it is the

### Notes: Chapter 2 Section 2.2: Proof by Induction

Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case - S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example

### Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

### Linear Programming Notes V Problem Transformations

Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material

### 1.7 Graphs of Functions

64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most

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

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

### Vectors, Gradient, Divergence and Curl.

Vectors, Gradient, Divergence and Curl. 1 Introduction A vector is determined by its length and direction. They are usually denoted with letters with arrows on the top a or in bold letter a. We will use

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

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

### 1.3 Order of Operations

1.3 Order of Operations As it turns out, there are more than just 4 basic operations. There are five. The fifth basic operation is that of repeated multiplication. We call these exponents. There is a bit

### Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving

Section 7 Algebraic Manipulations and Solving Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving Before launching into the mathematics, let s take a moment to talk about the words

### Partial Fractions. p(x) q(x)

Partial Fractions Introduction to Partial Fractions Given a rational function of the form p(x) q(x) where the degree of p(x) is less than the degree of q(x), the method of partial fractions seeks to break

### Permutation Groups. Rubik s Cube

Permutation Groups and Rubik s Cube Tom Davis tomrdavis@earthlink.net May 6, 2000 Abstract In this paper we ll discuss permutations (rearrangements of objects), how to combine them, and how to construct

### 1.2. Successive Differences

1. An Application of Inductive Reasoning: Number Patterns In the previous section we introduced inductive reasoning, and we showed how it can be applied in predicting what comes next in a list of numbers

### Linear Programming Notes VII Sensitivity Analysis

Linear Programming Notes VII Sensitivity Analysis 1 Introduction When you use a mathematical model to describe reality you must make approximations. The world is more complicated than the kinds of optimization

### The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge,

The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge, cheapest first, we had to determine whether its two endpoints

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in

### Style Guide For Writing Mathematical Proofs

Style Guide For Writing Mathematical Proofs Adapted by Lindsey Shorser from materials by Adrian Butscher and Charles Shepherd A solution to a math problem is an argument. Therefore, it should be phrased

### Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

### 3.4 Complex Zeros and the Fundamental Theorem of Algebra

86 Polynomial Functions.4 Complex Zeros and the Fundamental Theorem of Algebra In Section., we were focused on finding the real zeros of a polynomial function. In this section, we expand our horizons and

### Polynomials. Dr. philippe B. laval Kennesaw State University. April 3, 2005

Polynomials Dr. philippe B. laval Kennesaw State University April 3, 2005 Abstract Handout on polynomials. The following topics are covered: Polynomial Functions End behavior Extrema Polynomial Division

### The Euclidean Algorithm

The Euclidean Algorithm A METHOD FOR FINDING THE GREATEST COMMON DIVISOR FOR TWO LARGE NUMBERS To be successful using this method you have got to know how to divide. If this is something that you have

### Lecture Notes on MONEY, BANKING, AND FINANCIAL MARKETS. Peter N. Ireland Department of Economics Boston College. irelandp@bc.edu

Lecture Notes on MONEY, BANKING, AND FINANCIAL MARKETS Peter N. Ireland Department of Economics Boston College irelandp@bc.edu http://www2.bc.edu/~irelandp/ec261.html Chapter 16: Determinants of the Money

### Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00

18.781 Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list

### 6 Proportion: Fractions, Direct and Inverse Variation, and Percent

6 Proportion: Fractions, Direct and Inverse Variation, and Percent 6.1 Fractions Every rational number can be written as a fraction, that is a quotient of two integers, where the divisor of course cannot

### Chapter 9. Systems of Linear Equations

Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables

### Continuous Functions, Smooth Functions and the Derivative

UCSC AMS/ECON 11A Supplemental Notes # 4 Continuous Functions, Smooth Functions and the Derivative c 2004 Yonatan Katznelson 1. Continuous functions One of the things that economists like to do with mathematical

### Fibonacci Numbers and Greatest Common Divisors. The Finonacci numbers are the numbers in the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,...

Fibonacci Numbers and Greatest Common Divisors The Finonacci numbers are the numbers in the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,.... After starting with two 1s, we get each Fibonacci number

### 1.4 Factors and Prime Factorization

1.4 Factors and Prime Factorization Recall from Section 1.2 that the word factor refers to a number which divides into another number. For example, 3 and 6 are factors of 18 since 3 6 = 18. Note also that

### Overview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series

Sequences and Series Overview Number of instruction days: 4 6 (1 day = 53 minutes) Content to Be Learned Write arithmetic and geometric sequences both recursively and with an explicit formula, use them

### 4/1/2017. PS. Sequences and Series FROM 9.2 AND 9.3 IN THE BOOK AS WELL AS FROM OTHER SOURCES. TODAY IS NATIONAL MANATEE APPRECIATION DAY

PS. Sequences and Series FROM 9.2 AND 9.3 IN THE BOOK AS WELL AS FROM OTHER SOURCES. TODAY IS NATIONAL MANATEE APPRECIATION DAY 1 Oh the things you should learn How to recognize and write arithmetic sequences

### 3.1. RATIONAL EXPRESSIONS

3.1. RATIONAL EXPRESSIONS RATIONAL NUMBERS In previous courses you have learned how to operate (do addition, subtraction, multiplication, and division) on rational numbers (fractions). Rational numbers

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### Tiers, Preference Similarity, and the Limits on Stable Partners

Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider

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

### Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.

Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a

### Math Circle Beginners Group October 18, 2015

Math Circle Beginners Group October 18, 2015 Warm-up problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### On Generalized Fermat Numbers 3 2n +1

Applied Mathematics & Information Sciences 4(3) (010), 307 313 An International Journal c 010 Dixie W Publishing Corporation, U. S. A. On Generalized Fermat Numbers 3 n +1 Amin Witno Department of Basic

### Kenken For Teachers. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 27, 2010. Abstract

Kenken For Teachers Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 7, 00 Abstract Kenken is a puzzle whose solution requires a combination of logic and simple arithmetic skills.

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

### Equations, Inequalities, Solving. and Problem AN APPLICATION

Equations, Inequalities, and Problem Solving. Solving Equations. Using the Principles Together AN APPLICATION To cater a party, Curtis Barbeque charges a \$0 setup fee plus \$ per person. The cost of Hotel

### Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

### No Solution Equations Let s look at the following equation: 2 +3=2 +7

5.4 Solving Equations with Infinite or No Solutions So far we have looked at equations where there is exactly one solution. It is possible to have more than solution in other types of equations that are