MTH 3318 Solutions to Induction Problems Fall 2009

Size: px
Start display at page:

Download "MTH 3318 Solutions to Induction Problems Fall 2009"

Transcription

1 Pat Rossi Instructions. MTH 338 Solutions to Induction Problems Fall 009 Name Prove the following by mathematical induction. Set (): n n(n+) i n(n+) Step #: Show that the proposition is true for n. ()(()+) i True. Step #: Assume that the proposition is true for n k, and prove that the proposition is true for n k +. i k(k+) is true for some natural number k, and prove that i (k+)((k+)+) is true. (Equivalently, prove that i k +3k+.) P k+ i k (k +) i +(k +) +(k +) k +k + k+ k +3k+. i.e., i k +3k+. i n(n+) for all natural numbers, n. k(k+) + (k+) Set (): Given that x + x x + x (the Triangle Inequality); Prove by induction that: x + x + x x n x + x + x x n (the General Triangle Inequality). Step #: Show that the proposition is true for n. x x. True. Step #: Assume that the proposition is true for n k, and prove that the proposition is true for n k +. i.e., Assume that x + x + x x k x + x + x x k and show that x + x + x x k + x k+ x + x + x x k + x k+.

2 (x + x + x x k )+x k+ x + x + x x k + x k+ from given x + x + x x k + x k+. by Ind. Hyp. i.e., x + x + x x k + x k+ x + x + x x k + x k+. Hence, x + x + x x n x + x + x x n for all natural numbers, n. Set (5): ( + x) n +nx for any natural number n and any real number x. ( + x) +x +()x. Assume true for n k, and show true for n k + i.e., Assume that ( + x) k +kx for some natural number k, and show that ( + x) k+ +(k +)x ( + x) k+ (+x) k ( + x) ( + kx)(+x) +(k +)x + kx {z} kx 0 i.e., ( + x) k+ +(k +)x +(k +)x +kx + x + kx Hence, ( + x) n +nx for all natural numbers n and any real number x Remark Our proof hinged on two subtle points: First, since k is a natural number (hence greater than zero) and x 0 for ALL real numbers x, it follows that kx 0. Second, since it is given that x (or equivalently, ( + x) 0), the direction of the inequality, ( + x) k +kx, is preserved when both sides are multiplied by ( + x) during the application of the induction hypothesis.

3 Set (6): For 0 a b; prove that a n b n.. a a b given i.e., a b b. Assume true for n k, and show true for n k + i.e., Assume that a k b k for some natural number k, and show that a k+ b k+ a k+ a k a i.e., a k+ b k+ b k a by Ind. Hyp. b k b {z} a b Hence, a n b n for all natural numbers, n. b k+ Set (7): (n ) n (i ) n (i ) ( () )(). Assume true for n k, and show true for n k + (i ) k for some natural number k, and show that (i ) (k +) (i ) + ( (k +) ) k +((k +) ) (i ) k +k +(k +) i.e., (i ) (k +) (i ) n for all natural numbers, n. 3

4 Set (): n 3 n (n+) i3 n (n+) i3 () 3 () (()+). Assume true for n k, and show true for n k + i3 k (k+) for some natural number k, and show that i3 (k+) ((k+)+) i.e., i3 (k+) (k+) i3 i 3 +(k +) 3 k (k +) +(k +) 3 (k+) [k +(k +)] (k+) [k +k +] (k+) (k+) i.e., P n i3 n (n+) for all natural numbers, n. Set (7): (n )(n+) j (j )(j+) n n+ j n n+ (() )(()+) ()(3) 3 ()+. Assume true for n k, and show true for n k + j show that j i.e., j (j )(j+) k+ (k+)+ k+ (j )(j+) k+3 k (j )(j+) k+ k (k+) + (k+)3 for some natural number k, and

