BMO1 2013, solving a recurrence relation
54794
British Olympiad; Combinatorics Recursion
92235
Explicit formula for Bernoulli numbers by using only the recurrence relation
81371
Solving recurrence $T(n) = T(\lceil n/2 \rceil) + T(\lfloor n/2 \rfloor) + \Theta(n)$
144260
Solve recurrence relation $a_n = 3 a_{n - 3} + a_{n-1} + 2 n$
21137
Recurrence relation, induction and Fibonacci numbers
35712
Solve for n: $\varphi(2n)=\varphi(3n)$
76960
Induction for recurrence
100232
Find equivalent of recurrent sequence $u_1=1$, $u_{n+1}=1+\frac n {u_n}$
124901
Big-O notation and polynomials
153692
Generating and solving recurrence relations
41534
A system of logarithmic equations with parameters
15319
Convergence of recurrence sequence
83346
Finding a closed form $x_n$ for the recurrence relation $x_{n+2} = px_{n+1} + qx_n + r$
14836
A polynomial sequence
1711
Quadratic Recurrence : $f(n) = f(n-1) + f(n-2) + f(n-1) f(n-2)$ Solution? How?
121248
How to solve this recurrence $T(n) = 2T(n/2) + n\log n$
117254
Solving a implicit, recursive function