Scribd
Upload
18 views13 pages

Present at A Ion On

The document presents information on mathematical induction. It discusses how mathematical induction can be used to prove statements about natural numbers. The method involves two steps: 1) proving the statement is true for the base case, usually n=1; 2) assuming the statement is true for some value n, and using this to prove it is true for n+1. An example is provided to demonstrate how to use mathematical induction to prove the formula for the sum of the first n positive integers.

Uploaded by

hassam320
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views13 pages

Present at A Ion On

The document presents information on mathematical induction. It discusses how mathematical induction can be used to prove statements about natural numbers. The method involves two steps: 1) proving the statement is true for the base case, usually n=1; 2) assuming the statement is true for some value n, and using this to prove it is true for n+1. An example is provided to demonstrate how to use mathematical induction to prove the formula for the sum of the first n positive integers.

Uploaded by

hassam320
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

PRESENTATAI

ON ON
MATHEMATICAL
INDUCTION
GROUP MEMBER
 HASSAM BAIG
 ABDUL SATTAR
 MUHAMMAD REHAN
 FAHAD BAJWA
CONTENTS
 1-INTRODUCTION

 2-HISTORY

 3-DESCRIPTION

 4-EXAMPLES
 Mathematical induction is a method of mathematical proof typically
used to
 establish that a given statement is true of all natural numbers. It is
done by
 proving that the first statement in the infinite sequence of
statements is true
 and then proving that if any one statement in the infinite sequence
of
 statements is true, then so is the next one.
 The method can be extended to prove statements about more
general
 well-founded structures, such as trees; this generalization, known as
 structural induction, is used in mathematical logic and computer
 science. Mathematical induction in this extended sense is closely
related
 to recursion.
 The earliest implicit proof by mathematical induction for
arithmetic sequences was introduced in the al-Fakhri
written by al-Karaji around 1000 AD, who used it to prove
the binomial theorem, Pascal's triangle, and the sum
formula for integral cubes. The sum formula for integral
cubes is the (true) proposition that every integer can be
expressed by the sum of cubed natural numbers. It is a
particular case of what is referred to as Waring's Problem.
His proof was the first to make use of the two basic
components of an inductive proof. First, he notes the
truth of the statement for n = 1. That is, 1 is the sum of a
single cube because 1 = 13. Secondly, he derives the truth
for n = k from that of n = k − 1. For example, when n = 2,
it is true that 2 = 13 + 13. When n = 3, it is true that 3 =
13 + 13 + 13.
 The truth of the statement can be
extrapolated in this way without limit. Of
course, as n grows larger, some of the sums
of 13 can be rewritten as the cubes of other
natural numbers: for example when n=8 then
8 = 23 = [13 × 8]. Of course, this second
component is not explicit since, in some
sense, al-Karaji's argument is in reverse; this
is, he starts from n = 10 and goes down to 1
rather than proceeding upward."
 The simplest and most common form of
mathematical induction proves that a statement
involving a natural number n holds for all values
of n. The proof consists of two steps:

 Basic step:-
  
 The basis (base case): showing that the
statement holds when n is equal to the lowest
value that n is given in the question. Usually, n =
0 or n = 1.
  
 Inductive step:-
  
 The inductive step: showing that if the statement holds for some
n, then the statement also holds when n + 1 is substituted for n.
 The assumption in the inductive step that the statement holds
for some n is called the induction hypothesis.To perform the
inductive step, one assumes the induction hypothesis and then
uses this assumption to prove the statement for n + 1.
  
 The choice between n = 0 and n = 1 in the base case is specific
to the context of the proof: If 0 is considered a natural number,
as is common in the fields of combinatorics and mathematical
logic, then n = 0. If, on the other hand, 1 is taken as the first
natural number, then the base case is given by n = 1.
  
 This method works by first proving the statement is true
for a starting value, and then proving that the process
used to go from one value to the next is valid. If these are
both proven, then any value can be obtained by
performing the process repeatedly. It may be helpful to
think of the domino effect; if one is presented with a long
row of dominoes standing on end, one can be sure that:
  
  
 Another analogy or (example) can be to consider a set of
identical lily pads, all equally spaced in a line across a
pond, with the first and last lily pads adjacent to the two
sides of the pond. If a frog wishes to traverse the pond, it
must:
EXAMPLE:
 Show that for each positive integer n, 1 + 2 + 3 + ... + n = n(n + 1) / 2
 Proof: let S(n) be the statement 1 + 2 + 3 + ... + n = n(n + 1) / 2
 Basis step: S(1) is the statement 1 = 1(1 + 1) / 2. Thus S(1) is true.
 Inductive step: We suppose that S(k) is true and prove that S(k + 1) is
true. Thus, we assume that
 1 + 2 + 3 + ... + k = k(k + 1) / 2
 Put S(k+1)
 1 + 2 + 3 + ... + k + k + 1 = (k + 1)( k + 1 + 1) / 2.
 1 + 2 + 3 + ... + k + k + 1
 = k(k + 1) / 2 + (k + 1)
 = (k + 1)(k / 2 + 1)
 = (k + 1)(k / 2 + 2 / 2)
 = (k + 1)(k + 2) / 2
 = (k + 1)(k + 1 + 1) / 2
 Hence, if S(k) is true, then S(k + 1) is true.
 Therefore, 1 + 2 + 3 + ... + n = n(n + 1) / 2 for each positive integer n.
 There is another proof technique that is
very similar to the principle of
mathematical induction.

 It is called the second method of


mathematical induction.

 It can be used to prove that a


propositional function P(n) is true for any
natural number n.
 The second principle of mathematical
induction:
 show that p(0) is true.
 (Base step).

 Show that if p(0) and p(1) and… p(n),then p(n+1)


is true for any natural number.
 (Inductive step).
 Then p(n) must be true for any natural
numbers.
 Conclusion

 Thus by concluding that by the help of


mathematical induction we can solve many
conplex problems .

You might also like