5 j i.e., j j P k (j )(j+) j k+ (j )(j+) k+3 (j )(j+) + (j )(j+) ((k+) )((k+)+) k k+ + (k+)(k+3) k k+ k+3 k+3 + (k+)(k+3) (k+)(k+) (k+)(k+3) (k+) (k+3) n n+ () k +3k+ (k+)(k+3) for all natural numbers, n. Set (): (n ) 3 < n < n 3 for all natural numbers, n. (i )3 < n < P n i3 (i )3 (() ) 3 0< < 3 i3. Assume true for n k, and show true for n k + (i )3 < k < P k i3 for some natural number k, and show that (i )3 < (k+) < i3 (i )3 (i ) 3 + k 3 < k + k3 k + k3 k +k 3 < k +k 3 +6k +k+ (k+) i.e., (i )3 < (k+) Next i3 i 3 +(k +) 3 > k +(k +)3 k + (k+)3 k +k 3 +k +k+ > k +k 3 +6k +k+ (k+) i.e., i3 > (k+) 5

6 (i )3 < n < P n i3 for all natural numbers, n. 6

Problem Set 5 Solutions

Problem Set 5 Solutions Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true

More information

Mathematical Induction Assignments

Mathematical Induction Assignments 1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +

More information

Discrete Mathematics. Spring 2017

Discrete Mathematics. Spring 2017 Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder

More information

Discrete Math, Spring Solutions to Problems V

Discrete Math, Spring Solutions to Problems V Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose

More information

Math 283 Spring 2013 Presentation Problems 4 Solutions

Math 283 Spring 2013 Presentation Problems 4 Solutions Math 83 Spring 013 Presentation Problems 4 Solutions 1. Prove that for all n, n (1 1k ) k n + 1 n. Note that n means (1 1 ) 3 4 + 1 (). n 1 Now, assume that (1 1k ) n n. Consider k n (1 1k ) (1 1n ) n

More information

Section Taylor and Maclaurin Series

Section Taylor and Maclaurin Series Section.0 Taylor and Maclaurin Series Ruipeng Shen Feb 5 Taylor and Maclaurin Series Main Goal: How to find a power series representation for a smooth function us assume that a smooth function has a power

More information

Mathematical Induction Again

Mathematical Induction Again Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 12, 2017 Outline Mathematical Induction Simple POMI Examples

More information

Mathematical Induction Again

Mathematical Induction Again Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 2, 207 Outline Mathematical Induction 2 Simple POMI Examples

More information

2 2 + x =

2 2 + x = Lecture 30: Power series A Power Series is a series of the form c n = c 0 + c 1 x + c x + c 3 x 3 +... where x is a variable, the c n s are constants called the coefficients of the series. n = 1 + x +

More information

CSC 344 Algorithms and Complexity. Proof by Mathematical Induction

CSC 344 Algorithms and Complexity. Proof by Mathematical Induction CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results

More information

Solutions Manual. Selected odd-numbers problems from. Chapter 3. Proof: Introduction to Higher Mathematics. Seventh Edition

Solutions Manual. Selected odd-numbers problems from. Chapter 3. Proof: Introduction to Higher Mathematics. Seventh Edition Solutions Manual Selected odd-numbers problems from Chapter 3 of Proof: Introduction to Higher Mathematics Seventh Edition Warren W. Esty and Norah C. Esty 5 4 3 2 1 2 Section 3.1. Inequalities Chapter

More information

Math 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions

Math 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions Math 4: Principles of Analysis Fall 0 Homework Part B solutions. Let x, y, z R. Use the axioms of the real numbers to prove the following. a) If x + y = x + z then y = z. Solution. By Axiom a), there is

More information

Mathematical Induction

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

More information

Consider an infinite row of dominoes, labeled by 1, 2, 3,, where each domino is standing up. What should one do to knock over all dominoes?

Consider an infinite row of dominoes, labeled by 1, 2, 3,, where each domino is standing up. What should one do to knock over all dominoes? 1 Section 4.1 Mathematical Induction Consider an infinite row of dominoes, labeled by 1,, 3,, where each domino is standing up. What should one do to knock over all dominoes? Principle of Mathematical

More information

Midterm 2 Sample Introduction to Higher Math Fall 2018 Instructor: Linh Truong

Midterm 2 Sample Introduction to Higher Math Fall 2018 Instructor: Linh Truong Midterm Sample Introduction to Higher Math Fall 018 Instructor: Linh Truong Name: Instructions: Print your name in the space above. Show your reasoning. Write complete proofs. You have 75 minutes. No notes,

More information

Climbing an Infinite Ladder

Climbing an Infinite Ladder Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite

More information

THE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM Eng. Huda M.

THE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM Eng. Huda M. THE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM 2011 Eng. Huda M. Dawoud December, 2015 Section 1: Mathematical Induction 3. Let

