query: Showing that $\sum k^{2}/k!=e^2$
positive_passages.docid: 17713
positive_passages.text: What's the value of $\sum\limits_{k=1}^{\infty}\frac{k^2}{k!}$?
negative_passages.docid: 48642
negative_passages.text: Let $f(n) = \sum_{(k,n)=1} e^\frac{2\pi ik}{n}$. Show that $f(n) = \sum_{k=1}^{n}\left(\sum_{d\mid (k,n)} \mu(d)e^{\frac{2\pi ik}{n}} \right) $
negative_passages.docid: 4991
negative_passages.text: Proving by induction that $ \sum_{k=0}^n{n \choose k} = 2^n$
negative_passages.docid: 44161
negative_passages.text: Using induction to prove $\sum_{k=0}^{N-1} 2^k = 2^N-1$
negative_passages.docid: 25395
negative_passages.text: Sum $\sum_{n=1}^\infty \frac{n^2}{(n+2)!}$
negative_passages.docid: 99453
negative_passages.text: Sum of $k$-th powers
negative_passages.docid: 100558
negative_passages.text: Prove that for any even positive integer $n$, $n^2-1 \mid 2^{n!}-1$
negative_passages.docid: 61850
negative_passages.text: Compute $\sum_{k=0}^{\infty}\frac{1}{2^{k!}}$
negative_passages.docid: 30338
negative_passages.text: How to prove that $\sum_{k=0}^n \binom nk k^2=2^{n-2}(n^2+n)$
negative_passages.docid: 35525
negative_passages.text: Methods to compute $\sum_{k=1}^nk^p$ without Faulhaber's formula
negative_passages.docid: 114031
negative_passages.text: Show that $\sum_{n=0}^\infty r^n e^{i n \theta} = \frac{1- r\cos(\theta)+i r \sin(\theta)}{1+r^2-2r\cos(\theta)}$
negative_passages.docid: 120976
negative_passages.text: Proving $\sum_{k=0}^{n}k{n\choose k}^2 = n{2n-1 \choose n-1} $
negative_passages.docid: 15100
negative_passages.text: Proving the identity $\sum_{k=1}^n {k^3} = \big(\sum_{k=1}^n k\big)^2$ without induction
negative_passages.docid: 151179
negative_passages.text: Finding the value of $\sum k/3^k$
negative_passages.docid: 84213
negative_passages.text: How to show $n\sum_{i=1}^n {x_i^2} \ge (\sum_{i=1}^n{x_i})^2$
negative_passages.docid: 345
negative_passages.text: Proving $ \sum _{k=0} ^m \binom nk \binom{n-k}{m-k} = 2^m \binom {n}{m}$.
negative_passages.docid: 59252
negative_passages.text: Show $\sum_{k=0}^{m} \binom{n-k}{m-k}=\binom{n+1}{m}$