query: Solving homogenous recurrence relation
positive_passages.docid: 151929
positive_passages.text: Solving recurrence relation. Recurrence
negative_passages.docid: 56354
negative_passages.text: Uniformly Convergent Subsequence
negative_passages.docid: 17371
negative_passages.text: Recurrence relation for number of ternary strings that contain two consecutive zeros
negative_passages.docid: 130476
negative_passages.text: Prove that every terms of a sequence defined by a recurrence relation is a perfect square.
negative_passages.docid: 155690
negative_passages.text: Recurrences for even and odd indexed of Fibonacci Numbers
negative_passages.docid: 57904
negative_passages.text: Recurrence relation with limit
negative_passages.docid: 24925
negative_passages.text: Recurrence Inequality
negative_passages.docid: 143424
negative_passages.text: Sequence problem involving inequalities
negative_passages.docid: 14836
negative_passages.text: A polynomial sequence
negative_passages.docid: 4031
negative_passages.text: What is the solution to the following recurrence relation with square root: $T(n)=T (\sqrt{n}) + 1$?
negative_passages.docid: 76960
negative_passages.text: Induction for recurrence
negative_passages.docid: 43327
negative_passages.text: convoluted recurrence: $f(2n)=f(n)+f(n+1)+n, f(2n+1)=f(n)+f(n-1)+1$
negative_passages.docid: 108680
negative_passages.text: Strange Recurrence: What is it asymptotic to?
negative_passages.docid: 36413
negative_passages.text: Recurrence relation (linear, second-order, constant coefficients)
negative_passages.docid: 121167
negative_passages.text: explicit formula for recurrence relation $a_{n+1}=2a_n+\frac{1}{a_n}$
negative_passages.docid: 121248
negative_passages.text: How to solve this recurrence $T(n) = 2T(n/2) + n\log n$
negative_passages.docid: 98124
negative_passages.text: Solving for the closed term solution of a third order recurrence relation with real constant coefficients