More information

Mathematical Induction

Mathematical Induction Mathematical Induction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Mathematical Induction Fall 2014 1 / 21 Outline 1 Mathematical Induction 2 Strong Mathematical

More information

MATH ASSIGNMENT 1 - SOLUTIONS September 11, 2006

MATH ASSIGNMENT 1 - SOLUTIONS September 11, 2006 MATH 0-090 ASSIGNMENT - September, 00. Using the Trichotomy Law prove that if a and b are real numbers then one and only one of the following is possible: a < b, a b, or a > b. Since a and b are real numbers

More information

EXAMPLES OF PROOFS BY INDUCTION

EXAMPLES OF PROOFS BY INDUCTION EXAMPLES OF PROOFS BY INDUCTION KEITH CONRAD 1. Introduction In this handout we illustrate proofs by induction from several areas of mathematics: linear algebra, polynomial algebra, and calculus. Becoming

More information

TAYLOR AND MACLAURIN SERIES

TAYLOR AND MACLAURIN SERIES TAYLOR AND MACLAURIN SERIES. Introduction Last time, we were able to represent a certain restricted class of functions as power series. This leads us to the question: can we represent more general functions

More information

C241 Homework Assignment 7

C241 Homework Assignment 7 C24 Homework Assignment 7. Prove that for all whole numbers n, n i 2 = n(n + (2n + The proof is by induction on k with hypothesis H(k i 2 = k(k + (2k + base case: To prove H(, i 2 = = = 2 3 = ( + (2 +

More information

Math 104: Homework 1 solutions

Math 104: Homework 1 solutions Math 10: Homework 1 solutions 1. The basis for induction, P 1, is true, since 1 3 = 1. Now consider the induction step, assuming P n is true and examining P n+1. By making use of the result (1 + +... +

More information

PRINCIPLE OF MATHEMATICAL INDUCTION

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

More information

Math 3338: Probability (Fall 2006)

Math 3338: Probability (Fall 2006) Math 3338: Probability (Fall 2006) Jiwen He Section Number: 10853 http://math.uh.edu/ jiwenhe/math3338fall06.html Probability p.1/8 2.2 Axioms, Interpretations, and Properties of Probability Probability

More information

21 Induction. Tom Lewis. Fall Term Tom Lewis () 21 Induction Fall Term / 14

21 Induction. Tom Lewis. Fall Term Tom Lewis () 21 Induction Fall Term / 14 21 Induction Tom Lewis Fall Term 2010 Tom Lewis () 21 Induction Fall Term 2010 1 / 14 Outline 1 The method of induction 2 Strong mathematical induction Tom Lewis () 21 Induction Fall Term 2010 2 / 14 Pessimists

More information

CISC-102 Fall 2017 Week 3. Principle of Mathematical Induction

CISC-102 Fall 2017 Week 3. Principle of Mathematical Induction Week 3 1 of 17 CISC-102 Fall 2017 Week 3 Principle of Mathematical Induction A proposition is defined as a statement that is either true or false. We will at times make a declarative statement as a proposition

More information

n n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set

n n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set 1 Mathematical Induction We assume that the set Z of integers are well defined, and we are familiar with the addition, subtraction, multiplication, and division. In particular, we assume the following

More information

Note that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.

Note that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction. Proof by mathematical induction using a strong hypothesis Occasionally a proof by mathematical induction is made easier by using a strong hypothesis: To show P(n) [a statement form that depends on variable

More information

1 Take-home exam and final exam study guide

1 Take-home exam and final exam study guide Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number

More information

CSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee

CSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee CSCE 222 Discrete Structures for Computing Sequences and Summations Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sequences 2 Sequences A sequence is a function from a subset of the set of

More information

In case (1) 1 = 0. Then using and from Friday,

In case (1) 1 = 0. Then using and from Friday, Math 316, Intro to Analysis The order of the real numbers. The field axioms are not enough to give R, as an extra credit problem will show. Definition 1. An ordered field F is a field together with a nonempty

More information

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016 Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying

More information

CSE 311: Foundations of Computing. Lecture 14: Induction

CSE 311: Foundations of Computing. Lecture 14: Induction CSE 311: Foundations of Computing Lecture 14: Induction Mathematical Induction Method for proving statements about all natural numbers A new logical inference rule! It only applies over the natural numbers

More information

Climbing an Infinite Ladder

Climbing an Infinite Ladder Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite

More information

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book. THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: January 2011 Analysis I Time Allowed: 1.5 hours Read carefully the instructions on the answer book and make sure that the particulars required are entered

More information

1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples...

1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples... CSE 311: Foundations of Computing I Proof Techniques What Is This? Each of the following is as close as we can get to giving you a template (and a completely worked out example) for every proof technique

More information

Review of Power Series

Review of Power Series Review of Power Series MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Introduction In addition to the techniques we have studied so far, we may use power

More information

Solutions for Homework Assignment 2

Solutions for Homework Assignment 2 Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove

More information

Unit Combinatorics State pigeonhole principle. If k pigeons are assigned to n pigeonholes and n < k then there is at least one pigeonhole containing more than one pigeons. Find the recurrence relation

More information

1 Examples of Weak Induction

1 Examples of Weak Induction More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of

More information

Sequences, their sums and Induction

Sequences, their sums and Induction Sequences, their sums and Induction Example (1) Calculate the 15th term of arithmetic progression, whose initial term is 2 and common differnce is 5. And its n-th term? Find the sum of this sequence from

More information

5 Birkhoff s Ergodic Theorem

5 Birkhoff s Ergodic Theorem 5 Birkhoff s Ergodic Theorem Birkhoff s Ergodic Theorem extends the validity of Kolmogorov s strong law to the class of stationary sequences of random variables. Stationary sequences occur naturally even

More information

Pithy P o i n t s Picked I ' p and Patljr Put By Our P e r i p a tetic Pencil Pusher VOLUME X X X X. Lee Hi^h School Here Friday Ni^ht

Pithy P o i n t s Picked I ' p and Patljr Put By Our P e r i p a tetic Pencil Pusher VOLUME X X X X. Lee Hi^h School Here Friday Ni^ht G G QQ K K Z z U K z q Z 22 x z - z 97 Z x z j K K 33 G - 72 92 33 3% 98 K 924 4 G G K 2 G x G K 2 z K j x x 2 G Z 22 j K K x q j - K 72 G 43-2 2 G G z G - -G G U q - z q - G x) z q 3 26 7 x Zz - G U-

More information

Appendix G: Mathematical Induction

Appendix G: Mathematical Induction Appendix G: 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

More information

Orthonormal Bases Fall Consider an inner product space V with inner product f, g and norm

Orthonormal Bases Fall Consider an inner product space V with inner product f, g and norm 8.03 Fall 203 Orthonormal Bases Consider an inner product space V with inner product f, g and norm f 2 = f, f Proposition (Continuity) If u n u 0 and v n v 0 as n, then u n u ; u n, v n u, v. Proof. Note

More information

Homework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.

Homework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges. 2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >

More information

MATHEMATICAL INDUCTION

MATHEMATICAL INDUCTION MATHEMATICAL INDUCTION MATH 3A 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

More information

What can you prove by induction?

What can you prove by induction? MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................

More information

MATH10040: Numbers and Functions Homework 1: Solutions

MATH10040: Numbers and Functions Homework 1: Solutions MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3

More information

Outline. We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction

Outline. We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction Outline We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction Induction P(1) ( n 2)[P(n 1) P(n)] ( n 1)[P(n)] Why Does This Work? I P(1) ( n 2)[P(n

More information

CMSC250 Homework 9 Due: Wednesday, December 3, Question: Total Points: Score:

CMSC250 Homework 9 Due: Wednesday, December 3, Question: Total Points: Score: Name & UID: Circle Your Section! 0101 (10am: 3120, Ladan) 0102 (11am: 3120, Ladan) 0103 (Noon: 3120, Peter) 0201 (2pm: 3120, Yi) 0202 (10am: 1121, Vikas) 0203 (11am: 1121, Vikas) 0204 (9am: 2117, Karthik)

More information

Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence)

Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector

More information

Mathematical Induction. Defining Functions. Overview. Notation for recursive functions. Base case Sn(0) = 0 S(n) = S(n 1) + n for n > 0

Mathematical Induction. Defining Functions. Overview. Notation for recursive functions. Base case Sn(0) = 0 S(n) = S(n 1) + n for n > 0 Readings on induction. Mathematical Induction (a) Weiss, Sec. 7.2, page 233 (b) Course slides f lecture and notes recitation. Every criticism from a good man is of value to me. What you hint at generally

More information

Sums of Squares. Bianca Homberg and Minna Liu

Sums of Squares. Bianca Homberg and Minna Liu Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares

More information

MTH 3311 Test #1. order 3, linear. The highest order of derivative of y is 2. Furthermore, y and its derivatives are all raised to the

MTH 3311 Test #1. order 3, linear. The highest order of derivative of y is 2. Furthermore, y and its derivatives are all raised to the MTH 3311 Test #1 F 018 Pat Rossi Name Show CLEARLY how you arrive at your answers. 1. Classify the following according to order and linearity. If an equation is not linear, eplain why. (a) y + y y = 4

More information

Seunghee Ye Ma 8: Week 2 Oct 6

Seunghee Ye Ma 8: Week 2 Oct 6 Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means

More information

IB Mathematics HL Year 2 Unit 11: Completion of Algebra (Core Topic 1)

IB Mathematics HL Year 2 Unit 11: Completion of Algebra (Core Topic 1) IB Mathematics HL Year Unit : Completion of Algebra (Core Topic ) Homewor for Unit Ex C:, 3, 4, 7; Ex D: 5, 8, 4; Ex E.: 4, 5, 9, 0, Ex E.3: (a), (b), 3, 7. Now consider these: Lesson 73 Sequences and

More information

7 Mathematical Induction. For the natural numbers N a the following are equivalent:

7 Mathematical Induction. For the natural numbers N a the following are equivalent: 7 Mathematical Induction Definition: N a = {n N n a}. For the natural numbers N a the following are equivalent: 1. Ordinary axiom of induction: IfS N a such that (a) a S (b) n N a (n S n +1 S) then S =

More information

2) Find CS if CI = 6x 2 and IS = x + 3 A) 45 B) 15 C) 22.5 D) ) Find TR if TR = 2x + 17 and JR = 2x + 5 A) 16 B) 8 C) 12 D) 24

2) Find CS if CI = 6x 2 and IS = x + 3 A) 45 B) 15 C) 22.5 D) ) Find TR if TR = 2x + 17 and JR = 2x + 5 A) 16 B) 8 C) 12 D) 24 eometry Assignment : 1 Name ate eriod ach figure shows a triangle with one or more of its medians. 1) ind if = 7x 1 and = 4x + 2) ind if = 6x 2 and = x + 3 A) 13 ) 19. ) 8.67 ) 26 A A) 4 ) 1 ) 22. ) 7.

