# Appendix F: Mathematical Induction

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 look at the problem discussed in Section 9.2, Example 5. S S S S S Judging from the pattern formed by these first five sums, it appears that the sum of the first n odd integers is S n (2n 1) n 2. Although this particular formula is valid, it is important for you to see that recognizing a pattern and then simply jumping to the conclusion that the pattern must be true for all values of n is not a logically valid method of proof. There are many examples in which a pattern appears to be developing for small values of n but then fails at some point. One of the most famous cases of this is the conjecture by the French mathematician Pierre de Fermat (101 15), who speculated that all numbers of the form F n 2 2n + 1, n 0, 1, 2,... are prime. For n 0, 1, 2, 3, and, the conjecture is true. F 0 3 F 1 5 F 2 17 F F 5,537 The size of the next Fermat number (F 5,29,97,297) is so great that it was difficult for Fermat to determine whether or not it was prime. However, another well-known mathematician, Leonhard Euler ( ), later found a factorization F 5,29,97,297 1(,700,17) which proved that F 5 is not prime and therefore Fermat s conjecture was false. Just because a rule, pattern, or formula seems to work for several values of n, you cannot simply decide that it is valid for all values of n without going through a legitimate proof. Mathematical induction is one method of proof. What you should learn Use mathematical induction to prove statements involving a positive integer n. Find the sums of powers of integers. Find finite differences of sequences. Why you should learn it Finite differences can be used to determine what type of model can be used to represent a sequence. For instance, in Exercise 59 on page F8, you will use finite differences to find a model that represents the number of sides of the nth Koch snowflake. F1

2 F2 Appendix F Mathematical Induction The Principle of Mathematical Induction Let P n be a statement involving the positive integer n. If 1. P 1 is true, and 2. the truth of P k implies the truth of P k+1 for every positive integer k, then P n must be true for all positive integers n. To apply the Principle of Mathematical Induction, you need to be able to determine the statement P k+1 for a given statement P k. To determine P k+1, substitute k + 1 for k in the statement P k. Remark It is important to recognize that in order to prove a statement by induction, both parts of the Principle of Mathematical Induction are necessary. EXAMPLE 1 A Preliminary Example Find P k+1 for each P k. a. P k : S k k2 (k + 1) 2 b. P k : S k [(k 1) 3] + (k 3) c. P k : k + 3 < 5k 2 d. P k : 3 k 2k + 1 a. P k+1 : S k+1 (k + 1)2 (k ) 2 Replace k by k + 1. (k + 1)2 (k + 2) 2 Simplify. b. P k+1 : S k {[(k + 1) 1] 3} + [(k + 1) 3] (k 3) + (k + 1) c. P k+1 : (k + 1) + 3 < 5(k + 1) 2 k + < 5(k 2 + 2k + 1) d. P k+1 : 3 k+1 2(k + 1) k+1 2k + 3 A well-known illustration used to explain why the Principle of Mathematical Induction works is the unending line of dominoes represented by Figure F.1. When the line actually contains infinitely many dominoes, it is clear that you could not knock down the entire line by knocking down only one domino at a time. However, suppose it were true that each domino would knock down the next one as it fell. Then you could knock them all down simply by pushing the first one and starting a chain reaction. Mathematical induction works in the same way. If the truth of P k implies the truth of P k+1 and if P 1 is true, then the chain reaction proceeds as follows: P 1 implies P 2, P 2 implies P 3, P 3 implies P, and so on. Figure F.1

