Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

(a) Find the formula for 12+14+18++12n by examining the values of this expression for small values of n.

(b) Prove the formula you conjectured in part (a).

Short Answer

Expert verified

(a)The general formula for the given series is 2n-12n.

(b) The statement P(n) is true for every positive integer n.

Step by step solution

01

Formula for the given series

Consider the given series asf(n)=12+14+18++12n …… (1)

For n = 1 ,121=12 .

For n = 2 ,

12+122=2+122=322=22122

For n = 3 ,

12+122+123=22+2+123=723=23123

Therefore, the general formula for the given series is 2n12n.

02

Proof for the Formula

Let P(n) be the statement 12+14+18++12n=2n12n.

Let us prove by induction on n.

Base Case:

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

Induction Case:

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

Let P(k) be true as 12+14+18++12k=2k12k. Let us prove the statement is true for as follows:

12+14+18++12k+12k+1=2k12k+12k+1=22k12k+1+12k+1=2k+12+12k+1=2k+112k+1

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

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

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Prove that for every positive integer n,

1.2.3+2.3.4++n(n+1)(n+2)=n(n+1)(n+2)(n+3)/4

Let P (n) be the statement that a postage of n cents can be formed using just 3-cent stamps and 5-cent stamps. The parts of this exercise outline a strong induction proof that P (n) is true for n ≥ 8.

a) Show that the statements P (8), P (9), and P (10) are true, completing the basis step of the proof.

b) What is the inductive hypothesis of the proof?

c) What do you need to prove in the inductive step?

d) Complete the inductive step for k ≥ 10.

e) Explain why these steps show that this statement is true whenever n ≥ 8.

Suppose you begin with a pile of n stones and split this pile into n piles of one stone each by successively splitting a pile of stones into two smaller piles. Each time you split a pile of stones into two smaller piles. Each time you split a pile you multiply the number of stones in each of the two smaller piles you form, so that if piles haver and s stones in them, respectively, you compute rs. Show that no matter how you split the piles, the sum of the products computed at each step equals n(n-1)/2.

Prove that the first player has a winning strategy for the game of Chomp, introduced in Example 12 in Section 1.8, if the initial board is two squares wide, that is, a2×n board. [Hint: Use strong induction. The first move of the first player should be to Chomp the cookie in the bottom row at the far right.]

Prove that j=0n(12)j=2n+1+(1)n32n whenever n is a nonnegative integer.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free