# Lecture 3. Mathematical Induction

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 logically follows from axioms Axioms are the simplest obvious facts (these facts are the results of the long history of the human observations and experience) Induction plays a very important role in our knowledge about the world and nature Practically all modern information (scientific and practical) is based on inductive reasoning Past experience is used as the basis for generalizations about future experience Induction in natural sciences cannot be absolute, because it is based on a very large but finite number of observations and experiments We know that in the process of the evolution of such sciences as physics or biology, all the fundamental laws from time to time have been revised For example, Newton s gravitational law gave way to Einstein s general relativity theory Mathematics is probably the most striking example of a deductive science; nevertheless the inductive hypothesis and inductive experiments are essential for mathematics in exactly the same way as for other natural sciences The role of induction in mathematics is especially important today, when we have such powerful computing instruments for experiments with the equations and numbers Several examples of induction in mathematics and evolution of the induction hypotheses follow Example 1 Since the medieval centuries mathematicians have sought to find a formula f (n) producing nothing but primes for all n n 0 For example, the formula f (n) = n + n + 41, n 0 gives primes for n = 0 (f (0) = 41), n = 1 (f (1) = 43), n = (f () = 47),, and n = 39(f (39) = 101) All these values are prime But for n = 40 we have f (40) = = = 41, which is a composite number Euler proved that no polynomial formula f (n) = a k n k + a k 1 n k a 0 with integer coefficients a k, a k 1,, a 0 can produce only primes for all n n 0 Example In the 1th century, Italian mathematician Tartaglia claimed that f (n) = n 1 gives primes for all odd n His claim was based, of course, on the following observations: n = 3, 3 1 = f (3) = 7 (prime), n = 5, 5 1 = f (5) = 31 (prime), n = 7, 7 1 = f (7) = 17 (prime) His inductive analysis was very limited In fact, the next odd n = 9 gives f (9) = 9 1 = 511 = 7 73 (composite) 1

2 It is not difficult to show that for an arbitrary composite number n = n 1 n, 1 < n 1, n < n, the number n 1 = n 1n 1 = ( n 1 ) n 1 is composite In fact for all real x we can check that ie, for x = n 1 This means that if the number (x n 1) = (x 1) ( x n 1 + x n + + x + 1 ) ( n 1 ) n 1 = ( n 1 1) (( n 1 ) n n 1 + 1) n 1 = f (n) is prime, the exponent n must be prime This observation goes to the French mathematician of the 17th century Mersenne He claimed first that for all prime P, the number ( P 1 ) also is prime, but recognized shortly that it is not always true It is true for p =, 3, 5, 7 but 11 1 = 047 = 3 89 However, there are many primes of the form ( P 1 ) They are known as Mersenne primes The largest known primes are the Mersenne primes There are special algorithms to recognize Mersenne primes and there are interesting ways to use them in number theory and algebra It is not known yet whether there is an infinite number of Mersenne primes Example 3 (Moser s problem) The following problem arises in combinatorial geometry Let S denote the unit circle in the plane and let A 1,, A n be points on its boundary Let s connect each pair of the points A i, A j by the chords [A i, A j ] and assume that all the points of intersection inside the circle are distinct (that is, no three chords intersect at one point) These chords divide the circular region into N = N (n) parts: n segments along the boundary of S and convex polygons (including triangles) inside S Prove that number N = N (n) does not depend on the locations of the points A i and find it (for all n = 1,, ) We start by gathering experimental data Let s consider small values of n: n = 1, no chords N (1) = 1 n =, one chord N () = n = 3, one triangle N (3) = 4 and three segments

