# New Zealand Mathematical Olympiad Committee. Induction

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 New Zealand Mathematical Olympiad Committee Induction Chris Tuffley 1 Proof by dominoes Mathematical induction is a useful tool for proving statements like P is true for all natural numbers n, for example n(n + 1) n = for all n 1. (1) This statement is really a great long list of statements P (1), P (), P (3),... that need to be proved, one for each value of n, and we want a way to prove them all without having to resort to proving the statement for n = 1, then for n =, then n = 3, then... because that way we d never finish. Sometimes (depending on the particular statement) there may be a way to prove them all at the same time; but if such an argument doesn t readily present itself, induction is a good trick to try. Of course, like all tricks, there s no guarantee it will work in a given situation, but like all tricks, it s worth a try! To understand how induction works, think about a long line of dominoes that you would like to topple over. 1 You can make them all fall over by 1. Checking that the dominoes are spaced closely enough that if one falls over, the next falls too; then. Pushing over the first domino. What happens next? The first domino pushes over the second, which pushes over the third, which pushes over the fourth... and eventually all the dominoes fall over. The Principle of Mathematical Induction works in much the same way: it says that if you want to prove a list of statements P (1), P (), P (3),... then it s enough to show that 1. if P (n) is true, then so is P (n + 1), and. P (1) is true. You can carry out these two steps in either order, and in fact they re usually listed in the opposite order, but I ve written them this way because to my mind it fits the domino picture better. Step 1 is called the inductive step; remember, because it s an if... then statement, you prove it by assuming that P (n) is true this assumption is called the inductive hypothesis and using this to show that P (n + 1) is also true. Step is called the base case. Let s see how this works in practice by proving equation (1) above. First let s do the base case: this means checking that the formula holds when n is replaced by 1. The left-hand side equals 1, and the right-hand side is 1(1 + 1) = 1. 1 No-one has yet succeeded in explaining induction without mentioning dominoes, so I won t even try. It s practically compulsory to use this as one s first example, so again I bow to tradition. 1

2 These two numbers are equal, which is good; we ve established the base case. Next comes the inductive step. We start by making the inductive hypothesis: we assume n = n(n + 1) is true for some fixed value of n. Using this assumption, let s look at n + 1: n + (n + 1) = n(n + 1) = n + n + n + = n + 3n + (n + 1)(n + ) =. + (n + 1) (by the inductive hypothesis) We ve obtained the formula with n replaced with n + 1, which proves the inductive step. Since we ve now checked both steps 1 and, the Principle of Mathematical Induction tells us the formula is true for all n, and we can happily use it without any further concerns. A second example: Prove that n + n is even for all n. Checking the base case first, = is even so we re all set there. Suppose that s(n) = n + n is even for some fixed value of n and consider s(n + 1) = (n + 1) + (n + 1) = n + n n + 1 = s(n) + n +. By the inductive hypothesis s(n) is even, so s(n + 1) is a sum of even numbers, hence even also. This proves the inductive step, so by the principle of mathematical induction n + n is even for all n. That wasn t too hard, but what about the following argument: since n + n = n(n + 1) and either n or n + 1 is even, n + n must be even too. This is intended to illustrate what I meant above by proving them all at once, and show that induction isn t always the easiest way to go! Variations The basic outline of induction is as I ve described above. The general idea is to try and establish a link between the the statement for n = k and the statement for n = k + 1. There are times, however, when this can t be done, but with a little deviousness you can still get induction to work in some form. I ve outlined some possibilities below. This list is by no means exhaustive!.1 Base cases other than 1 It may happen that the result you want to prove is only true for n larger than some fixed number k, such as 7. In this case you would proceed as above, using n = k as your base case, and (after carrying out steps (1) and () above) conclude the result is true for all n k. Example 1. Prove n! > n for all sufficiently large n.

