Is it possible to solve any given recurrence relation?

45 Views Asked by At

I am doing a sequences homework, and tried solving some given recurrence relations (even though it was not asked). To my surprise, this proved really hard for some relations. For example: $$u_{n+1}=u_n+2\ln(u_n)$$ or an even simpler one, $$u_{n+1}=au_n(1-u_n).$$ Is there a general theorem out there that can help me solve recurrence relations containing only elementary functions?

1

There are 1 best solutions below

0
On

No, there is no such general result. You cannot get closed form solutions to recurrence relations (difference equations) any more than you can get closed form solutions to wide classes of differential equations.