More information

1. Propositions: Contrapositives and Converses

1. Propositions: Contrapositives and Converses Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement

More information

Geometry Chapter 7 7-4: SPECIAL RIGHT TRIANGLES

Geometry Chapter 7 7-4: SPECIAL RIGHT TRIANGLES Geometry Chapter 7 7-4: SPECIAL RIGHT TRIANGLES Warm-Up Simplify the following. 1.) 10 30 2.) 45 5 3.) 88 8 4.) 3 27 Special Right Triangles Objective: Students will be able to use the relationships amongst

More information

THE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours

THE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours THE 018-019 KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: hours 1 Let m be a three-digit integer with distinct digits Find all such integers

More information

C. Incorrect! This symbol means greater than or equal to or at least. D. Correct! This symbol means at most or less than or equal to.

C. Incorrect! This symbol means greater than or equal to or at least. D. Correct! This symbol means at most or less than or equal to. SAT Math - Problem Drill 10: Inequalities No. 1 of 10 1. Choose the inequality symbol that means at most. (A) > (B) < (C) (D) (E) This symbol means greater than. This symbol means less than. This symbol

More information

Mathematical Fundamentals

Mathematical Fundamentals Mathematical Fundamentals Sets Factorials, Logarithms Recursion Summations, Recurrences Proof Techniques: By Contradiction, Induction Estimation Techniques Data Structures 1 Mathematical Fundamentals Sets