3 Solution: First we have to figure out what sufficiently large is. Since 4! = 4 > 16 = 4 (and 3! = 6 < 8 = 3 ) let s take n = 4 as our base case. We ve already checked that so only the inductive step is left; I ll leave this up to you. Once it s checked we ll have the slightly more useful statement that n! > n for all n 4.. Multiple base cases Sometimes it may happen that finding a link between P (n) and P (n + 1) is difficult, but finding one between P (n) and P (n + ) is easy. In that case you can prove P (n) for all n by showing P (n) implies P (n + ) for your inductive step, and checking P (1) and P () as base cases. More generally, you can establish P (n) implies P (n + k) as an inductive step and check P (1),..., P (k) as base cases. Exercise 1. Suppose you have an unlimited supply of 5 and 8 cent stamps. Show you can use these to make any amount of postage greater than 7 cents..3 Strong induction The principle of strong induction replaces the inductive hypothesis that P (n) is true with the stronger assumption that P (j) is true for all j n. Specifically, you show that 1. if P (j) is true for all j n, then so is P (n + 1), and. P (1) is true. Exercise. You and I are playing a game with raisins. We start with two non-empty piles of raisins on the table, and take turns making moves. A move consists of eating all the raisins in one pile and dividing the second into two non-empty (and not necessarily equal) piles. The game continues until one of us can t move; that player loses. Show that if one of the piles starts out with an even number of raisins then the first player can win. Strong induction enters the picture in this problem because we need to assume that we can win any game with fewer raisins if it starts out with at least one pile having an even number of raisins..4 Top down induction and the Well-Ordering Principle Induction arguments are sometimes framed from the top down rather than from the bottom up. In this setting one looks at a smallest counterexample (sometimes colourfully called a minimal criminal ), and uses it to derive a contradiction. One approach is to simply prove the inductive step, thereby showing that the purported counterexample isn t one after all; but a second is to show that the counterexample can be modified to give a smaller one, thereby contradicting the minimality. This second approach is particularly fruitful when one s trying to prove something about fairly complicated objects (say, graphs) by induction over their size (say, the number of edges plus vertices). The smallest counterexample used above is given to us by the Well-Ordering Principle. This principle is equivalent to the Principle of Mathematical Induction, and states that any non-empty subset S of the natural numbers has a least element. To show that P (n) is true for all n, we let S be the set of natural numbers for which P (n) is false. If (heaven forbid!) S is non-empty, then its least element k is the smallest counterexample we were looking for. 3

4 Proofs using the Well-Ordering Principle aren t always immediately recognisable as inductive proofs, as the proof of the following theorem shows. Theorem 1 (The division algorithm). Let a and b be integers with b > 0. Then there exist unique integers q and r such that a = bq + r and 0 r < b. The integers q and r are called the quotient and remainder respectively. I ll prove the existence part (since this is where the WOP is used), and just point you in the right direction for uniqueness. Proof. Let S be the set {a bk k is an integer and a bk 0}. This set is non-empty (check this!) so by the Well-Ordering Principle it has a least element r = a bq. Then a = bq + r and r 0, so we just need to show that r < b. If r b then a b(q + 1) = r b 0, so r = a b(q + 1) belongs to S. But then r = r + b is greater than r, contradicting the fact that r is the smallest element of S. So we must have r < b, as required. To establish uniqueness, suppose that a = bq+r = bq +r with 0 r, r < b. Re-arrange bq+r = bq +r to show that b divides r r, and use this to conclude that r r = 0. You ll need to use the condition that 0 r, r < b to do this..5 Multiple variables Suppose you have a statement of the form P is true for all n, m 1, for example m! 0! + (m + 1)! 1! + + (m + n)! n! = (m + n + 1)! n!(m + 1). You could try proving it by first doing induction over one of the variables, then induction over the second (how should your inductive hypotheses be framed for each variable?). Which one you choose can sometimes (but not always) make your life easier or harder, and it s worth thinking about which way to do it before wading in. Exercise 3. Prove the above identity two ways, by induction over n first, then by induction over m first..6 Mixing forwards and backwards induction The arithmetic mean-geometric mean inequality says that if a 1, a,..., a n are non-negative numbers then (a 1 a... a n ) 1/n a 1 + a + + a n n (the left-hand side is the geometric mean of the a i and the right-hand side is the ordinary mean, also known as the arithmetic mean). This can be proved by forwards induction over the powers of two (if it s true for one power of two, it s true for the next), then backwards induction to fill in the gaps! By backwards induction I mean showing P (n 1) is true if P (n) is in this case you d use the powers of two as your base cases. Try it for yourself! 4

