Reputation
Next tag badge:
268/100 score
19/20 answers
Badges
6 102 189
Newest
 Good Answer
Impact
~1.1m people reached

33m
awarded  Good Answer
Jan
26
awarded  Enlightened
Jan
26
awarded  Nice Answer
Jan
12
awarded  Enlightened
Jan
12
awarded  Nice Answer
Jan
12
awarded  Announcer
Dec
28
awarded  Enlightened
Dec
28
awarded  Nice Answer
Dec
24
awarded  Famous Question
Dec
13
awarded  Good Answer
Nov
4
awarded  Favorite Question
Oct
19
awarded  Guru
Oct
14
awarded  Good Answer
Oct
11
awarded  Nice Answer
Oct
9
revised Prove that $2^{n-1}$ divides $\binom{n}{1} + \binom{n}{3}5 + \binom{n}{5}25 + \binom{n}{7}125 + \cdots$ for $n \geqslant 1$.
there are 10 tiles in my example, so n should equal 11
Oct
7
answered Prove that $2^{n-1}$ divides $\binom{n}{1} + \binom{n}{3}5 + \binom{n}{5}25 + \binom{n}{7}125 + \cdots$ for $n \geqslant 1$.
Oct
7
awarded  Yearling
Sep
27
awarded  Announcer
Sep
18
comment Exponential Generating Functions For Derangements
@robjohn: Better? :)
Sep
18
revised Exponential Generating Functions For Derangements
changed indexing in response to robjohn's comment