Use iteration to make an educated guess at an explicit formula

  • Thread starter Thread starter Topgun_68
  • Start date Start date
  • Tags Tags
    Explicit Formula
Click For Summary

Homework Help Overview

The problem involves a recursively defined sequence {en} where e0 = 3 and ek = 4ek-1 + 7 for k ≥ 1. Participants are tasked with using iteration to derive an explicit formula for the sequence.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants share their calculations for the first few terms of the sequence and discuss the nature of the sequence, suggesting it resembles a geometric series. There are inquiries about how to apply the geometric series sum theorem to derive a formula.

Discussion Status

Some participants have provided guidance on the geometric series aspect and suggested corrections to earlier attempts. There is ongoing exploration of the inductive proof process, with participants questioning their steps and seeking clarification on simplifying expressions.

Contextual Notes

Participants express uncertainty about the inductive step in their proofs and the simplification of expressions. There is a recognition of the complexity involved in representing the same equation in different forms.

Topgun_68
Messages
34
Reaction score
0
Homework Statement

The sequence {en} is defined recursively as e0 = 3; ek = 4ek-1 + 7, for all k ≥ 1. Use iteration to make an educated guess at an explicit formula for the sequence.

The attempt at a solution

I spent all day on this one and I'm still lost.

e1 = 4 x e0 + 7
= 4 x 3 + 7 {since e0 = 3}
= 19

e2 = 4 x e1 + 7
= 4 x 19 + 7 {since e1 = 19}
= 83

e3 = 4 x e2 + 7
= 4 x 83 + 7 {since e2 = 83
= 339

I came up with this, and it looks like a geometric sequence, but I can't figure out how to create the formula using the using Theorem 5.2.3 {Sum of a Geometric Sequence}

3 + 42 + 43 + 44 ... 4n+1

Thanks for any guidance!]
 
Physics news on Phys.org
Topgun_68 said:
Homework Statement

The sequence {en} is defined recursively as e0 = 3; ek = 4ek-1 + 7, for all k ≥ 1. Use iteration to make an educated guess at an explicit formula for the sequence.

The attempt at a solution

I spent all day on this one and I'm still lost.

e1 = 4 x e0 + 7
= 4 x 3 + 7 {since e0 = 3}
= 19

e2 = 4 x e1 + 7
= 4 x 19 + 7 {since e1 = 19}
= 83

e3 = 4 x e2 + 7
= 4 x 83 + 7 {since e2 = 83
= 339

I came up with this, and it looks like a geometric sequence, but I can't figure out how to create the formula using the using Theorem 5.2.3 {Sum of a Geometric Sequence}

3 + 42 + 43 + 44 ... 4n+1

Thanks for any guidance!]

Yup, you're on the right track. Remember that the geometric series only begins from ##4^2##, and you have to add that 3 on to any sum you get (the "3" is not part of the geometric series).

What's the sum of n terms of a geometric series that begins like this: ##4^2, 4^3, 4^4,...4^{n+1}##? (that's actually n terms)
 
Would it be (4(n-1)-1) / 3

Can't get superscript & frac to work at the same time :confused:
Curious3141 said:
Yup, you're on the right track. Remember that the geometric series only begins from ##4^2##, and you have to add that 3 on to any sum you get (the "3" is not part of the geometric series).

What's the sum of n terms of a geometric series that begins like this: ##4^2, 4^3, 4^4,...4^{n+1}##? (that's actually n terms)
 
Topgun_68 said:
Would it be (4(n-1)-1) / 3

Can't get superscript & frac to work at the same time :confused:

You're missing a factor of 16 there, and your exponent is off by one). The geometric series starts with ##4^2 = 16##, so its sum to n terms is ##\displaystyle \frac{4^2(4^n-1)}{3}##. All you have to do now is to add 3 to that expression and simplify it to get a neater expression and just verify that the expression works for a few terms. I think you can stop there for the purposes of this question, but to be rigorous, you should prove that expression by induction.
 
Last edited:
Thanks for the help. I simplified it to this:

##\displaystyle \frac{(4^{n+2}-7)}{3}##

I never realized their was so many ways that I could represent the same equation. The next part of my question is to prove it using mathematical induction so I want to make sure I have the simplest formula to do so. Let me know if their is a simpliar formula to prove it but I am working on this now. Thanks again for everyones help!


