Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with reference-request
Search options not deleted
user 5428
This tag is used if a reference is needed in a paper or textbook on a specific result.
24
votes
Proofs without words
(I'd post this as a comment to Mariano Suárez-Alvarez, but I've not enough rep). From a ME thread.
$$\sum_{k=1}^n (-1)^{n-k} k^2 = {n+1 \choose 2} = \sum_{k=1}^n \; k = \frac{(n+1) \; n}{2}$$
5
votes
Accepted
Understanding a particular approximation for Stirling's number of the second kind
I cannot provide you with a reference, but I can sketch with my own derivation (I have a draft somewhere...).
First, let $X$ be a zero-truncated multinomial $(n,k)$ random variable (we throw $n$ ball …
- 318