In terms of n, 3, 7, 13, 27, 53, 107

  • Thread starter Thread starter ziggie125
  • Start date Start date
  • Tags Tags
    Terms
Click For Summary

Homework Help Overview

The discussion revolves around finding an explicit formula for a sequence defined recursively, with initial terms provided. The sequence is characterized by the relationship cn+1 = (cn + cn-1)/2 for n > 2, and participants are exploring the patterns in the numerators of the terms.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants are attempting to identify a pattern in the numerators of the sequence and are considering various recursive relationships. Some suggest examining sums of powers of 2, while others propose rewriting the terms in relation to a new variable.

Discussion Status

The discussion is ongoing, with several participants offering insights and alternative approaches. There is no explicit consensus, but multiple lines of reasoning are being explored, including the potential for a recursion relation for a new variable.

Contextual Notes

Some participants mention constraints on using previous terms in the recursive formula, which may affect the approaches being considered. Additionally, there is a reference to a general form of a different sequence that may relate to the current problem.

ziggie125
Messages
13
Reaction score
0

Homework Statement



Find the explicit formula c1=1, c2=2, cn+1 = (cn + cn-1)/2 ; n>2


Homework Equations





The Attempt at a Solution



c1 = 1
c2 = 2
c3 = 3/2
c4 = 7/4
c5 = 13/8
c6 = 27/16
c7 = 53/32
c8 = 107/64

I know the bottom term is 2^n-2. I cannot find what the top is. If anyone sees it let me know thx.

Also if you know general form of 1, 1, -1, -1, 1, 1, -1, -1 ...

Thx a lot
 
Physics news on Phys.org
The numerator kind of looks like a_{n+2}=2a_{n}+a_{n+1} to me, so it would be like this:
c4 = (2*2) + 3 = 7
c5 = (2*3) + 7 = 13
c6 = (2*7) + 13 = 27
etc, it only works when n > 2 which seems to fit into what you mentioned as well. Hope that helps a bit!
 
try multplying out explicitly for the first few terms - you should hopefully be able to pick up a pattern in terms of sums of powers of 2
3 = 1+2
7 = 1 +2+2^2
and follow on from there...
 
I was told you cannot use the terms before it in the equation, ie. cn-1*2 + (-1)^n
 
i'm not sure i know what you mean? try this though, write the c_n in term of a new variable a_n, for n>2
c_1 = 1[\tex]<br /> c_2 = 2[\tex]&lt;br /&gt; c_3 = \frac{3}{2} = \frac{a_3}{2}[\tex]&amp;lt;br /&amp;gt; c_4 = \frac{7}{2^2} = \frac{a_4}{2^2}[\tex]&amp;amp;lt;br /&amp;amp;gt; &amp;amp;lt;br /&amp;amp;gt; so you want to find the a_n, with&amp;amp;lt;br /&amp;amp;gt; c_n = \frac{a_n}{2^{n-2}}[\tex]&amp;amp;amp;lt;br /&amp;amp;amp;gt; &amp;amp;amp;lt;br /&amp;amp;amp;gt; how about seeing if you can find a recursion relation for the a_n, using the original... will be similar to what refraction posted, but the form should help lead to a general solution.
 

Similar threads

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