query: Q: Prove 1+1/2+1/3+...+1/(n-1) = lnn+c+o(n)
positive_passages.docid: 18796
positive_passages.text: How to find the sum of the series $1+\frac{1}{2}+ \frac{1}{3}+\frac{1}{4}+\dots+\frac{1}{n}$?
negative_passages.docid: 44328
negative_passages.text: Prove that $\sum_{k=1} ^ n k^{-1} = \ln(n) + O(1)$
negative_passages.docid: 78583
negative_passages.text: Help with proof using induction: $1 + \frac{1}{4} + \frac{1}{9}+\cdots+\frac{1}{n^2}\leq 2-\frac{1}{n}$
negative_passages.docid: 36436
negative_passages.text: Proving $\sum_{k=1}^n k k!=(n+1)!-1$
negative_passages.docid: 55481
negative_passages.text: Prove the identity $\binom{2n+1}{0} + \binom{2n+1}{1} + \cdots + \binom{2n+1}{n} = 4^n$
negative_passages.docid: 65315
negative_passages.text: Showing $1+2+\cdots+n=\frac{n(n+1)}{2}$ by induction (stuck on inductive step)
negative_passages.docid: 115912
negative_passages.text: Summation inductional proof: $\frac{1}{1^2}+\frac{1}{2^2}+\frac{1}{3^2}+\ldots+\frac{1}{n^2}<2$
negative_passages.docid: 87941
negative_passages.text: Prove by mathematical induction that $\forall n \in \mathbb{N} : \sum_{k=1}^{2n} \frac{(-1)^{k+1}}{k} = \sum_{k=n+1}^{2n} \frac{1}{k} $
negative_passages.docid: 2675
negative_passages.text: Proof $1+2+3+4+\cdots+n = \frac{n\times(n+1)}2$
negative_passages.docid: 152588
negative_passages.text: Expression for $n+n(n-1)+n(n-1)(n-2)+...+n!$
negative_passages.docid: 24469
negative_passages.text: Prove $ 2<(1+\frac{1}{n})^{n}$
negative_passages.docid: 88055
negative_passages.text: Use induction to prove the following: $1! + 2! + .... + n! \le (n + 1)!$
negative_passages.docid: 33240
negative_passages.text: $ \frac{1}{a^{2} + b^{2} + 1} + \frac{1}{b^{2}+c^{2}+1} + \frac{1}{c^{2} + a^{2} + 1} \ge 1 $, prove $ab + bc + ca \le 3$
negative_passages.docid: 118372
negative_passages.text: Combination proof for $n(n+1)2^{n-2}=\sum_{k=1}^{n}k^2\binom{n}{k}$
negative_passages.docid: 136459
negative_passages.text: Prove ${n - 1 \choose k - 1} + {n - 2 \choose k - 1} + {n - 3 \choose k - 1} + \dots + {k - 1 \choose k - 1} = {n \choose k}$
negative_passages.docid: 113321
negative_passages.text: Hint proving this $\sum_{k=0}^{n}\binom{2n}{k}k=n2^{2n-1}$
negative_passages.docid: 7201
negative_passages.text: Prove that $x_1^2+x_2^2+x_3^2=1$ yields $ \sum_{i=1}^{3}\frac{x_i}{1+x_i^2} \le \frac{3\sqrt{3}}{4} $