query: Solve this recursion
positive_passages.docid: 145941
positive_passages.text: Solve recurrence equation $T(n)=2T(n-1)-4$
negative_passages.docid: 155425
negative_passages.text: Solve recurrence for strings that do not contain the substring 101
negative_passages.docid: 74682
negative_passages.text: How should I solve combination addition like this?
negative_passages.docid: 65221
negative_passages.text: Recursion in an XML schema?
negative_passages.docid: 17371
negative_passages.text: Recurrence relation for number of ternary strings that contain two consecutive zeros
negative_passages.docid: 116364
negative_passages.text: Find the Theta class for the recursion $T(n) = T(3n/4) + T(n/6) + 5n$
negative_passages.docid: 49741
negative_passages.text: Finding a closed form for a recurrence relation $a_n=3a_{n-1}+4a_{n-2}$
negative_passages.docid: 13418
negative_passages.text: Solve the recurrence
negative_passages.docid: 58187
negative_passages.text: Solve the sequences inequality
negative_passages.docid: 31642
negative_passages.text: Values obtained in case of a recursive function
negative_passages.docid: 141095
negative_passages.text: Solve recurrence relation $ a_{n+1} = (n+1)a_n + 1 $
negative_passages.docid: 87066
negative_passages.text: How do I solve the following equation?
negative_passages.docid: 94164
negative_passages.text: Can every recursion be converted into iteration?
negative_passages.docid: 121248
negative_passages.text: How to solve this recurrence $T(n) = 2T(n/2) + n\log n$
negative_passages.docid: 114884
negative_passages.text: Recursion - Removing Duplicates
negative_passages.docid: 102163
negative_passages.text: Find the sub-sequential limits of a recursive sequence
negative_passages.docid: 19336
negative_passages.text: Recursive sequence through a function