5 3 A false proof The following argument is due to George Pólya, and everyone should see it at some point. We ll prove by induction that all horses are the same colour. More precisely, we ll show that any n horses are all the same colour for each n 1 that ought to do it. The base case (n = 1) is obvious, so let s assume that given a set of n horses, they re all the same colour. Take a set of n + 1 horses, and designate one of them the test horse. Remove one of the other horses, leaving a herd of n; by the inductive hypothesis, they re all the same colour, and in particular, they re all the same colour as the test horse. Put the horse you removed back, and remove one of the others, again leaving a set of n horses; by the inductive assumption, they re all the same colour, and we see that the horse previously removed is the same colour as the test horse also. So all n + 1 of them are same colour, which proves the inductive step. So all horses are the same colour. Exercise 4. Find the flaw in this argument! 4 Problems Have a go at the following problems. They vary in difficulty; the harder ones are probably towards the end. In some cases you ll have to figure out just what it is you want to prove using induction first; in others, you may come up with a non-inductive proof too. 1. Prove n > n for all n 1.. Prove that (a) (n 1) = n, (b) n n(n + 1)(n + 1) =, 6 (c) n 3 = n (n + 1) Show that n > n for sufficiently large n. 4. Show that a set of n elements has n subsets. 5. The Fibonacci numbers are defined by f 0 = f 1 = 1 and f n+1 = f n + f n 1 for n. Show that the nth Fibonacci number is given by f n = (φ +) n (φ ) n φ + φ, where φ + = and φ = 1 5 are the roots of x = x + 1. (See Recurrence Relations [1] to learn how you might come up with this formula in the first place.) 6. Use strong induction to prove that every integer n may be expressed as a product of prime numbers. 5

6 7. (The Tower of Hanoi) This game is played with three pegs and n discs, each a different size to the rest and each with a hole in the centre so it can fit over the pegs. All the discs start out on one of the pegs, stacked in increasing order of size; the object of the game is to move them all to one of the other pegs. You re only allowed to move one disc at a time, and you re not allowed to put any disc on top of one that s smaller. How many moves are required? 8. Given a (m + 1) (n + 1) chessboard in which all four corners are black squares, show that if one removes any one white square and any two black squares, the remaining board can be covered with dominoes (1 rectangles). 9. Prove the arithmetic-geometric mean inequality (see Section.6 above). Hint: Use the fact that (a b) 0 to prove the base case n =. 10. (Euler s formula for graphs in the plane) Let G be a connected graph drawn in the plane with v vertices and e edges that divide the plane into f regions or faces (we consider the outside to be a face too). Then v e + f =. Prove this by induction on the number of vertices plus edges (you may wish to consider a top-down approach). Extra: use this fact to determine the maximum number of pieces you can cut a pizza into with n straight cuts. 11. Suppose n disks, black on one side and white on the other, are laid out in a straight line with a random arrangement of black sides up. You are playing a game of solitaire, in which a turn consists of removing a black disk and flipping over its immediate neighbors, if any. (Two disks are not considered immediate neighbors if there used to be a disk between them that is now gone.) A game is winnable if it is possible to remove all n disks. Describe all winnable games, and devise a strategy which will win all winnable games. Hint: Once you think you can describe all winnable games, prove your guess using induction. Note that not only must you show you can win all games you think are winnable, but you must also prove that all others aren t winnable. Do this by induction too. References [1] Chris Tuffley. Recurrence Relations. NZ Mathematical Olympiad Committee, January 009. Available from 3rd March

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

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

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

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

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

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

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

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

### Induction Problems. Tom Davis November 7, 2005

Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily

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

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

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

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

### Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

### Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

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

### If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?

Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question

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

### ALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite

ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### Assignment 5 - Due Friday March 6

Assignment 5 - Due Friday March 6 (1) Discovering Fibonacci Relationships By experimenting with numerous examples in search of a pattern, determine a simple formula for (F n+1 ) 2 + (F n ) 2 that is, a

### Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)

Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes) by Jim Propp (UMass Lowell) March 14, 2010 1 / 29 Completeness Three common

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

### Bored MUMSians. Is it possible that he is left with the number 1?

