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

Prove that for every positive integer n,

1.2.+2.3.++n(n+1)=n(n+1)(n+2)/3

Short Answer

Expert verified

1.2.+2.3.++n(n+1)=n(n+1)(n+2)/3

Step by step solution

01

Step: 1

Basic step: so, for n=1,

P(1)=1.2=1(1+1)(1+2)32=2

True for n=1.

02

Step: 2

Assume for n=k,

P(k)=1.2k(k+1)=k(k+1)(k+2)3

03

Step: 3

To prove for n=k+1

P(k)=1.2k(k+1)+(k+1)(k+2)=k(k+1)(k+2)3+(k+1)(k+2)=(k+1)(k+2)(k+3)3=(k+1)(k+1)+1(k+1)+23

True for n=k+1.

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

Let P(n) be the statement that n!<nn , where n is an integer greater than 1.

  1. What is the statement P(2)?
  2. Show that P(2) is true, completing the basis step of the proof.
  3. What is the inductive hypothesis?
  4. What do you need to prove in the inductive step?
  5. Complete the inductive step.
  6. Explain why these steps show that this inequality is true whenever n is an integer greater than 1.

LetE(n) be the statement that in a triangulation of a simple polygon with sides, at least one of the triangles in the triangulation has two sides bordering the exterior of the polygon.

a) Explain where a proof using strong induction thatE(n) is true for all integersn4 runs into difficulties.

b) Show that we can prove thatE(n) is true for all integersn4 by proving by strong induction the stronger statementT(n) for all integers n4, which states that in every triangulation of a simple polygon, at least two of the triangles in the triangulation have two sides bordering the exterior of the polygon.

Prove that n27n+12is nonnegative whenever n is an integer with n3

Let P(n)be the statement that when nonintersecting diagonals are drawn inside a convex polygon with sides, at least two vertices of the polygon are not endpoints of any of these diagonals.

a) Show that when we attempt to prove P(n)for all integers n with n3using strong induction, the inductive step does not go through.

b) Show that we can prove that P(n)is true for all integers n withn3 by proving by strong induction the stronger assertion Q(n), for n4, where states that whenever nonintersecting diagonals are drawn inside a convex polygon with sides, at least two nonadjacent vertices are not endpoints of any of these diagonals.

Give a recursive algorithm for finding the minimum of a finite set of integers, making use of the fact that the maximum of n integers is the smaller of the last integer in the list and the minimum of the first n - 1 integers in the list.

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