Calculate Limit of Series: Find $\displaystyle\lim_{k\to\infty}\frac{n_k}{d_k}$

  • Context: Graduate 
  • Thread starter Thread starter sennyk
  • Start date Start date
  • Tags Tags
    Limit Series
Click For Summary

Discussion Overview

The discussion revolves around calculating the limit of the ratio of two sequences, \( \lim_{k\to\infty}\frac{n_k}{d_k} \), where the sequences are defined recursively. The context includes mathematical reasoning and exploration of series convergence, particularly relating to the Fibonacci series and the golden ratio.

Discussion Character

  • Mathematical reasoning
  • Exploratory

Main Points Raised

  • One participant expresses confusion about calculating the limit and provides the initial conditions and recursive definitions for \( n_k \) and \( d_k \).
  • Another participant suggests that the sequences \( n_k \) and \( d_k \) are related to the Fibonacci series and references proofs of convergence for ratios of consecutive terms.
  • A participant notes that the expected answer is the golden ratio, indicating a connection to well-known mathematical constants.
  • One participant proposes a method to derive the limit by manipulating the recursive definitions and setting up an equation for the limit, suggesting it leads to a continued fractions representation of the golden ratio.
  • Another participant offers an alternative approach by rearranging the equations to solve for one sequence first and then the other, leading to a second-order difference equation for the \( d_k \) sequence.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the method of calculation or the steps to take, with multiple approaches being discussed. The expected answer being the golden ratio is acknowledged, but the discussion remains exploratory without a definitive resolution.

Contextual Notes

The discussion includes various assumptions about the sequences and their relationships, and the steps taken to derive the limit are not fully resolved. The dependence on the properties of Fibonacci-like sequences and the implications of the recursive definitions are noted but not conclusively addressed.

sennyk
Messages
73
Reaction score
0
I want to calculate the following:

[tex] \displaystyle\lim_{k\to\infty}\frac{n_k}{d_k}[/tex]
where,
[tex] n_0 = 2[/tex]
[tex] d_0 = 1[/tex]
[tex] n_k = 2n_k_-_1 +d_k_-_1[/tex]
[tex] d_k = n_k_-_1 + d_k_-_1[/tex]

For the life of me I have no idea how to do this. By the way, the answer is supposed to be
[tex]\frac{1 + \sqrt{5}}{2}[/tex]

This is not a homework problem. I was doing an electrical engineering problem and to solve the problem this series was magically solved.

Please any help is appreciated.
 
Physics news on Phys.org
I'm intrigued... as the answer it is supposed to be is the golden ratio.
 
Okay, you may proceed as follows:
[tex]\frac{n_{k}}{d_{k}}=\frac{2n_{k-1}+d_{k-1}}{n_{k-1}+d_{k-1}}=1+\frac{1}{1+\frac{d_{k-1}}{n_{k-1}}}[/tex]

Assuming that a limit exists as k (and therefore k-1) trundles off into infinity, call that limit "x".

Thus, you get the equation,
which ought to be easily solved.
[tex]x=1+\frac{1}{1+\frac{1}{x}}[/tex]

Note that this is simply another way of writing the continued fractions representation of the golden ratio.
 
Last edited:
Another way to proceed, would be to first solve for the one sequence, then for the seconde, and finally solve for the limiting ratio.

We can start with rearranging the second equation:
[tex]n_{k-1}=d_{k}-d_{k-1}\to{n_{k}=d_{k+1}-d_{k}(*)[/tex]

Inserting these relations into the first, we get:
[tex]d_{k+1}-d_{k}=2(d_{k}-d_{k-1})+d_{k-1}\to{d}_{k+1}-3d_{k}+d_{k-1}=0[/tex]
Noting from (*) that we have [itex]d_{0}=1,d_{1}=3[/itex], you should be able to solve for the d-sequence.
 

Similar threads

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