Reputation
10,828
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
2 22 54
Newest
 Nice Answer
Impact
~268k people reached

Jan
10
reviewed Leave Open simplification of trig identities math check
Jan
9
answered Is there a reason of $\cos(11x)+\sin(11(x+1))\approx 0$
Jan
9
comment Visually stunning math concepts which are easy to explain
The basic idea is pretty simple: ${i \choose k} = {i \choose k-1} + {i-1 \choose k-1}$, and this recurrence holds $\mod p$ as well.
Jan
9
comment Visually stunning math concepts which are easy to explain
I'd also note that it's possible to compute ${i \choose k} \mod p$ without computing $i \choose k$. For large $i$ this would matter.
Jan
9
reviewed Leave Open Projection onto U through V
Jan
8
awarded  Good Answer
Jan
7
answered Distinct ways three integers can sum to a constant
Jan
7
reviewed Leave Open Standard deviation of a baised $d$-sided coin
Jan
7
reviewed Reject Gelfand-Mazur theorem on $GL_n(\mathbb{C})$
Jan
7
reviewed Approve Spivak Calculus on Manifolds, Theorem 5-2
Jan
7
reviewed Close Replacing Variables in Integration
Jan
7
reviewed Approve If a prime number is reversed, and then appended to itself, why is the result always a composite number?
Jan
7
awarded  Nice Answer
Jan
6
reviewed No Action Needed Can $n$ vertices be removed so the directed graph contains no cycles?
Jan
6
awarded  Custodian
Jan
6
reviewed Leave Closed Property of ideal
Jan
6
reviewed Close Fibonacci sequence, strings without 00, and binomial coefficient sums
Jan
6
reviewed Leave Open Intersection of functions $\ln(x)$ and $\frac{1}{x}$
Jan
6
reviewed Leave Open connected graph with its vertices
Jan
6
reviewed Leave Open How do I find this limit?