3 When using mathematical induction to prove a summation formula (such as the one in Example 2), it is helpful to think of S k+1 as S k+1 S k + a k+1 where a k+1 is the (k + 1)th term of the original sum. EXAMPLE 2 Using Mathematical Induction Use mathematical induction to prove the formula S n (2n 1) n 2 for all integers n 1. Mathematical induction consists of two distinct parts. First, you must show that the formula is true when n When n 1, the formula is valid because S The second part of mathematical induction has two steps. The first step is to assume that the formula is valid for some integer k. The second step is to use this assumption to prove that the formula is valid for the next integer, k Assuming that the formula S k (2k 1) k 2 is true, you must show that the formula S k+1 (k + 1) 2 is true. S k (2k 1) + [2(k + 1) 1] [ (2k 1)] + (2k + 2 1) S k + (2k + 1) Group terms to form S k. k 2 + 2k + 1 Replace S k by k 2. (k + 1) 2 Combining the results of parts (1) and (2), you can conclude by mathematical induction that the formula is valid for all integers n 1. Appendix F Mathematical Induction F3 It occasionally happens that a statement involving natural numbers is not true for the first k 1 positive integers but is true for all values of n k. In these instances, you use a slight variation of the Principle of Mathematical Induction in which you verify P k rather than P 1. This variation is called the Extended Principle of Mathematical Induction. To see the validity of this principle, note from Figure F.1 that all but the first k 1 dominoes can be knocked down by knocking over the kth domino. This suggests that you can prove a statement P n to be true for n k by showing that P k is true and that P k implies P k+1. In Exercises 29 3 in this appendix, you are asked to apply this extension of mathematical induction.

4 F Appendix F Mathematical Induction EXAMPLE 3 Using Mathematical Induction Use mathematical induction to prove the formula S n n 2 for all integers n When n 1, the formula is valid because S Assuming that 1(1 + 1)( ) 1(2)(3). S k k 2 you must show that S k+1 (k + 1)(k )[2(k + 1) + 1] To do this, write the following. S k+1 S k + a k+1 n(n + 1)(2n + 1) k(k + 1)(2k + 1). (k + 1)(k + 2)(2k + 3). ( k 2 ) + (k + 1) 2 Substitute for S k. k(k + 1)(2k + 1) + (k + 1) 2 By assumption k(k + 1)(2k + 1) + (k + 1)2 (k + 1)[k(2k + 1) + (k + 1)] (k + 1)(2k2 + 7k + ) (k + 1)(k + 2)(2k + 3) Combine fractions. Factor. Simplify. S k implies S k+1. Combining the results of parts (1) and (2), you can conclude by mathematical induction that the formula is valid for all integers n 1. When proving a formula by mathematical induction, the only statement that you need to verify is P 1. As a check, it is a good idea to try verifying some of the other statements. For instance, in Example 3, try verifying P 2 and P 3.

5 Appendix F Mathematical Induction F5 EXAMPLE Proving an Inequality Prove that n < 2 n for all integers n For n 1 and n 2, the formula is true because 1 < 2 1 and 2 < Assuming that k < 2 k you need to show that k + 1 < 2 k+1. Multiply each side of k < 2 k by 2. 2(k) < 2(2 k ) 2 k+1 Because k + 1 < k + k 2k for all k > 1, it follows that or k + 1 < 2k < 2 k+1 k + 1 < 2 k+1. Combining the results of parts (1) and (2), you can conclude by mathematical induction that n < 2 n for all integers n 1. Sums of Powers of Integers The formula in Example 3 is one of a collection of useful summation formulas. This and other formulas dealing with the sums of various powers of the first n positive integers are summarized below. Sums of Powers of Integers 1. i n n(n + 1) 2 2. i n 2 n(n + 1)(2n + 1) 3. i n 3 n2 (n + 1) 2. i n n(n + 1)(2n + 1)(3n2 + 3n 1) i n 5 n2 (n + 1) 2 (2n 2 + 2n 1) 12 Each of these formulas for sums can be proven by mathematical induction. (See Exercises in this appendix.)

