Reputation
Next tag badge:
251/100 score
19/20 answers
Badges
5 92 182
Newest
 Necromancer
Impact
~886k people reached

Aug
18
awarded  Necromancer
Jul
16
awarded  Notable Question
Jul
15
revised Formula for $\sum_{k=0}^n S(n,k) k$, where $S(n,k)$ is a Stirling number of the second kind?
added combinatorial proof
Jul
11
awarded  Great Answer
Jul
11
awarded  Nice Answer
Jul
11
awarded  Announcer
Jun
25
awarded  Revival
Jun
23
answered proof that $1 = \sum\limits_{k=0}^n (-1)^k { 2n \choose n,k,n-k } \frac{n}{n+k}$
Jun
16
awarded  Good Answer
Jun
11
awarded  Nice Answer
Jun
7
awarded  Guru
May
11
awarded  Notable Question
May
11
awarded  Nice Answer
May
9
awarded  Good Answer
Apr
23
awarded  Necromancer
Mar
19
awarded  Favorite Question
Mar
10
awarded  Announcer
Jan
29
awarded  Famous Question
Jan
15
awarded  Popular Question
Jan
14
awarded  Nice Answer