Sam Chow One Player Games Bored MUMSians Han writes the numbers 1, 2,..., 100 on the whiteboard. He picks two of these numbers, erases them, and replaces them with their difference (so at some point in

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

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

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

### WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

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

### POLYNOMIAL FUNCTIONS

POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a

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

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

### Wald s Identity. by Jeffery Hein. Dartmouth College, Math 100

Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,

### The Taxman Game. Robert K. Moniot September 5, 2003

The Taxman Game Robert K. Moniot September 5, 2003 1 Introduction Want to know how to beat the taxman? Legally, that is? Read on, and we will explore this cute little mathematical game. The taxman game

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

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

### Chapter 11 Number Theory

Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications

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

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

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!

GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!!! Challenge Problem 2 (Mastermind) due Fri. 9/26 Find a fourth guess whose scoring will allow you to determine the secret code (repetitions are

### 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### Chapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way

Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)

### Chapter 7 Part 2. Hypothesis testing Power

Chapter 7 Part 2 Hypothesis testing Power November 6, 2008 All of the normal curves in this handout are sampling distributions Goal: To understand the process of hypothesis testing and the relationship

### Planar Graphs. Complement to Chapter 2, The Villas of the Bellevue

Planar Graphs Complement to Chapter 2, The Villas of the Bellevue In the chapter The Villas of the Bellevue, Manori gives Courtel the following definition. Definition A graph is planar if it can be drawn

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

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

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

### Permutation Groups. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003

Permutation Groups Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003 Abstract This paper describes permutations (rearrangements of objects): how to combine them, and how

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

### Linear Programming Problems

Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number

### Question: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?

ECS20 Discrete Mathematics Quarter: Spring 2007 Instructor: John Steinberger Assistant: Sophie Engle (prepared by Sophie Engle) Homework 8 Hints Due Wednesday June 6 th 2007 Section 6.1 #16 What is the

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

### Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )

1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the

### SMMG December 2 nd, 2006 Dr. Edward Burger (Williams College) Discovering Beautiful Patterns in Nature and Number. Fun Fibonacci Facts

SMMG December nd, 006 Dr. Edward Burger (Williams College) Discovering Beautiful Patterns in Nature and Number. The Fibonacci Numbers Fun Fibonacci Facts Examine the following sequence of natural numbers.

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

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

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

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### Indiana State Core Curriculum Standards updated 2009 Algebra I

Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and

### Models for Discrete Variables

Probability Models for Discrete Variables Our study of probability begins much as any data analysis does: What is the distribution of the data? Histograms, boxplots, percentiles, means, standard deviations

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

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

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Five fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms

The five fundamental operations of mathematics: addition, subtraction, multiplication, division, and modular forms UC Berkeley Trinity University March 31, 2008 This talk is about counting, and it s about

### Zeros of Polynomial Functions

Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### 2.1. Inductive Reasoning EXAMPLE A

CONDENSED LESSON 2.1 Inductive Reasoning In this lesson you will Learn how inductive reasoning is used in science and mathematics Use inductive reasoning to make conjectures about sequences of numbers

### 1, 1, 2, 3, 5, 8, 13,...

1 The is perhaps the most famous sequence in mathematics: there is even a professional journal entitled Fibonacci Quarterly solely dedicated to properties of this sequence. The sequence begins 1, 1,, 3,,

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

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

### Examination paper for MA0301 Elementær diskret matematikk

Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750

### Zero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.

MATH 11011 FINDING REAL ZEROS KSU OF A POLYNOMIAL Definitions: Polynomial: is a function of the form P (x) = a n x n + a n 1 x n 1 + + a x + a 1 x + a 0. The numbers a n, a n 1,..., a 1, a 0 are called

### WHERE DOES THE 10% CONDITION COME FROM?

1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay

### 5-4 Prime and Composite Numbers

5-4 Prime and Composite Numbers Prime and Composite Numbers Prime Factorization Number of Divisorss Determining if a Number is Prime More About Primes Prime and Composite Numbers Students should recognizee

### Current California Math Standards Balanced Equations

Balanced Equations Current California Math Standards Balanced Equations Grade Three Number Sense 1.0 Students understand the place value of whole numbers: 1.1 Count, read, and write whole numbers to 10,000.

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

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

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

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

### PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

### Nim Games. There are initially n stones on the table.

Nim Games 1 One Pile Nim Games Consider the following two-person game. There are initially n stones on the table. During a move a player can remove either one, two, or three stones. If a player cannot

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

### csci 210: Data Structures Recursion

csci 210: Data Structures Recursion Summary Topics recursion overview simple examples Sierpinski gasket Hanoi towers Blob check READING: GT textbook chapter 3.5 Recursion In general, a method of defining

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

### Introduction to Diophantine Equations

Introduction to Diophantine Equations Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles September, 2006 Abstract In this article we will only touch on a few tiny parts of the field

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

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

### (x + a) n = x n + a Z n [x]. Proof. If n is prime then the map

22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find

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

### 3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### each college c i C has a capacity q i - the maximum number of students it will admit

n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i - the maximum number of students it will admit each college c i has a strict order i