6 F Appendix F Mathematical Induction Finite Differences The first differences of a sequence are found by subtracting consecutive terms. The second differences are found by subtracting consecutive first differences. The first and second differences of the sequence 3, 5, 8, 12, 17, 23,... are as follows. n: a n : First differences: Second differences: For this sequence, the second differences are all the same. When this happens, and the second differences are nonzero, the sequence has a perfect quadratic model. When the first differences are all the same nonzero number, the sequence has a perfect linear model that is, it is arithmetic. EXAMPLE 5 Finding a Quadratic Model Find the quadratic model for the sequence 3, 5, 8, 12, 17, 23,.... You know from the second differences shown above that the model is quadratic and has the form a n an 2 + bn + c. By substituting 1, 2, and 3 for n, you can obtain a system of three linear equations in three variables. a 1 a(1) 2 + b(1) + c 3 Substitute 1 for n. a 2 a(2) 2 + b(2) + c 5 Substitute 2 for n. a 3 a(3) 2 + b(3) + c 8 Substitute 3 for n. You now have a system of three equations in a, b, and c. { a + b + c 3 Equation 1 a + 2b + c 5 Equation 2 9a + 3b + c 8 Equation 3 Solving this system of equations using the techniques discussed in Chapter 8, you can find the solution to be a 1 2, b 1 2, and c 2. So, the quadratic model is a n 1 2 n n + 2. Check the values of a 1, a 2, and a 3 as follows. Check a 1 1 2(1) (1) a 2 1 2(2) (2) a 3 1 2(3) (3) checks. checks. checks.

7 Appendix F Mathematical Induction F7 F Exercises For instructions on how to use a graphing utility, see Appendix A. Vocabulary and Concept Check In Exercises 1, fill in the blank. 1. The first step in proving a formula by is to show that the formula is true when n The differences of a sequence are found by subtracting consecutive terms. 3. A sequence is an sequence when the first differences are all the same nonzero number.. When the differences of a sequence are all the same nonzero number, then the sequence has a perfect quadratic model. Procedures and Problem Solving Finding P k+1 given P k. 5. P k 5 k(k + 1) 7. P k 2k (k + 1)! In Exercises 5 10, find P k+1 for the. P k 8. P k 2k 1 k! (k + 2)(k + 3) 9. P k [5(k 1) ] + (5k ) 10. P k [(k 1) + 1] + (k + 1) Using Mathematical Induction In Exercises 11 2, use mathematical induction to prove the formula for all positive integers n n n(n + 1) (8n 5) n(n 1) (5n 2) n (5n + 1) (3n 2) n (3n 1) n 1 2 n ( n 1 ) 3 n n(n + 1) i i 3 n2 (n + 1) i n(n + 1)(2n + 1)(3n2 + 3n 1) i 5 n2 (n + 1) 2 (2n 2 + 2n 1) n(n + 1)(n + 2) i(i + 1) (2i 1)(2i + 1) n 2n i(i + 1) n n i(i + 1)(i + 2) n(n + 3) (n + 1)(n + 2) Finding Sums of Powers of Integers In Exercises 25 28, find the sum using the formulas for the sums of powers of integers n n n1 n (n 2 n) (n 3 n) n1 n1 Proving an Inequality by Mathematical Induction In Exercises 29 3, prove the inequality for the indicated integer values of n. 29. n! > 2 n, n 30. ( 3) n > n, n ( x n > n, n 2 y) n+1 < ( x y) n, n 1 and 0 < x < y 33. (1 + a) n na, n 1 and a > n > n 2 n, n 1 Using Mathematical Induction In Exercises 35, use mathematical induction to prove the property for all positive integers 35. (ab) n a n b n 3. ( a b) n an b n

8 F8 Appendix F Mathematical Induction 37. If x 1 0, x 2 0,..., x n 0, then (x 1 x 2 x 3... x n ) 1 x 1 1 x 2 1 x x n If x 1 > 0, x 2 > 0,..., x n > 0, then ln(x 1 x 2... x n ) ln x 1 + ln x ln x n. 39. Generalized Distributive Law: x(y 1 + y y n ) xy 1 + xy xy n 0. (a + bi) n and (a bi) n are complex conjugates for all n A factor of (n 3 + 3n 2 + 2n) is A factor of (n 3 + 5n + ) is A factor of (n 3 n + 3) is 3.. A factor of (n n + ) is A factor of (2 2n+1 + 1) is 3.. A factor of (2 n 2 + 1) is 5. Using Finite Differences to Classify a Sequence In Exercises 7 5, write the first five terms of the sequence beginning with the given term. Then calculate the first and second differences of the sequence. Does the sequence have a linear model, a quadratic model, or neither? 7. a a 1 2 a n a n a n n a n 1 9. a a 2 3 a n a n 1 n a n 2a n a a 0 2 a n a n 1 + n a n (a n 1 ) a a 1 0 a n a n a n a n 1 + 2n Finding a Quadratic Model In Exercises 55 58, find a quadratic model for the sequence with the indicated terms , 3, 5, 9, 15, 23, ,, 7, 10, 15, 22, a 0 3, a 2 1, a a 0 3, a 2 0, a (p. F1) A Koch snowflake is created by starting with an equilateral triangle with sides one unit in length. Then, on each side of the triangle, a new equilateral triangle is created on the middle third of that side. This process is repeated continuously, as shown in the figure. (a) Determine a formula for the number of sides of the nth Koch snowflake. Use mathematical induction to prove your answer. (b) Determine a formula for the area of the nth Koch snowflake. Recall that the area A of an equilateral triangle with side s is A ( 3 )s 2. (c) Determine a formula for the perimeter of the nth Koch snowflake. 0. Using Mathematical Induction The Tower of Hanoi puzzle is a game in which three pegs are attached to a board and one of the pegs has n disks sitting on it, as shown in the figure. Each disk on that peg must sit on a larger disk. The strategy of the game is to move the entire pile of disks, one at a time, to another peg. At no time may a disk sit on a smaller disk. (a) Find the number of moves when there are three disks. (b) Find the number of moves when there are four disks. (c) Use your results from parts (a) and (b) to find a formula for the number of moves when there are n disks. (d) Use mathematical induction to prove the formula you found in part (c). Conclusions True or False? In Exercises 1 3, determine whether the statement is true or false. Justify your answer. 1. If the statement P k is true and P k implies P k+1, then P 1 is also true. 2. If a sequence is arithmetic, then the first differences of the sequence are all zero. 3. A sequence with n terms has n 1 second differences.. Think About It What conclusion can be drawn from the information given about each sequence P 1, P 2, P 3,..., P n? (a) P 3 is true and P k implies P k+1. (b) P 1, P 2, P 3,..., P 50 are all true. (c) P 1, P 2, and P 3 are all true, but the truth of P k does not imply that P k+1 is true. (d) P 2 is true and P 2k implies P 2k+2.

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

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

### 8.7 Mathematical Induction

8.7. MATHEMATICAL INDUCTION 8-135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture

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

### Topics in Number Theory

Chapter 8 Topics in Number Theory 8.1 The Greatest Common Divisor Preview Activity 1 (The Greatest Common Divisor) 1. Explain what it means to say that a nonzero integer m divides an integer n. Recall

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

### 3. Recurrence Recursive Definitions. To construct a recursively defined function:

3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a

### Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

### Oh Yeah? Well, Prove It.

Oh Yeah? Well, Prove It. MT 43A - Abstract Algebra Fall 009 A large part of mathematics consists of building up a theoretical framework that allows us to solve problems. This theoretical framework is built

### Mathematical Induction

Chapter 4 Mathematical Induction 4.1 The Principle of Mathematical Induction Preview Activity 1 (Exploring Statements of the Form.8n N/.P.n//) One of the most fundamental sets in mathematics is the set

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

### Arithmetic and Geometric Sequences

Arithmetic and Geometric Sequences Felix Lazebnik This collection of problems is for those who wish to learn about arithmetic and geometric sequences, or to those who wish to improve their understanding

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

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

### Logic and Proof Solutions. Question 1

Logic and Proof Solutions Question 1 Which of the following are true, and which are false? For the ones which are true, give a proof. For the ones which are false, give a counterexample. (a) x is an odd

### Math 115 Spring 2011 Written Homework 5 Solutions

. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence

### Math 115 Spring 2014 Written Homework 3 Due Wednesday, February 19

Math 11 Spring 01 Written Homework 3 Due Wednesday, February 19 Instructions: Write complete solutions on separate paper (not spiral bound). If multiple pieces of paper are used, they must be stapled with

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

### Mathematical Induction

Mathematical Induction MAT30 Discrete Mathematics Fall 016 MAT30 (Discrete Math) Mathematical Induction Fall 016 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)

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

### MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS

1 CHAPTER 6. MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 Introduction Recurrence

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

### Direct Proofs. CS 19: Discrete Mathematics. Direct Proof: Example. Indirect Proof: Example. Proofs by Contradiction and by Mathematical Induction

Direct Proofs CS 19: Discrete Mathematics Amit Chakrabarti Proofs by Contradiction and by Mathematical Induction At this point, we have seen a few examples of mathematical proofs. These have the following

### 8.3. GEOMETRIC SEQUENCES AND SERIES

8.3. GEOMETRIC SEQUENCES AND SERIES What You Should Learn Recognize, write, and find the nth terms of geometric sequences. Find the sum of a finite geometric sequence. Find the sum of an infinite geometric

### San Jose Math Circle October 17, 2009 ARITHMETIC AND GEOMETRIC PROGRESSIONS

San Jose Math Circle October 17, 2009 ARITHMETIC AND GEOMETRIC PROGRESSIONS DEFINITION. An arithmetic progression is a (finite or infinite) sequence of numbers with the property that the difference between

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

### Principle of (Weak) Mathematical Induction. P(1) ( n 1)(P(n) P(n + 1)) ( n 1)(P(n))

Outline We will cover (over the next few weeks) Mathematical Induction (or Weak Induction) Strong (Mathematical) Induction Constructive Induction Structural Induction Principle of (Weak) Mathematical Induction

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

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

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

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

### Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction.

Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction. February 21, 2006 1 Proof by Induction Definition 1.1. A subset S of the natural numbers is said to be inductive if n S we have

### Mathematical Induction

Mathematical S 0 S 1 S 2 S 3 S 4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! Mathematical S 0 S 1 S 2 S 3 S4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! S 4 Mathematical S 0 S 1 S 2 S 3 S5 S 6 S 7 S 8 S 9 S 10

### Determine whether the sequence is arithmetic, geometric, or neither. 18, 11, 4,

Over Lesson 10 1 Determine whether the sequence is arithmetic, geometric, or neither. 18, 11, 4, A. arithmetic B. geometric C. neither Over Lesson 10 1 Determine whether the sequence is arithmetic, geometric,

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

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

### MATHEMATICAL INDUCTION

MATHEMATICAL INDUCTION MATH 5A SECTION HANDOUT BY GERARDO CON DIAZ Imagine a bunch of dominoes on a table. They are set up in a straight line, and you are about to push the first piece to set off the chain

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

### Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

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

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

### PRINCIPLE OF MATHEMATICAL INDUCTION

Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION Analysis and natural philosophy owe their most important discoveries to this fruitful means, which is called induction Newton was indebted to it for his theorem

### 2.4 Mathematical Induction

2.4 Mathematical Induction What Is (Weak) Induction? The Principle of Mathematical Induction works like this: What Is (Weak) Induction? The Principle of Mathematical Induction works like this: We want

### STUDY GUIDE FOR SOME BASIC INTERMEDIATE ALGEBRA SKILLS

STUDY GUIDE FOR SOME BASIC INTERMEDIATE ALGEBRA SKILLS The intermediate algebra skills illustrated here will be used extensively and regularly throughout the semester Thus, mastering these skills is an

Table of Contents I. Introduction II. Chapter of Signed Numbers B. Introduction and Zero Sum Game C. Adding Signed Numbers D. Subtracting Signed Numbers 1. Subtracting Signed Numbers 2. Rewriting as Addition

### Equations and Inequalities

Rational Equations Overview of Objectives, students should be able to: 1. Solve rational equations with variables in the denominators.. Recognize identities, conditional equations, and inconsistent equations.

### New Zealand Mathematical Olympiad Committee. Induction

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

### Mathematical Induction with MS

Mathematical Induction 2008-14 with MS 1a. [4 marks] Using the definition of a derivative as, show that the derivative of. 1b. [9 marks] Prove by induction that the derivative of is. 2a. [3 marks] Consider

### Sequences and Series

Contents 6 Sequences and Series 6. Sequences and Series 6. Infinite Series 3 6.3 The Binomial Series 6 6.4 Power Series 3 6.5 Maclaurin and Taylor Series 40 Learning outcomes In this Workbook you will

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

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### Mathematical Induction. Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition)

Mathematical Induction Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition) Mathmatical Induction Mathmatical induction can be used to prove statements that assert that P(n) is true for all positive

