Scribd
Upload
24 views3 pages

1200 Assignment 3

1. The document proves a mathematical identity using induction. 2. It shows that the identity holds for the base case of n=1. 3. It assumes the identity holds for some integer k, and then shows that adding the next term for k+1 results in the same identity. 4. Therefore, by the principle of mathematical induction, the identity is proven to hold for all positive integers n.

Uploaded by

Bludimir Clawgsburg
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
24 views3 pages

1200 Assignment 3

1. The document proves a mathematical identity using induction. 2. It shows that the identity holds for the base case of n=1. 3. It assumes the identity holds for some integer k, and then shows that adding the next term for k+1 results in the same identity. 4. Therefore, by the principle of mathematical induction, the identity is proven to hold for all positive integers n.

Uploaded by

Bludimir Clawgsburg
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/ 3

MATH 1200 - ASSIGNMENT 3

PAULOS HAILESELASSIE

3. Proof:
Base Case: Let n = 1, then we have
L.H.S:
= (1)(1+1)(1+2)
= (1)(2)(3)
=6

R.H.S
(1)(1+2)(1+2)(1+3) (1)(2)(3)(4)
= 4
= 4
24
= 4
=6
Inductive Hypothesis: Let n=k, where k is some positive integer, let P(k) be the property
that states 1 · 2 · 3 + 2 · 3 · 4 + · · ·k(k + 1)(k + 2) = k(k+2)(k+1)(k+2)(k+3
4
where k is some positive
integer. Lets assume P(k) to be true for some positive integer k
k(k+1)(k+2)(k+3)
1 · 2 · 3 · +2 · 3 · ·4 + · · · + k(k + 1)(k + 2) = 4
Inductive Step: Let n = k + 1 and from the inductive hypothesis; Prove P(k+1),
where P(k+1) is represents the property that states (k + 1)((k + 1) + 1)((k + 1) + 2)
= (k+1)((k+1)+1)((k+1)+2)((k+1)+3)
4
.
from the inductive hypothesis we know the following:
k(k+1)(k+2)(k+3)
1 · 2 · 3 · +2 · 3 · ·4 + · · · + k(k + 1)(k + 2) = 4
So the this equation is telling us that the 1 · 2 · 3 · +2 · 3 · ·4 + · · · + k(k + 1)(k + 2) is equivalent
to or can be represented as k(k+1)(k+2)(k+3)
4
for some positive integer k. In other words we can
write the left hand side of the inductive hypothesis as k(k+1)(k+2)(k+3) 4
.
So the resulting equality with these changes would be:

k(k+1)(k+2)(k+3) k(k+1)(k+2)(k+3)
4
= 4

Date: March 23, 2023.


1
2 PAULOS HAILESELASSIE

Also, from the left side of the inductive hypothesis P(k) is the following:
P(k) = k(k + 1)(k + 2)
this is because the kth term of the summation provided
similarly we can say that from the inductive hypothesis that P(k+1) is represented as
(k + 1)((k + 1) + 1)((k + 1) + 2) which is the result of plugging in k+1 into the value of k.
this will give us P(k+1) or the property that proves the equality for the ”next term” when it
is being added to the P(k) term.
To actually go about solving the this question we need to add the P(k+1) term to the left
side of the equality and simply plug in k = k+1 also known as P(k+1) on the right hand side
and show that L.H.S (left hand side) = R.H.S (right hand side)
So doing this we get:

R.H.S:

(k+1)((k+1)+1)(k+1)+2)((k+1)+3)
= 4
(k+1)(k+2)(k+3)(k+4)
= 4

L.H.S:

k(k+1)(k+2)(k+3)
= 4
+ (k + 1)(k + 2)(k + 3)

By finding a common denominator and adding the terms we get:

k(k+1)(k+2)(k+3) 4(k+1)(k+2)(k+3)
= 4
+ 4

k(k+1)(k+2)(k+3)+4(k+1)(k+2)(k+3)
= 4

by factoring out (k + 1)(k + 2)(k + 3) from the numerator we get:

(k+1)(k+2)(k+3)(k+4)
= 4

= R.H.S

Therefore R.H.S = L.H.S as required


MATH 1200 - ASSIGNMENT 3 3

This equation shows that P(k+1) is true under the assumption that P(k) is true.
So by the extended principle of mathematical induction we know that p(n) is true for all
positive integers n. So we have proven that
n(n+1)(n+2)(n+3)
1 · 2 · 3 · +2 · 3 · ·4 + · · · + n(n + 1)(n + 2) = 4
for all positive integers n.

You might also like