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

Use mathematical induction to show that \[\frac{1}{{1 \cdot 4}} + \frac{1}{{4 \cdot 7}} + ... + \frac{1}{{\left( {3n - 2} \right)\left( {3n + 1} \right)}} = \frac{n}{{3n + 1}}\] whenever nis a positive integer.

Short Answer

Expert verified

It is shown that\[\frac{1}{{1 \cdot 4}} + \frac{1}{{4 \cdot 7}} + ... + \frac{1}{{\left( {3n - 2} \right)\left( {3n + 1} \right)}} = \frac{n}{{3n + 1}}\]whenever\(n\)is a positive integer.

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

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

01

Principle of Mathematical Induction

Consider the propositional function \(P\left( n \right)\). Consider two actions to prove that\(P\left( n \right)\)evaluates to accurate for all set of positive integers\(n\).

Consider the first basic step is to confirm that\(P\left( 1 \right)\)true.

Consider the inductive step is to demonstrate that for any positive integer k the conditional statement\[P\left( k \right) \to P\left( {k + 1} \right)\]is true.

02

Prove the basis step

Given statement is

\[\frac{1}{{1 \cdot 4}} + \frac{1}{{4 \cdot 7}} + ... + \frac{1}{{\left( {3n - 2} \right) \cdot \left( {3n + 1} \right)}} = \frac{n}{{3n + 1}}\]

In the basis step, we need to prove that\(P\left( 1 \right)\)is true

For finding statement\(P\left( 1 \right)\)substituting\(1\)for\(n\)in the statement

Therefore, the statement\(P\left( 1 \right)\)is:

\[\begin{array}{l}\frac{1}{{1 \cdot 4}} = \frac{1}{{3\left( 1 \right) + 1}}\\\frac{1}{4} = \frac{1}{4}\end{array}\]

Therefore, the statement \(P\left( 1 \right)\) is true this is also known as the basis step of the proof.

03

Prove the Inductive step

In the inductive step, we need to prove that, if\(P\left( k \right)\)is true, then\(P\left( {k + 1} \right)\)is also true.

\(P\left( k \right) \to P\left( {k + 1} \right)\)is true for all positive integers k.

In the inductive hypothesis, we assume that\(P\left( k \right)\)is true for any arbitrary positive integer\(k\).

\[\frac{1}{{1 \cdot 4}} + \frac{1}{{4 \cdot 7}} + ... + \frac{1}{{\left( {3k - 2} \right) \cdot \left( {3k + 1} \right)}} = \frac{k}{{3k + 1}}\] …. (i)

Now we must have to show that\(P\left( {k + 1} \right)\)is also true.

Therefore replacing\(k\)with\(k + 1\)in the statement.

\[\frac{1}{{1 \cdot 4}} + \frac{1}{{4 \cdot 7}} + ... + \frac{1}{{\left( {3\left( {k + 1} \right) - 2} \right) \cdot \left( {3\left( {k + 1} \right) + 1} \right)}} = \frac{{\left( {k + 1} \right)}}{{3\left( {k + 1} \right) + 1}}\]

Now, adding\[\frac{1}{{\left( {3\left( {k + 1} \right) - 2} \right) \cdot \left( {3\left( {k + 1} \right) + 1} \right)}}\]in both sides of the equation (i) or inductive hypothesis.

\[\begin{array}{c}\left\{ \begin{array}{l}\frac{1}{{1 \cdot 4}} + \frac{1}{{4 \cdot 7}} + ... + \frac{1}{{\left( {3k - 2} \right) \cdot \left( {3k + 1} \right)}}\\ + \frac{1}{{\left( {3\left( {k + 1} \right) - 2} \right) \cdot \left( {3\left( {k + 1} \right) + 1} \right)}}\end{array} \right\} = \frac{k}{{3k + 1}} + \frac{1}{{\left( {3\left( {k + 1} \right) - 2} \right) \cdot \left( {3\left( {k + 1} \right) + 1} \right)}}\\ = \frac{k}{{3k + 1}} + \frac{1}{{\left( {3k + 1} \right) \cdot \left( {3k + 4} \right)}}\\ = \frac{{k\left( {3k + 4} \right) + 1}}{{\left( {3k + 1} \right) \cdot \left( {3k + 4} \right)}}\\ = \frac{{3{k^2} + 4k + 1}}{{\left( {3k + 1} \right) \cdot \left( {3k + 4} \right)}}\end{array}\]

Solve further as:

\[\begin{array}{c}\left\{ \begin{array}{l}\frac{1}{{1 \cdot 4}} + \frac{1}{{4 \cdot 7}} + ... + \frac{1}{{\left( {3k - 2} \right) \cdot \left( {3k + 1} \right)}}\\ + \frac{1}{{\left( {3\left( {k + 1} \right) - 2} \right) \cdot \left( {3\left( {k + 1} \right) + 1} \right)}}\end{array} \right\} = \frac{{\left( {3k + 1} \right)\left( {k + 1} \right)}}{{\left( {3k + 1} \right) \cdot \left( {3k + 4} \right)}}\\ = \frac{{\left( {k + 1} \right)}}{{\left( {3k + 4} \right)}}\\ = \frac{{\left( {k + 1} \right)}}{{3\left( {k + 1} \right) + 1}}\end{array}\]

From the above, we can see that\(P\left( {k + 1} \right)\)is also true.

Hence,\(P\left( {k + 1} \right)\)is true under the assumption that\(P\left( k \right)\)is true. This

Completes the inductive step.

Hence it is proved that\[\frac{1}{{1 \cdot 4}} + \frac{1}{{4 \cdot 7}} + ... + \frac{1}{{\left( {3n - 2} \right) \cdot \left( {3n + 1} \right)}} = \frac{n}{{3n + 1}}\]whenever\(n\)is a positive integer.

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

Assume that a chocolate bar consists of n squares arranged in a rectangular pattern. The entire bar, a smaller rectangular piece of the bar, can be broken along a vertical or a horizontal line separating the squares. Assuming that only one piece can be broken at a time, determine how many breaks you must successfully make to break the bar into n separate squares. Use strong induction to prove your answer

Let P (n)be the statement that 12+22+...+n2=n(n+1)(2n+1)/6 for the positive integer n .

a) What is the statement P (1) ?

b) Show that P (1) is true, completing the basic step of

the proof.

c) What is the inductive hypothesis?

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

e) Complete the inductive step, identifying where you

use the inductive hypothesis.

f) Explain why these steps show that this formula is true whenever nis a positive integer.

A stable assignment, defined in the preamble to Exercise 60 in Section 3.1, is called optimal for suitors if no stable assignment exists in which a suitor is paired with a suitee whom this suitor prefers to the person to whom this suitor is paired in this stable assignment. Use strong induction to show that the deferred acceptance algorithm produces a stable assignment that is optimal for suitors.

Prove that 227+272+2(7)n=(1(7)n+1)/4 whenever nis a nonnegative integer

Let a be an integer and d be a positive integer. Show that the integers qand r witha=dq+r and0r<d which were shown to exist in Example 5, are unique.

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