### Algebra C/D Borderline Revision Document

Algebra C/D Borderline Revision Document Algebra content that could be on Exam Paper 1 or Exam Paper 2 but: If you need to use a calculator for *** shown (Q8 and Q9) then do so. Questions are numbered

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

### Chapter 1 Basic Number Concepts

Draft of September 2014 Chapter 1 Basic Number Concepts 1.1. Introduction No problems in this section. 1.2. Factors and Multiples 1. Determine whether the following numbers are divisible by 3, 9, and 11:

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

### Advanced Algebra 2. I. Equations and Inequalities

Advanced Algebra 2 I. Equations and Inequalities A. Real Numbers and Number Operations 6.A.5, 6.B.5, 7.C.5 1) Graph numbers on a number line 2) Order real numbers 3) Identify properties of real numbers

### Algebra I. In this technological age, mathematics is more important than ever. When students

In this technological age, mathematics is more important than ever. When students leave school, they are more and more likely to use mathematics in their work and everyday lives operating computer equipment,

### ALGEBRA I A PLUS COURSE OUTLINE

ALGEBRA I A PLUS COURSE OUTLINE OVERVIEW: 1. Operations with Real Numbers 2. Equation Solving 3. Word Problems 4. Inequalities 5. Graphs of Functions 6. Linear Functions 7. Scatterplots and Lines of Best