3 n = 4, four segments N (4) = 5 and four triangles n = 5, 5 segments, 1 pentagon, 10 triangles N (5) = 1 Our observations (for n = 1,, 5) correspond to the conjecture N (n) = n 1, n 1 This is a typical example of the incomplete induction Our conjecture was based on the finite number of particular cases This conjecture (as many other similar ones) is wrong: for n = we have N () = 31, not 3 See the following picture It is possible to prove that the correct formula for N is given by N = N (n) = 1 + n (n 1) + n (n 1) (n ) (n 3) Example 4 Let 1, 3, 5, be the sequence of positive, odd integers A formula for the general term a n, n = 1,, has a form Our goal is to find the sum a n = n 1 S n = a 1 + a + + a n = (n 1) Because S 1 = a 1 = 1 S = a 1 + a = = 4 = S 3 = a 1 + a + a 3 = = 9 = 3 and S 4 = = 1 = 4,it makes sense to guess that S n = n We didn t prove this result mathematically It was only an inductive hypothesis based on the finite number of observations : n = 1,, 3, 4 Our induction is incomplete How can we check S n = n for all n = 1,,? There exists a special method, so-called mathematical induction, to prove the theorems of the form such-and-such is true for all positive integers, n Sometimes it is useful to formalize this by letting P (n) denote the statement about n Then the proposition becomes P (n) holds for all n = 1,, Examples of propositions, depending on the positive integer n, n = 1,, are P 1 (n): S n = (n 1) = n }{{} n terms P (n): S n = n 3 = (1 + + n) 3

4 P 3 (n): For all non-negative real numbers x 1, x, x n x 1 + x + + x n n n x 1 x x n P 4 (n) : f (n) = n 3 n is divisible by 5 for n 1 Every proof by mathematical induction contains two steps Step 1 (Basis of induction) Show that P (1) is true Step Show that the truth of P (n) for arbitrary n 1 implies the truth of P (n + 1) The statement, P (n) is true is called the inductive hypothesis We have to deduce the truth of P (n + 1) from the truth of P (n) P (1) is true, according to Step 1 But then Step implies that P () is true, then Step again implies that P (3) is true, etc Sometimes one can use mathematical induction in a slightly different form The form below is called strong induction by some authors Step 1 (Basis of induction) Show that proposition P (n) is true for initial value of n; say n 0, and n n 0 Step Show that P (n + 1) is true if all P (k), n 0 k n are true Then the principle of mathematical induction gives the truth of P (n), n n 0 Example 4 (continued) We have to prove the proposition P (n) : S n = (n 1) = n, }{{} n terms for all n 1 We will use the method of mathematical induction Step 1 (Basis of induction) For n = 1, S 1 = 1 = 1, ie P (1) is true As usual, the first step is simple Step Suppose, that for some n 1 our proposition P (n) is true, ie S n = (n 1) = n (inductive hypothesis) We have to deduce from this fact the truth of P (n + 1): S n+1 = (n 1) + (n + 1) = (n + 1) But notice that the right side of the induction hypothesis equation and the right side of the equation P (n + 1) differ in just one term, namely n + 1 Thus S n+1 = S n + (n + 1) = n + n + 1 = (n + 1) 4

5 Example 5 Let S n = n denote the sum of the first n terms for the series of natural numbers Using mathematical induction, prove that S n = n = n (n + 1) As a matter of fact, we can deduce the solution of this problem from Example 4 We have That is (n 1) = n ( 1 1) + ( 1) + ( n 1) = n ( n) ( ) }{{} n times = ( n) n n = ( n) n = n + n = ( n) = n = Example Let us try to find the following sum n (n + 1) S n = n 3 for all n 1 We start with numerical experiments and attempt to guess the answer S 1 = 1 3 = 1 = 1 S = = 9 = 3 S 3 = = 3 = S 4 = = = 100 = 10 But 1 = 1, 3 = 1 +, = , 10 = and we can formulate the hypothesis P (n): for all n 1, [ ] n (n + 1) S n = n 3 = ( n) = Let s try to prove this proposition using mathematical induction Step 1 (Basis of induction) This step is trivial Step Suppose, that [ ] n (n + 1) S n = n 3 = 5

6 then S n+1 = n 3 + (n + 1) 3 = S n + (n + 1) 3 = n (n+1) + (n + 1) 3 = 4 (n + 1) [ n + (n + 4 1)] = (n+1) (n + 4n + 4) = (n+1) (n+), and we are done Be 4 4 sure you understand why Examples 4 through represent the typical application of mathematical induction to summation problems If the sequence a n, n 1 is given by the formula and we expect that a n = f (n), n = 1,, S n = a 1 + a + + a n = F (n), n = 1,, where F (n) is given by another formula, then one can prove the last fact using the same procedure The key moment (step ) is the transition from n to n + 1 based on the relation S n+1 = a a n + a n+1 = S n + a n+1, that is, F (n + 1) = F (n) + a n+1 To find the appropriate expression for F (n) we have to use completely different ideas In many cases the formula for F (n) is simply known from the very beginning Different kinds of applications of the mathematical induction give the divisibility problems The following problem is typical Example 7 Prove that the integer f (n) = 4 n + 15n 1 is divisible by 9 for all n 1 Proof by mathematical induction: Step 1 (Basis of induction) We have for n = 1 f (1) = = 18 = 9 Thus P (1) is true Step Suppose, that f (n) = 4 n + 15n 1 is divisible by 9 (inductive hypothesis) We must prove that the last statement implies the divisibility of f (n + 1) by 9 But f (n + 1) = 4 n (n + 1) 1 = 4 4 n + 15n = = 4 4 n n 3 15n }{{} + 4 } {{ 4 } +14 = = 4 (4 n + 15n 1) 45n + 18 = 4f (n) 45n + 18 The first form is divisible by 9 according to inductive hypothesis, the last two have a form 45n + 18 = 9 ( 5n + ), that is, they are always divisible by 9 The theorem is proved by the principle of mathematical induction

7 The central moment here is the representation of f (n + 1) in the recursive form: f (n + 1) = αf (n) + R (n) where R (n) is divisible by g identically and f (n) is divisible by g due to inductive hypothesis Similar ideas work in all divisibility problems Appendix Summation of the polynomial sequences One of the important applications of mathematical induction is the proof of different general formulas for the summation of series Such formulas are useful in the calculus and numerical analysis Lecture 3 contained the following formulas: S n = (n 1) = n, n(n + 1) S n = n =, [ ] n(n + 1) S n = n 3 = The common feature of these three examples is that the general term a n in the sum S n = a 1 ++a n is a polynomial function of the index n For the first series it is f 1 (x) = x 1, a n = f 1 (n) = n 1, for the second one f (x) = x, a n = f (n) = n, at last for the third example, f 3 (x) = x 3, f 3 (n) = a n = n 3 One can also observe that the sum S n in all three cases is the polynomial function of n and its degree is equal to degree of the general term plus 1! Say, n(n + 1) = 1 n + 1 n [ ] n(n + 1) = 1 4 n4 + 1 n n We can now formulate (without proof) the following recipe Suppose, that a n = c m n m + c m 1 n m c 1 n + c 0 is the general term of the sequence a 1, a,, a n, This term is a polynomial function of the fixed degree m from the argument (index) n Then S n = a a n = d m+1 n m+1 + d m n m + + d 1 n m is the polynomial function of the degree m + 1 from the argument (index) n To find coefficients d m+1,, d 1, it is sufficient to solve the following system of linear equations (for m + 1 variables d m+1,, d 1 ) : 7

8 n = 1 S 1 = d m d 1 n = S = d m+1 m+1 + d m m + + d 1 n = 3 S 3 = d m+1 3 m+1 + d m 3 m + + 3d 1 n = m + 1 S m+1 = d m+1 (m + 1) m+1 + (m + 1)d 1 When we find coefficients d m+1,, d 1 it will be possible to prove the formula for S n using mathematical induction We used the hypothesis from the recipe only to design the answer, but a known answer can be checked by mathematical induction Example 9 Find the sum of the squares for the first n natural numbers, ie find the sum S n = n Solution The general term a n = n is a polynomial of degree We can try to find S n in the form (notation for coefficients are different!) S n = an 3 + bn + cn But S 1 = 1 = 1, S = 1 + = 5, S 3 = = 14 For the coefficients 1 = a + b + c 1 = a + b + c a, b, c we have the system: 5 = 8a + 4b + c 3 = a + b (Elimination of 14 = 7a + 9b + 3c 11 = 4a + b 1 = a + b + c c from the second and third equations) 3 = a + b (elimination of b from the third equation = a Then, a = 1 3, b = 1, c = 1 that is, the hypothetical formula for S n has a form S n = 1 3 n3 + 1 n + 1 n = n = n [ n + n + n + 1 ] = [ n + 3n + 1 ] = n(n + 1)(n + 1) Now we ll prove this formula by mathematical induction The basis step is trivial: Suppose (inductive hypothesis) that 1 = S 1 = 1 3 S n = n(n + 1)(n + 1) 8

9 Then S n+1 = S n + (n + 1) n(n + 1)(n + 1) = + (n + 1) = = (n + 1) (n + 1) [ [n(n + 1) + (n + 1)] = n + 7n + ] = (n + 1) [ n + 4n + 3n + ] (n + 1)(n + )(n + 3) = = = (n + 1)((n + 1) + 1)((n + 1) + 1) Formula for S n+1 has exactly the same form as for S n but with replacement of n by (n + 1) Induction step is done, theorem is proved 9

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### 13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

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

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

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

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

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

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

### Sample Induction Proofs

Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given

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

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

### Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

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

### Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

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

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

### LEARNING OBJECTIVES FOR THIS CHAPTER

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

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

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

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

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

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

### Trigonometric Functions and Equations

Contents Trigonometric Functions and Equations Lesson 1 Reasoning with Trigonometric Functions Investigations 1 Proving Trigonometric Identities... 271 2 Sum and Difference Identities... 276 3 Extending

### Strictly speaking, all our knowledge outside mathematics consists of conjectures.

1 Strictly speaking, all our knowledge outside mathematics consists of conjectures. There are, of course, conjectures and conjectures. There are highly respectable and reliable conjectures as those expressed

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

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

### Introduction to Proofs

Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are

### MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

### Infinite Algebra 1 supports the teaching of the Common Core State Standards listed below.

Infinite Algebra 1 Kuta Software LLC Common Core Alignment Software version 2.05 Last revised July 2015 Infinite Algebra 1 supports the teaching of the Common Core State Standards listed below. High School

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

### CS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers

CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)

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

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

### Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

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

### SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

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

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

### Real Numbers and Monotone Sequences

Real Numbers and Monotone Sequences. Introduction. Real numbers. Mathematical analysis depends on the properties of the set R of real numbers, so we should begin by saying something about it. There are

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

### 4.2 Euclid s Classification of Pythagorean Triples

178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple

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

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

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

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

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

### with functions, expressions and equations which follow in units 3 and 4.

Grade 8 Overview View unit yearlong overview here The unit design was created in line with the areas of focus for grade 8 Mathematics as identified by the Common Core State Standards and the PARCC Model

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

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

### a = bq + r where 0 r < b.

Lecture 5: Euclid s algorithm Introduction The fundamental arithmetic operations are addition, subtraction, multiplication and division. But there is a fifth operation which I would argue is just as fundamental

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

### Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

### Our goal first will be to define a product measure on A 1 A 2.

1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ -algebra A 1 A 2 with the unit element is the σ -algebra generated by the

### Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

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

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

### Basic Terminology for Systems of Equations in a Nutshell. E. L. Lady. 3x 1 7x 2 +4x 3 =0 5x 1 +8x 2 12x 3 =0.

Basic Terminology for Systems of Equations in a Nutshell E L Lady A system of linear equations is something like the following: x 7x +4x =0 5x +8x x = Note that the number of equations is not required

### Thinkwell s Homeschool Algebra 2 Course Lesson Plan: 34 weeks

Thinkwell s Homeschool Algebra 2 Course Lesson Plan: 34 weeks Welcome to Thinkwell s Homeschool Algebra 2! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson

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

### Sequence of Mathematics Courses

Sequence of ematics Courses Where do I begin? Associates Degree and Non-transferable Courses (For math course below pre-algebra, see the Learning Skills section of the catalog) MATH M09 PRE-ALGEBRA 3 UNITS

### Pick s Theorem. Tom Davis Oct 27, 2003

Part I Examples Pick s Theorem Tom Davis tomrdavis@earthlink.net Oct 27, 2003 Pick s Theorem provides a method to calculate the area of simple polygons whose vertices lie on lattice points points with

### alternate interior angles

alternate interior angles two non-adjacent angles that lie on the opposite sides of a transversal between two lines that the transversal intersects (a description of the location of the angles); alternate

### Geometry Chapter 2: Geometric Reasoning Lesson 1: Using Inductive Reasoning to Make Conjectures Inductive Reasoning:

Geometry Chapter 2: Geometric Reasoning Lesson 1: Using Inductive Reasoning to Make Conjectures Inductive Reasoning: Conjecture: Advantages: can draw conclusions from limited information helps us to organize

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

### Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,

### Just the Factors, Ma am

1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive

### Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON

Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON John Burkardt Information Technology Department Virginia Tech http://people.sc.fsu.edu/ jburkardt/presentations/cg lab fem basis tetrahedron.pdf

### Prentice Hall: Middle School Math, Course 1 2002 Correlated to: New York Mathematics Learning Standards (Intermediate)

New York Mathematics Learning Standards (Intermediate) Mathematical Reasoning Key Idea: Students use MATHEMATICAL REASONING to analyze mathematical situations, make conjectures, gather evidence, and construct

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

### Reasoning and Proof Review Questions

www.ck12.org 1 Reasoning and Proof Review Questions Inductive Reasoning from Patterns 1. What is the next term in the pattern: 1, 4, 9, 16, 25, 36, 49...? (a) 81 (b) 64 (c) 121 (d) 56 2. What is the next

### 1 Review of complex numbers

1 Review of complex numbers 1.1 Complex numbers: algebra The set C of complex numbers is formed by adding a square root i of 1 to the set of real numbers: i = 1. Every complex number can be written uniquely

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

### SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

### 2. THE x-y PLANE 7 C7

2. THE x-y PLANE 2.1. The Real Line When we plot quantities on a graph we can plot not only integer values like 1, 2 and 3 but also fractions, like 3½ or 4¾. In fact we can, in principle, plot any real

### Vieta s Formulas and the Identity Theorem

Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion

### Students will understand 1. use numerical bases and the laws of exponents

Grade 8 Expressions and Equations Essential Questions: 1. How do you use patterns to understand mathematics and model situations? 2. What is algebra? 3. How are the horizontal and vertical axes related?

### Mathematical induction. Niloufar Shafiei

Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of

### Incenter Circumcenter

TRIANGLE: Centers: Incenter Incenter is the center of the inscribed circle (incircle) of the triangle, it is the point of intersection of the angle bisectors of the triangle. The radius of incircle is

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

### Factorizations: Searching for Factor Strings

" 1 Factorizations: Searching for Factor Strings Some numbers can be written as the product of several different pairs of factors. For example, can be written as 1, 0,, 0, and. It is also possible to write