Can anyone help me with finding a closed form for $F_n$ where
$$F_0=x_0$$
$$F_{n+1}=F_n+\frac{1}{F_n}=\frac{F_n^2+1}{F_n}$$
I could imagine this already having been done, in which case I'd appreciate a reference to it. I've tried looking at some of the first terms, but I can't make any sense of them. Thanks for any advice!
(Context: I am making a game where a variable $x$ that starts at $x_0$ changes in this fashion each frame, $F_n$ being the $n$-th frame, this isn't a homework problem.)
2026-03-29 14:18:29.1774793909
Recursive Sum of Previous Term and its Inverse
216 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SEQUENCES-AND-SERIES
- How to show that $k < m_1+2$?
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Negative Countdown
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Show that the sequence is bounded below 3
- A particular exercise on convergence of recursive sequence
- Proving whether function-series $f_n(x) = \frac{(-1)^nx}n$
- Powers of a simple matrix and Catalan numbers
- Convergence of a rational sequence to a irrational limit
- studying the convergence of a series:
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in CLOSED-FORM
- How can I sum the series $e^{-2}\frac{(3)^n}{n!}\sum_{k=0}^{\infty}\left ( \frac{1}{2}\right )^k\frac{1}{(k-n)!}$
- Computing $\int_0^\pi \frac{dx}{1+a^2\cos^2(x)}$
- Can one solve $ \int_{0}^\infty\frac{\sin(xb)}{x^2+a^2}dx $ using contour integration?
- Finding a closed form for a simple product
- For what value(s) of $a$ does the inequality $\prod_{i=0}^{a}(n-i) \geq a^{a+1}$ hold?
- Convergence of $\ln\frac{x}{\ln\frac{x}{\ln x...}}$
- How can one show that $\int_{0}^{1}{x\ln{x}\ln(1-x^2)\over \sqrt{1-x^2}}\mathrm dx=4-{\pi^2\over 4}-\ln{4}?$
- Exercises about closed form formula of recursive sequence.
- Simplify and determine a closed form for a nested summation
- Direction in closed form of recurrence relation
Related Questions in RECURSIVE-ALGORITHMS
- Designing an algorithm for integer multiplication
- Pre - calc problem turned hard, easier method for this formula?
- Simple recursive algorithms to manually compute elementary functions with pocket calculators
- Divide set into two subsets of equal sum and maximum this sum
- How many times can I do (n-1)/2 and get a whole number, recursive to formula
- Solving $A_{n+1}=3A_n+2^n$
- How to get QuickSort algorithm to run in any time between $n\log n$ and $n^2$
- Counting the number of binary heaps created with N elements with duplicite numbers
- Computation of compositions of ceilings and divisions
- How do I fight loss of significance and/or improve convergence for this recursive algorithm?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
(This was too long for a comment). Suppose $$F_n = \frac{a}b + \frac{b}a$$ where $a,b$ are polynomials in $F_0 = x.$ Then we can easily prove that $$F_{n+1} = \frac{a^2+b^2}{ab} + \frac{ab}{a^2+b^2}.$$ Therefore, the problem boils down the solving the coupled recurrences $$a_n = a_{n-1} b_{n-1}$$ $$b_n = a_{n-1}^2 + b_{n-1}^2$$ where $a_n, b_n$ are polynomials and the initial conditions are $a_1 = 1, b_1 = x.$ Solving any non linear recurrence is practically hopeless (for example, the Mandelbrot set has a non linear recurrence which leads to chaotic behavior) although there maybe some tricks about this particular problem.