query: Solving a recursive geometric series by hand?
positive_passages.docid: 145444
positive_passages.text: Solve $\dfrac{1}{1+\frac{1}{1+\ddots}}$
negative_passages.docid: 120913
negative_passages.text: How would you write a non-recursive algorithm to calculate factorials?
negative_passages.docid: 1058
negative_passages.text: Get the cartesian product of a series of lists?
negative_passages.docid: 132081
negative_passages.text: Geometrical interpretation of $(\sum_{k=1}^n k)^2=\sum_{k=1}^n k^3$
negative_passages.docid: 13418
negative_passages.text: Solve the recurrence
negative_passages.docid: 47463
negative_passages.text: Converting sums of square-roots to nested square-roots
negative_passages.docid: 110958
negative_passages.text: How to solve for any given natural number n?
negative_passages.docid: 107270
negative_passages.text: Calculate the following series using telescoping
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: 83346
negative_passages.text: Finding a closed form $x_n$ for the recurrence relation $x_{n+2} = px_{n+1} + qx_n + r$
negative_passages.docid: 50936
negative_passages.text: How to solve permutation group equations?(discrete mathematics,group theory)
negative_passages.docid: 56803
negative_passages.text: Finding solutions to congruence equations
negative_passages.docid: 157001
negative_passages.text: Are there clever ways to evaluate this infinite series?
negative_passages.docid: 54374
negative_passages.text: Alternating Series Using Other Roots of Unity
negative_passages.docid: 33955
negative_passages.text: Geometric series of matrices
negative_passages.docid: 36713
negative_passages.text: Solving multiple congruences by CRT = Chinese Remainder Theorem
negative_passages.docid: 121742
negative_passages.text: Solve a system of equations with Euclid's Algorithm