7

I would like to find the general term, closed form or analytic solution for the recurrence relation $a_{n+1}=\sqrt{a_n+1},a_1=1$.

I looked around the internet but could not find much about this problem. If anyone knows any paper or research about this problem, I would like to know.

My research:

The 3rd website and 4th website seems to be related since the equation $a_{n+1}=a_{n}^2+c$ turns into $a_n=\sqrt{a_{n+1}-c}$ and if we swap $a_n,a_{n+1}$ and set $c=-2$(which is one of the values mentioned) we get $a_{n+1}=\sqrt{a_n+2}$. However, I do not know how to make use of this connection.

Kaira
  • 1,695
  • 1
    I think the relation with the 4th website is that if we set $b_n=a_n^2$ then $b_{n+1} = \sqrt{b_n-c}$ (that seems more precise than swapping $a_n,a_{n+1}$). – Greg Martin Aug 08 '22 at 22:40
  • Have you tried to put $ a_n=\cosh(\theta_n)$ – hamam_Abdallah Aug 08 '22 at 23:05
  • @GregMartin Does that really work? Assuming $a_{n+1}=a_n^2+c$, I got $b_{n+1}=a_{n+1}^2=(a_n^2+c)^2=(b_n+c)^2$ which looks different. – Kaira Aug 09 '22 at 03:01

1 Answers1

4

This may not be exactly what you are looking for but it is close.

Define the constants $$ s:=\sqrt{5},\; g:=(1+s)/2,\text{ and } c\approx -2.1972839287883129714.$$ Define using power series the function

$$ T(x) := x + \frac{5 - s}{20} x^2 + \frac{5 s - 11}{20} x^3 + \frac{497 s - 1110}{3800} x^4 + \cdots. $$

Define the sequences

$$ b_n := T(c\cdot(2g)^{-n}), \qquad a_n := g+b_n. $$

Note that $\,\lim_{n\to\infty} b_n = 0\,$ and $\,\lim_{n\to\infty} a_n = g.\,$ The sequence $\,a_n\,$ satisfies

$$ a_{n+1}=\sqrt{a_n+1},\qquad a_1=1. $$

Unfortunately, I can only determine the coefficients of $\,T(x)\,$ one by one and have no closed form for the function itself or its coefficients.


Some more details are here. The idea is to ensure that

$$ g \!+\! T(x) \!=\! \sqrt{g^2 \!+\! T(2gx)},\; \text{ or }\;T(x)^2\!=\! T(2gx) \!-\! 2gT(x). $$

Given the definition of $\,a_n\,$ this implies that $\,a_{n+1} = \sqrt{a_n+1}.\,$

Use the method of undetermined coefficients, to solve for the coefficients of $\,T(x)\,$ one by one. For example, assume that $\, T(x) = x + u_2x^2 + O(x^3).\,$ Then use $\, x^2 + O(x^3) = (2gx + u_2(2gx)^2) - (2gx + 2gu_2x^2) = (5+s)u_2x^2\,$ to solve for $\,u_2.$

The value of $\,c\,$ is determined as the unique value that yields $\,a_1 = 1.\,$ Also, it is the limit $\,c = \lim_{n\to\infty} b_n(2g)^n.\,$

Somos
  • 37,457
  • 3
  • 35
  • 85
  • I have three questions. (1) I am not sure how to prove that $a_n$ satisfies the equation. Could you elaborate? (2) I know you said you don’t have closed form for the coefficients of T, but can you describe the algorithm to derive them? (3) How did you get $c$? – Kaira Aug 09 '22 at 03:13
  • @Kaira Thanks for that helpful comment! I will add more details. – Somos Aug 09 '22 at 03:14