• :00Days
  • :00Hours
  • :00Mins
  • 00Seconds
A new era for learning is coming soonSign up for free
Log In Start studying!

Select your language

Suggested languages for you:
Answers without the blur. Sign up and see all textbooks for free! Illustration

Q13E

Expert-verified
Discrete Mathematics and its Applications
Found in: Page 330
Discrete Mathematics and its Applications

Discrete Mathematics and its Applications

Book edition 7th
Author(s) Kenneth H. Rosen
Pages 808 pages
ISBN 9780073383095

Answers without the blur.

Just sign up for free and you're in.

Illustration

Short Answer

Prove that 1222+32+(1)n1n2=(1)n(n+1)2 whenever n is a positive integer.

It is proved that 1222+32+(1)n1n2=(1)n1n(n+1)2 .

See the step by step solution

Step by Step Solution

Step 1: Mathematical Induction

The principle of mathematical induction is to prove that P(n) is true for all positive integer n in two steps.

1. Basic step : To verify that P(1) is true.

2. Inductive step : To prove the conditional statement if P(k) is true then P(k+1) is true.

Step 2: Proof by induction

Let P(n) be the statement 1222+32+(1)n1n2=(1)n1n(n+1)2 . Let us prove by induction on n.

Base Case:

For n = 1 , the value of LHS is 1 and RHS is 1. Since, both are equal the statement is true for P(1) .

Induction Case:

Assume that the statement is true for P(k) then prove for P(k+1) .

Let P(k) be true then 1222+32+(1)k1k2=(1)k1k(k+1)2 . Let us prove the statement is true for as follows:

1222+32+(1)k1k2+(1)k(k+1)2=(1)k1k(k+1)2+(1)k(k+1)2=(1)k1k(k+1)+2(1)k(k+1)22=(1)k(k+1)[(1)k+2(k+1)]2=(1)k(k+1)[k+2k+2]2

Further, simplify the values as follows:

1222+32+(1)k1k2+(1)k(k+1)2=(1)k(k+1)[k+2k+2]2=(1)k(k+1)[k+2]2=(1)(k+1)1(k+1)((k+1)+1)2

Thus, P(k+1) is also true.

Therefore, the statement P(n) is true for every positive integer n.

Recommended explanations on Math Textbooks

94% of StudySmarter users get better grades.

Sign up for free
94% of StudySmarter users get better grades.