Proof by induction?

Algebra Level 2

Take the series: a a + 1 + ( a a + 1 ) 2 + ( a a + 1 ) 3 + ( a a + 1 ) 4 + . . . + ( a a + 1 ) n \frac{a}{a+1}+(\frac{a}{a+1})^{2}+(\frac{a}{a+1})^{3}+(\frac{a}{a+1})^{4}+...+(\frac{a}{a+1})^{n}

I strongly recommend to solve for the general case. It is not advisable to try to manually compute the next step.

In the series, I want you to replace a with 15, and n with 67. Find what the series is equal to and answer in number with 3 decimals. (Truncated or rounded, shouldn't matter). (Yes, you're supposed to use a calculator here, but it shouldn't be hard if you know the general equation).

To sum it up, you have to solve this equation: 15 16 + ( 15 16 ) 2 + ( 15 16 ) 3 + ( 15 16 ) 4 + . . . + ( 15 16 ) 67 \frac{15}{16}+(\frac{15}{16})^{2}+(\frac{15}{16})^{3}+(\frac{15}{16})^{4}+...+(\frac{15}{16})^{67}


The answer is 14.801.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Chew-Seong Cheong
Jul 15, 2018

Relevant wiki: Geometric Progression Sum

S = a a + 1 + ( a a + 1 ) 2 + ( a a + 1 ) 3 + + ( a a + 1 ) n = k = 1 n ( a a + 1 ) k Let r = a a + 1 = k = 1 n r k = r ( r n 1 r 1 ) A sum of geometric progression = 15 16 × 1 ( 15 16 ) 67 1 15 16 For r = 15 16 and n = 67 14.801 \begin{aligned} S & = \frac a{a+1} + \left(\frac a{a+1}\right)^2 + \left(\frac a{a+1}\right)^3 + \cdots + \left(\frac a{a+1}\right)^n \\ & = \sum_{k=1}^n \left(\frac a{a+1}\right)^k & \small \color{#3D99F6} \text{Let }r = \frac a{a+1} \\ & = \sum_{k=1}^n r^k = r \left(\frac {r^n-1}{r-1}\right) & \small \color{#3D99F6} \text{A sum of geometric progression} \\ & = \frac {15}{16} \times \frac {1-\left(\frac {15}{16}\right)^{67}}{1-\frac {15}{16}} & \small \color{#3D99F6} \text{For }r = \frac {15}{16} \text{ and }n=67 \\ & \approx \boxed{14.801} \end{aligned}

Mads Pasztor
Jul 15, 2018

Let's start by finding the general formular for the series: a a + 1 + ( a a + 1 ) 2 + ( a a + 1 ) 3 + ( a a + 1 ) 4 + . . . + ( a a + 1 ) n \frac{a}{a+1}+(\frac{a}{a+1})^{2}+(\frac{a}{a+1})^{3}+(\frac{a}{a+1})^{4}+...+(\frac{a}{a+1})^{n}

The way we can start is by setting a = 1. a = 1. When we do this, we find a more similar series: 1 2 + 1 4 + 1 8 + 1 16 + . . . + ( 1 2 ) n \frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\frac{1}{16}+...+(\frac{1}{2})^{n} .

This series is equal to 2 n 1 2 n 2 n 1 n 2 n \frac{2^{n}-1}{2^{n}} \Leftrightarrow \frac{2^{n}-1^{n}}{2^{n}}

We may think here that a a + 1 + ( a a + 1 ) 2 + ( a a + 1 ) 3 + ( a a + 1 ) 4 + . . . + ( a a + 1 ) n \frac{a}{a+1}+(\frac{a}{a+1})^{2}+(\frac{a}{a+1})^{3}+(\frac{a}{a+1})^{4}+...+(\frac{a}{a+1})^{n} ) is equal to ( a + 1 ) n a n ( a + 1 ) n \frac{(a+1)^{n}-a^{n}}{(a+1)^{n}}

But before we begin to prove it, let's also test it for a = 2 a = 2

If n = 1 n = 1 then the series will just be 2 3 \frac{2}{3} , but by using ( a + 1 ) n a n ( a + 1 ) n \frac{(a+1)^{n}-a^{n}}{(a+1)^{n}} we will get the result of 1 3 \frac{1}{3} . This is two times smaller.

If n = 2 n = 2 then the series will be 2 3 + ( 2 3 ) 2 \frac{2}{3} + (\frac{2}{3})^{2} . This is equal to 10 9 \frac{10}{9} . However by using ( a + 1 ) n a n ( a + 1 ) n \frac{(a+1)^{n}-a^{n}}{(a+1)^{n}} we get 5 9 \frac{5}{9} which again is two times smaller.

Let's try setting a = 3 a = 3

If n = 1 n = 1 then the series will just be 3 4 \frac{3}{4} , but by using ( a + 1 ) n a n ( a + 1 ) n \frac{(a+1)^{n}-a^{n}}{(a+1)^{n}} we will get the result of 1 4 \frac{1}{4} . This is 3 times smaller.

We can see the general pattern here, that ( a + 1 ) n a n ( a + 1 ) n \frac{(a+1)^{n}-a^{n}}{(a+1)^{n}} should be changed to a ( ( a + 1 ) n a n ) ( a + 1 ) n \frac{a((a+1)^{n}-a^{n})}{(a+1)^{n}} .

So it seems likely that, a a + 1 + ( a a + 1 ) 2 + ( a a + 1 ) 3 + ( a a + 1 ) 4 + . . . + ( a a + 1 ) n \frac{a}{a+1}+(\frac{a}{a+1})^{2}+(\frac{a}{a+1})^{3}+(\frac{a}{a+1})^{4}+...+(\frac{a}{a+1})^{n} = a ( ( a + 1 ) n a n ) ( a + 1 ) n \frac{a((a+1)^{n}-a^{n})}{(a+1)^{n}}

We can prove this by induction, however I'll leave that an exercise to the reader.

When you've proven it, all we need to do is plug in a = 15 a = 15 and n = 67 n = 67 .

Thus we get that, 15 16 + ( 15 16 ) 2 + ( 15 16 ) 3 + ( 15 16 ) 4 + . . . + ( 15 16 ) 67 \frac{15}{16}+(\frac{15}{16})^{2}+(\frac{15}{16})^{3}+(\frac{15}{16})^{4}+...+(\frac{15}{16})^{67} = 15 ( 1 6 67 1 5 67 ) 1 6 67 \frac{15(16^{67}-15^{67})}{16^{67}}

And this is the step, where you'll probably need a calculator. By typing the equation into a calculator you get the result that:

15 ( 1 6 67 1 5 67 ) 1 6 67 = 14.801 \frac{15(16^{67}-15^{67})}{16^{67}} = 14.801

This means, that: 15 16 + ( 15 16 ) 2 + ( 15 16 ) 3 + ( 15 16 ) 4 + . . . + ( 15 16 ) 67 = 14.801 \frac{15}{16}+(\frac{15}{16})^{2}+(\frac{15}{16})^{3}+(\frac{15}{16})^{4}+...+(\frac{15}{16})^{67} = 14.801

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...