### Series and Sequences

Randolph High School Math League 203-204 Page Introduction Series and Sequences Sequences and series are all about finding and exploting patterns. Each term in a sequence is based in some way to terms

### Properties of Real Numbers

16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should

### IB Maths SL Sequence and Series Practice Problems Mr. W Name

IB Maths SL Sequence and Series Practice Problems Mr. W Name Remember to show all necessary reasoning! Separate paper is probably best. 3b 3d is optional! 1. In an arithmetic sequence, u 1 = and u 3 =

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

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

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

### Date: Section P.2: Exponents and Radicals. Properties of Exponents: Example #1: Simplify. a.) 3 4. b.) 2. c.) 3 4. d.) Example #2: Simplify. b.) a.

Properties of Exponents: Section P.2: Exponents and Radicals Date: Example #1: Simplify. a.) 3 4 b.) 2 c.) 34 d.) Example #2: Simplify. a.) b.) c.) d.) 1 Square Root: Principal n th Root: Example #3: Simplify.

### Algebra I Notes Review Real Numbers and Closure Unit 00a

Big Idea(s): Operations on sets of numbers are performed according to properties or rules. An operation works to change numbers. There are six operations in arithmetic that "work on" numbers: addition,

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

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

### The thing that started it 8.6 THE BINOMIAL THEOREM

