How to solve this functional (recurrence) equation ?

  • Context: Graduate 
  • Thread starter Thread starter jk22
  • Start date Start date
  • Tags Tags
    Functional Recurrence
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
3 replies · 2K views
jk22
Messages
732
Reaction score
25
I'm in a problem where I have to solve the following functional equation :

[tex]F(n)^2=n+F(n+1)[/tex]

Does anyone know some methods to solve this kind of problems ?

A similar equation happens in Ramanujan example of root denesting : http://en.wikipedia.org/wiki/Nested_radical#Square_roots
 
Mathematics news on Phys.org
Don't know of a method. As stated the problem is incomplete - you need an initial condition (F(0) = ?).
 
The problem is to find F(1), knowing that [tex]F(1)=\sqrt{1+\sqrt{2+\sqrt{3+\ldots}}}[/tex].
 
jk22 said:
The problem is to find F(1), knowing that [tex]F(1)=\sqrt{1+\sqrt{2+\sqrt{3+\ldots}}}[/tex].

Should that be to find F(n) given that [itex]F(1)=\sqrt{1+\sqrt{2+\sqrt{3+\ldots}}}[/itex] ?

Find F(2) and the pattern becomes clear.