More information

Exercises for Chapter 1

Exercises for Chapter 1 Solution Manual for A First Course in Abstract Algebra, with Applications Third Edition by Joseph J. Rotman Exercises for Chapter. True or false with reasons. (i There is a largest integer in every nonempty

More information

In case (1) 1 = 0. Then using and from the previous lecture,

In case (1) 1 = 0. Then using and from the previous lecture, Math 316, Intro to Analysis The order of the real numbers. The field axioms are not enough to give R, as an extra credit problem will show. Definition 1. An ordered field F is a field together with a nonempty

More information

1 Fourier Integrals on L 2 (R) and L 1 (R).

1 Fourier Integrals on L 2 (R) and L 1 (R). 18.103 Fall 2013 1 Fourier Integrals on L 2 () and L 1 (). The first part of these notes cover 3.5 of AG, without proofs. When we get to things not covered in the book, we will start giving proofs. The

More information

Discrete Structures - CM0246 Mathematical Induction

Discrete Structures - CM0246 Mathematical Induction Discrete Structures - CM0246 Mathematical Induction Andrés Sicard-Ramírez EAFIT University Semester 2014-2 Motivation Example Conjecture a formula for the sum of the first n positive odd integers. Discrete

More information

MA131 - Analysis 1. Workbook 4 Sequences III

MA131 - Analysis 1. Workbook 4 Sequences III MA3 - Analysis Workbook 4 Sequences III Autumn 2004 Contents 2.3 Roots................................. 2.4 Powers................................. 3 2.5 * Application - Factorials *.....................

More information

Review Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which

Review Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)

More information

STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6

STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6 STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES DR. LOMONACO 1. Use the principle of mathematical induction to prove that P (n) : n (n +1)(2n +1), for all integers n 1. Answer: Proof (by weak induction):

More information

Mathematical Induction

Mathematical Induction Mathematical Induction Let s motivate our discussion by considering an example first. What happens when we add the first n positive odd integers? The table below shows what results for the first few values

More information

Sums and Products. a i = a 1. i=1. a i = a i a n. n 1

Sums and Products. a i = a 1. i=1. a i = a i a n. n 1 Sums and Products -27-209 In this section, I ll review the notation for sums and products Addition and multiplication are binary operations: They operate on two numbers at a time If you want to add or

More information

Sum of Squares. Defining Functions. Closed-Form Expression for SQ(n)

Sum of Squares. Defining Functions. Closed-Form Expression for SQ(n) CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 22: Induction Overview Recursion A programming strategy that solves a problem by reducing it to simpler

More information

MAT 544 Problem Set 2 Solutions

MAT 544 Problem Set 2 Solutions MAT 544 Problem Set 2 Solutions Problems. Problem 1 A metric space is separable if it contains a dense subset which is finite or countably infinite. Prove that every totally bounded metric space X is separable.

More information

MIS S BALLS, L.L.A.]