476 Chapter 8 Discrete Mathematics: Functions on the Set of Natural Numbers (b) Based on your results for (a), guess the minimum number of moves required if you start with an arbitrary number of n disks.

### 2.4 Multiplication of Integers. Recall that multiplication is defined as repeated addition from elementary school. For example, 5 6 = 6 5 = 30, since:

2.4 Multiplication of Integers Recall that multiplication is defined as repeated addition from elementary school. For example, 5 6 = 6 5 = 30, since: 5 6=6+6+6+6+6=30 6 5=5+5+5+5+5+5=30 To develop a rule

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

### DEFINITIONS: 1. FACTORIAL: n! = n (n 1) (n 2) ! = 1. n! = n (n 1)! = n (n 1) (n 2)! (n + 1)! = (n + 1) n! = (n + 1) n (n 1)!

MATH 2000 NOTES ON INDUCTION DEFINITIONS: 1. FACTORIAL: n! = n (n 1) (n 2)... 3 2 1 0! = 1 n! = n (n 1)! = n (n 1) (n 2)! (n + 1)! = (n + 1) n! = (n + 1) n (n 1)! 2. SUMMATION NOTATION: f(i) = f(1) + f(2)

### Sucesiones repaso Klasse 12 [86 marks]

Sucesiones repaso Klasse [8 marks] a. Consider an infinite geometric sequence with u = 40 and r =. (i) Find. u 4 (ii) Find the sum of the infinite sequence. (i) correct approach () e.g. u 4 = (40) u 4

### Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

### Stanford University Educational Program for Gifted Youth (EPGY) Number Theory. Dana Paquin, Ph.D.

Stanford University Educational Program for Gifted Youth (EPGY) Dana Paquin, Ph.D. paquin@math.stanford.edu Summer 2010 Note: These lecture notes are adapted from the following sources: 1. Ivan Niven,

### West Windsor-Plainsboro Regional School District Algebra I Part 2 Grades 9-12

West Windsor-Plainsboro Regional School District Algebra I Part 2 Grades 9-12 Unit 1: Polynomials and Factoring Course & Grade Level: Algebra I Part 2, 9 12 This unit involves knowledge and skills relative

### Proof that an Infinite Number of Mersenne Prime Numbers Exit

Proof that an Infinite Number of Mersenne Prime Numbers Exit Stephen Marshall 29 Aug 2014 Abstract This paper presents a complete and exhaustive proof of the infinitude of Mersenne prime numbers. The approach

### Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Note 3

CS 70 Discrete Mathematics and Probability Theory Fall 06 Seshia and Walrand Note 3 Mathematical Induction Introduction. In this note, we introduce the proof technique of mathematical induction. Induction

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

Mathematics 0N1 Solutions 1 1. Write the following sets in list form. 1(i) The set of letters in the word banana. {a, b, n}. 1(ii) {x : x 2 + 3x 10 = 0}. 3(iv) C A. True 3(v) B = {e, e, f, c}. True 3(vi)

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

### 4. PRINCIPLE OF MATHEMATICAL INDUCTION

4 PRINCIPLE OF MATHEMATICAL INDUCTION Ex Prove the following by principle of mathematical induction 1 1 + 2 + 3 + + n 2 1 2 + 2 2 + 3 2 + + n 2 3 1 3 + 2 3 + 3 3 + + n 3 + 4 (1) + (1 + 3) + (1 + 3 + 5)

### 16.1. Sequences and Series. Introduction. Prerequisites. Learning Outcomes. Learning Style

Sequences and Series 16.1 Introduction In this block we develop the ground work for later blocks on infinite series and on power series. We begin with simple sequences of numbers and with finite series

### Assignment 3 Solutions Problem1: (Section 1.2 Exercise 8) Consider the following assertions.

Assignment 3 Solutions Problem1: (Section 1.2 Eercise 8) Consider the following assertions. A: There eists a real number y such that y > for every real number B: For every real number, there eists a real

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

### Vocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.

CHAPTER Vocabulary The table contains important vocabulary terms from Chapter. As you work through the chapter, fill in the page number, definition, and a clarifying example. biconditional statement conclusion

### A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25

### Even Number: An integer n is said to be even if it has the form n = 2k for some integer k. That is, n is even if and only if n divisible by 2.

MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation

### UNIT TWO POLYNOMIALS MATH 421A 22 HOURS. Revised May 2, 00

UNIT TWO POLYNOMIALS MATH 421A 22 HOURS Revised May 2, 00 38 UNIT 2: POLYNOMIALS Previous Knowledge: With the implementation of APEF Mathematics at the intermediate level, students should be able to: -

### Algebraic expressions are a combination of numbers and variables. Here are examples of some basic algebraic expressions.

Page 1 of 13 Review of Linear Expressions and Equations Skills involving linear equations can be divided into the following groups: Simplifying algebraic expressions. Linear expressions. Solving linear

### Section 3.3 Equivalence Relations

1 Section 3.3 Purpose of Section To introduce the concept of an equivalence relation and show how it subdivides or partitions a set into distinct categories. Introduction Classifying objects and placing

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

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

### is not a real number it follows that there is no REAL

210 CHAPTER EIGHT 8. Complex Numbers When we solve x 2 + 2x + 2 = 0 and use the Quadratic Formula we get Since we know that solution to the equation x 2 + 2x + 2 = 0. is not a real number it follows that

### Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov

Lee 1 Primes in Sequences By: Jae Young Lee Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov Lee 2 Jae Young Lee MA341 Number Theory PRIMES IN SEQUENCES