Scribd
Upload
33 views

Mathematical Proof Natural Numbers Well-Ordered Direct Proof

The document discusses the concept of mathematical induction. It provides examples to illustrate the two main steps: [1] proving the base case for the first natural number, and [2] proving that if the statement is true for an arbitrary natural number n, it is also true for n+1. The examples include proving 3n-1 is a multiple of 2, and that the sum of odd numbers from 1 to 2n-1 equals n2. The last example proves 7 divides n7 - n(1.5) for any integer n ≥ 1 using mathematical induction.

Uploaded by

Moneto Casagan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33 views

Mathematical Proof Natural Numbers Well-Ordered Direct Proof

The document discusses the concept of mathematical induction. It provides examples to illustrate the two main steps: [1] proving the base case for the first natural number, and [2] proving that if the statement is true for an arbitrary natural number n, it is also true for n+1. The examples include proving 3n-1 is a multiple of 2, and that the sum of odd numbers from 1 to 2n-1 equals n2. The last example proves 7 divides n7 - n(1.5) for any integer n ≥ 1 using mathematical induction.

Uploaded by

Moneto Casagan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Alfred Dion F.

Casagan 11-Hosea 10/12/16

HI!!!..everyone nice to meet you again. And today Im going to talk about
mathematical induction. So first what is mathematical induction?. The answer is
Mathematical induction is a mathematical proof technique, most commonly used to
establish a given statement for all natural numbers, although it can be used to prove
statements about any well-ordered set. It is a form of direct proof, and it is done in two
steps. The first step, known as the base case, is to prove the given statement for the first
natural number. The second step, known as the inductive step, is to prove that the given
statement for any one natural number implies the given statement for the next natural
number. From these two steps, mathematical induction is the rule from which we infer that
the given statement is established for all natural numbers. Mathematical induction can be
informally illustrated by reference to the sequential effect of falling dominoes.

Now that we know what is mathematical induction Im going to give you a series of
examples.

First example:

Example: 3n1 is a multiple of 2

Is that true? Let us find out.

1. Show it is true for n=1

311 = 31 = 2

Yes 2 is a multiple of 2. That was easy.

311 is true 2. Assume it is true for n=k

3k1 is true

(Hang on! How do we know that? We don't!


It is an assumption ... that we treat
as a fact for the rest of this example)
Now, prove that 3k+11 is a multiple of 2

3k+1 is also 33k.And then split 3 into 2 and 1,and each of these are multiples
of 2

Because:

23k is a multiple of 2 (we are multiplying by 2)

3k1 is true (we said that in the assumption above)

So: 3k+11 is true

What weve done her is an example of mathematical induction and we solved it by


following these two steps: the first step, known as the base case, is to prove the
given statement for the first natural number. Second is known as the inductive step,
is to prove that the given statement for any one natural number implies the given
statement for the next natural number.
Next example its NOT hard right??Always remember when you are going to solve
mathematical induction just follow the two steps first the base case and the second
one is the inductive step.

Example: Adding up Odd Numbers

1 + 3 + 5 + ... + (2n1) = n2

1. Show it is true for n=1

1 = 12 is True

2. Assume it is true for n=k

1 + 3 + 5 + ... + (2k1) = k2 is True


(An assumption!)

Now, prove it is true for "k+1"

1 + 3 + 5 + ... + (2k1) + (2(k+1)1) = (k+1)2 ?

We know that 1 + 3 + 5 + ... + (2k1) = k2 (the assumption above), so we can do


a replacement for all but the last term:

k2 + (2(k+1)1) = (k+1)2

Now expand all terms:

k2 + 2k + 2 1 = k2 + 2k+1

And simplify:

k2 + 2k + 1 = k2 + 2k + 1

They are the same! So it is true. So:

1 + 3 + 5 + + (2(k+1)1) = (k+1)2 is True


Tricks

I said before that we often need to use imaginative tricks.

A common trick is to rewrite the n=k+1 case into 2 parts:

one part being the n=k case (which is assumed to be true)


the other part can then be checked to see if it is also true

Now for the last example its going to be a bit DIFFICULT so better be ready guys.

EXAMPLE 5: Prove that


7 | n 7 n (1.5) for any integer n 1

Proof:
STEP 1: For n=1 (1.5) is true, since 7 | 1 7 1.

STEP 2: Suppose (1.5) is true for some n = k 1, that is 7 | k 7 k

STEP 3: Prove that (1.5) is true for n = k + 1, that is 7 | (k + 1)7 (k + 1). We


have (k + 1)7 (k + 1) = k 7 + 7k 6 + 21k 5 + 35k 4 + 35k 3 + 21k 2 + 7k + 1
k 1 = k 7 k | {z } St. 2 div. by 7 + 7k 6 + 21k 5 + 35k 4 + 35k 3 + 21k 2 +
7k | {z } div. by 7

I know that this is a little bit complicated that cant further elaborate this. I hope
that you understand my simple discussion

THANK YOU!!!<3<3

You might also like