MIS S BALLS, L.L.A.] & N k k QY GN ( x - N N & N & k QY GN x 00 - XX N X ± - - - - ---------------- N N G G N N N Y NG 5 880N GN N X GN x ( G ) 8N ---- N 8 Y 8 - N N ( G () G ( ) (N) N? k [ x-k NNG G G k k N NY Y /( Q G (-)

More information

201-1A5-MT - Mathematics Summer 2015 HOMEWORK 2 Deadline : Sunday, August 30, 2015 at 12 :30.

201-1A5-MT - Mathematics Summer 2015 HOMEWORK 2 Deadline : Sunday, August 30, 2015 at 12 :30. 01-1A5-MT - Mathematics Summer 015 HOMEWORK Deadline : Sunday, August 30, 015 at 1 :30. Instructions : The assignment consists of five questions, each worth 0 points. Only hardcopy submissions of your

More information

Chapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms

Chapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 1 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 2 Section 5.1 3 Section Summary Mathematical Induction Examples of

More information

The Simplest Construction of Expanders

The Simplest Construction of Expanders Spectral Graph Theory Lecture 14 The Simplest Construction of Expanders Daniel A. Spielman October 16, 2009 14.1 Overview I am going to present the simplest construction of expanders that I have been able

More information

M17 MAT25-21 HOMEWORK 6

M17 MAT25-21 HOMEWORK 6 M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute

More information

Math 117: Infinite Sequences

Math 117: Infinite Sequences Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence

More information

Chapter 5: The Integers

Chapter 5: The Integers c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition

More information

Mathematical Foundations -1- Convexity and quasi-convexity. Convex set Convex function Concave function Quasi-concave function Supporting hyperplane

Mathematical Foundations -1- Convexity and quasi-convexity. Convex set Convex function Concave function Quasi-concave function Supporting hyperplane Mathematical Foundations -1- Convexity and quasi-convexity Convex set Convex function Concave function Quasi-concave function Supporting hyperplane Mathematical Foundations -2- Convexity and quasi-convexity

More information

WILLIAM LOWELL PUTNAM MATHEMATICAL COMPETITION. (3k(k + 1) + 1), for n 1.

WILLIAM LOWELL PUTNAM MATHEMATICAL COMPETITION. (3k(k + 1) + 1), for n 1. Problem A1. Find the sum n (3k(k + 1) + 1), for n 1. k=0 The simplest way to solve this problem is to use the fact that the terms of the sum are differences of consecutive cubes: 3k(k + 1) + 1 = 3k 2 +

More information

Midterm Preparation Problems

Midterm Preparation Problems Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then

More information

We want to show P (n) is true for all integers

We want to show P (n) is true for all integers Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to

More information

Mathematical Induction. Section 5.1

Mathematical Induction. Section 5.1 Mathematical Induction Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction

More information

Exercise 2. Prove that [ 1, 1] is the set of all the limit points of ( 1, 1] = {x R : 1 <

Exercise 2. Prove that [ 1, 1] is the set of all the limit points of ( 1, 1] = {x R : 1 < Math 316, Intro to Analysis Limits of functions We are experts at taking limits of sequences as the indexing parameter gets close to infinity. What about limits of functions as the independent variable

More information

Algebraic function fields

Algebraic function fields Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which

More information

i r-s THE MEMPHIS, TENN., SATURDAY. DEGfMBER

i r-s THE MEMPHIS, TENN., SATURDAY. DEGfMBER N k Q2 90 k ( < 5 q v k 3X3 0 2 3 Q :: Y? X k 3 : \ N 2 6 3 N > v N z( > > :}9 [ ( k v >63 < vq 9 > k k x k k v 6> v k XN Y k >> k < v Y X X X NN Y 2083 00 N > N Y Y N 0 \ 9>95 z {Q ]k3 Q k x k k z x X

More information

Carmen s Core Concepts (Math 135)

Carmen s Core Concepts (Math 135) Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 4 1 Principle of Mathematical Induction 2 Example 3 Base Case 4 Inductive Hypothesis 5 Inductive Step When Induction Isn t Enough

More information

Geometric Series and the Ratio and Root Test

Geometric Series and the Ratio and Root Test Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 Geometric Series

More information

! 2 # 1! k 1 # " " 5

! 2 # 1! k 1 #   5 When k, +!! # + + # + F Therefore, () holds when k Thuswemayassumethatk In this case, F k+ F k + F k +! k! k # + +! k! k # +! k + +! k #! k +! k # +! k +!#! k!# +! k +! #! k! # +! k+! k+ # By the Strong

More information

CS1802 Week 11: Algorithms, Sums, Series, Induction

CS1802 Week 11: Algorithms, Sums, Series, Induction CS180 Discrete Structures Recitation Fall 017 Nov 11 - November 17, 017 CS180 Week 11: Algorithms, Sums, Series, Induction 1 Markov chain i. Boston has days which are either sunny or rainy and can be modeled

More information

An idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim

An idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the

More information

Sequences and Summations

Sequences and Summations COMP 182 Algorithmic Thinking Sequences and Summations Luay Nakhleh Computer Science Rice University Chapter 2, Section 4 Reading Material Sequences A sequence is a function from a subset of the set of

More information

Mathematical Induction

Mathematical Induction Mathematical Induction Representation of integers Mathematical Induction Reading (Epp s textbook) 5.1 5.3 1 Representations of Integers Let b be a positive integer greater than 1. Then if n is a positive

More information

M381 Number Theory 2004 Page 1

M381 Number Theory 2004 Page 1 M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +

More information

The converse is clear, since

The converse is clear, since 14. The minimal polynomial For an example of a matrix which cannot be diagonalised, consider the matrix ( ) 0 1 A =. 0 0 The characteristic polynomial is λ 2 = 0 so that the only eigenvalue is λ = 0. The

More information