Scribd
Upload
114 views6 pages

Mathematical Induction PDF

This document discusses mathematical induction. It explains that mathematical induction is used to prove statements about discrete objects like algorithms, programs, graphs, trees, and identities. It also outlines the principle of mathematical induction, which involves proving a base case and an inductive step to show a statement is true for all positive integers. An example is provided to demonstrate how to use mathematical induction to prove three different summation formulas.

Uploaded by

GAEA FAYE MORTERA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
114 views6 pages

Mathematical Induction PDF

This document discusses mathematical induction. It explains that mathematical induction is used to prove statements about discrete objects like algorithms, programs, graphs, trees, and identities. It also outlines the principle of mathematical induction, which involves proving a base case and an inductive step to show a statement is true for all positive integers. An example is provided to demonstrate how to use mathematical induction to prove three different summation formulas.

Uploaded by

GAEA FAYE MORTERA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Mathematical Induction

Discrete Structures 1
Lecture 6

Discrete Mathematics and Its Applications by


em.parac@gmail.com Kenneth H. Rosen 1
Applications of Mathematical Induction

 Mathematical induction is used extensively to


prove results about a large variety of discrete
objects.
 For example, it is used to prove results about
the complexity of algorithms, the correctness
of certain types of computer programs,
theorems about graphs and trees, as well as
a wide range of identities and inequalities.

Discrete Mathematics and Its Applications by


em.parac@gmail.com Kenneth H. Rosen 2
Principle of Mathematical Induction

 Mathematical induction is used to prove


propositions of the form n P(n), where the
universe of discourse is the set of positive
integers.
 A proof by mathematical induction that P(n) is
true for every positive integer n consists of
two steps:
 BASIS STEP: The proposition P(1) is shown to be
true.
 INDUCTIVE STEP: The implication P(k)P(k+1)
is shown to be true for every positive integer k.
Discrete Mathematics and Its Applications by
em.parac@gmail.com Kenneth H. Rosen 3
Principle of Mathematical Induction

 The statement P(k) for a fixed positive integer


k is called the inductive hypothesis.
 When we complete the two steps of proof by
mathematical induction, we have proved that
P(n) is true for all positive integers n; that is,
we have shown that n P(n) is true.
 Expressed as a rule of inference, this proof
technique can be stated as
 [P(1)  k (P(k)  P(k+1))]  n P(n).
Discrete Mathematics and Its Applications by
em.parac@gmail.com Kenneth H. Rosen 4
 Remark: In a proof by mathematical induction
it is not assumed that P(k) is true for all
positive integers! It is only shown that if it is
assumed that P(k) is true, then P(k+1) is also
true.

Discrete Mathematics and Its Applications by


em.parac@gmail.com Kenneth H. Rosen 5
Example

 Prove by mathematical induction that

A. The sum of the first n positive integers is equal to


n(n+1)/2.

B. The sum of the first n odd positive integers is n2:


1+3+5+…+(2n-1) = n2

C. The sum of the squares of the first n positive integers


is equal to n(n+1)(2n+1)/6:
12+22+32+…+n2 = n(n  1)(2n  1)
6
Discrete Mathematics and Its Applications by
em.parac@gmail.com Kenneth H. Rosen 6

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy