Don't worry about trying to apply a "Fibonacci formula" -- if you can do such a thing, it will be clear what to do when you can do it. Until then, just work the problem.
I'm sort of confused by the rest of your statement. You said you know that the general formula is:
[tex]
t_{n+1} = 1 + \frac{1}{t_n}
[/tex]
So I'm confused when you say you don't know how to get a formula for [itex]t_{n+1}[/itex] in terms of [itex]t_n[/itex].
P.S. if you don't want to use latex, you can use [ code ] tags to format your expressions. e.g.
Well, I think we both agree that it looks like sequence you've been given. Unless you were given that sequence in a rigorous way, we'll have to settle for "looks like".
Wait a sec -- this is a thread on continued fractions. I suppose you mean to look at the continued fraction [1;1, 1, 1, ...], and the [itex]t_n[/itex] are the partial convergents? If so, then take the definition of partial convergences, and see if you can prove they satisfy the recursion you gave!
You can solve for the limit of this series L by setting noting that L=1+1/L. (do you see why?). This should give a familiar result related to the Fibonacci sequence which should give you a clue as to the relation between the nth terms of both series.
Well, if the series converges to a limit, t_{n}and t_{n+1} must get very close to each other (and the limit) as n gets very large, and so you can constrain what this limit may be by letting t_{n}=t_{n+1} and solving the resulting equation. Of course, this doesn't always determine the limit uniquely, nor does it guarantee one exists. But if there is a limit, it must be one of the solutions to this equation. Assuming you know this series does converge, you can get an idea which solution is the correct limit by seeing what the first few terms of the series look like.
It doesn't really mean anything. If you just think of each t_{n} as a number, and that you get the next term in the series by t_{n+1} =1+1/t_{n}, then you don't have to worry about gigagntic mosnter nested fractions. For example, t_{1} =1+1=2, t_{2} =1+1/2=3/2, t_{3} =1+1/(3/2)=1+2/3=5/3, etc. These are the convergents that Hurkyl was talking about before.
I already mentioned one way to find the connection. Another would be to write out the first few terms of the series, as I started in the last post, and see if that gives you any ideas.
Suppose you are right -- that [itex]t_{n+1} = 1 + 1/t_n[/itex] is a correct recursion. If you assume [itex]L = \lim_{n \rightarrow+\infty} t_n[/itex], then what happens if you take the limit of both sides of your recursion?
We Value Quality
• Topics based on mainstream science
• Proper English grammar and spelling We Value Civility
• Positive and compassionate attitudes
• Patience while debating We Value Productivity
• Disciplined to remain on-topic
• Recognition of own weaknesses
• Solo and co-op problem solving