Curious3141 said:
You're missing a factor of 16 there, and your exponent is off by one). The geometric series starts with ##4^2 = 16##, so its sum to n terms is ##\displaystyle \frac{4^2(4^n-1)}{3}##. All you have to do now is to add 3 to that expression and simplify it to get a neater expression and just verify that the expression works for a few terms. I think you can stop there for the purposes of this question, but to be rigorous, you should prove that expression by induction.
 
Topgun_68 said:
Thanks for the help. I simplified it to this:

##\displaystyle \frac{(4^{n+2}-7)}{3}##

I never realized their was so many ways that I could represent the same equation. The next part of my question is to prove it using mathematical induction so I want to make sure I have the simplest formula to do so. Let me know if their is a simpliar formula to prove it but I am working on this now. Thanks again for everyones help!

That's pretty much the simplest formula, and it's very easy to do the inductive step using that formula.
 
Sorry to bring this post back up, but I'm not finding it so easy to do the inductive step. Can you or someone else let me know what I'm doing wrong.

A: (Basic Step)

Prove for n = 0:

e0= ##\displaystyle \frac{(4^{0+2}-7)}{3}## = 3 (Initital condition)

B: Assume n = k

ek= ##\displaystyle \frac{(4^{k+2}-7)}{3}## for some integer k

C: Prove for n = k+1

e(k+1) = 4e(k+1)-1 + 7

e(k+1) = 4ek + 7

e(k+1) = ##\displaystyle 4 \frac{(4^{k+2}-7)}{(3)}## +7 (replaced k by the Inductive Hypothesis)

##\displaystyle \frac{(4^{k+3}-28)}{(3)}##

I can't seem to get it back to the explicit equation to complete the proof.

Curious3141 said:
That's pretty much the simplest formula, and it's very easy to do the inductive step using that formula.
 
Last edited:
Topgun_68 said:
Sorry to bring this post back up, but I'm not finding it so easy to do the inductive step. Can you or someone else let me know what I'm doing wrong.

A: (Basic Step)

Prove for n = 0:

e0= ##\displaystyle \frac{(4^{0+2}-7)}{3}## = 3 (Initital condition)

B: Assume n = k

ek= ##\displaystyle \frac{(4^{k+2}-7)}{3}## for some integer k

C: Prove for n = k+1

e(k+1) = 4e(k+1)-1 + 7

e(k+1) = 4ek + 7

e(k+1) = ##\displaystyle 4 \frac{(4^{k+2}-7)}{(3)}## +7 (replaced k by the Inductive Hypothesis)

##\displaystyle \frac{(4^{k+3}-28)}{(3)}##

I can't seem to get it back to the explicit equation to complete the proof.

e(k+1) = ##\displaystyle 4 \frac{(4^{k+2}-7)}{3}## +7 (replaced k by the Inductive Hypothesis)

Right up to here. (I removed the brackets around the denominator 3, because you don't have to keep putting them there).

The next line should be ##\displaystyle \frac{4^{k+3}-28}{3} + 7## (you're missing the "plus 7" in yours).

Now express ##7 = \frac{21}{3}##, and sum it into that expression with the same denominator (3). Simplify.
 
Dam, I forgot to drop the +7 down on my notes. Either way I didn't even think to express +7 as

\frac{21}{3} . I keep learning something new every time I post to these forums.

Thanks Everyone!


Curious3141 said:
e(k+1) = ##\displaystyle 4 \frac{(4^{k+2}-7)}{3}## +7 (replaced k by the Inductive Hypothesis)

Right up to here. (I removed the brackets around the denominator 3, because you don't have to keep putting them there).

The next line should be ##\displaystyle \frac{4^{k+3}-28}{3} + 7## (you're missing the "plus 7" in yours).

Now express ##7 = \frac{21}{3}##, and sum it into that expression with the same denominator (3). Simplify.
 
  • #10
Topgun_68 said:
Thanks Everyone!

"Everyone" says "You're welcome". :biggrin:
 
  • #11
Ha, I thought someone else posted in here too, but that was a different thread. Thanks to just you! Everyone else who will learn from this thread thanks you too! :approve:

Curious3141 said:
"Everyone" says "You're welcome". :biggrin:
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
2
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K