Reputation
15,507
Top tag
Next privilege 20,000 Rep.
Access 'trusted user' tools
Badges
1 9 47
Newest
 Necromancer
Impact
~138k people reached

23h
answered how many ways to partition a set with k subsets, each of fixed size?
23h
comment Effective Branch cut
This MSE link may prove relevant, as may this MSE link II.
23h
answered Multiplication Principle and Inclusion-Exclusion: $2^n = \sum_{i = 0}^n (-1)^i \binom{n}{i} \binom{2n - 2i}{n - 2i}$
23h
answered Proof Bell-Number $B(n+1)=\sum\limits_{i=0}^n\binom{n}{i}B(i)$
1d
answered Reducing the form of $2\sum\limits_{j=0}^{n-2}\sum\limits_{k=1}^n {{k+j}\choose{k}}{{2n-j-k-1}\choose{n-k+1}}$.
2d
answered How to prove $\sum\limits_{i=0}^n (-1)^i \binom{n}{i} \binom{n-i}{k}=0$
2d
answered $Q=\{ 1,2,…n \}$. $S \subset Q$, let $p(S)$ be the product of elements of $S$, Find the sum of reciprocals $\frac{1}{p(S)}$ for all $S \subset Q$.
May
25
awarded  Necromancer
May
24
comment the series: compute $ \sum_{n=1}^{\infty}\frac{1}{(4n^2-1)^4} $
The following MSE link would appear to be relevant.
May
24
answered Calculating $\int_0^\pi \frac{1}{a+b\sin^2(x)} dx $
May
22
answered Cauchy-Ramanujan Formula $ \displaystyle \sum_{\stackrel{m \in \mathbb{Z}}{m \neq 0}} \frac{\coth m \pi}{m^{4p+3}} $
May
21
answered for $n > 1$ : odd , prove that $\Phi_{2n}(x) = \Phi_{n}(-x)$
May
19
revised transforming ordinary generating function into exponential generating function
fix mistake
May
19
revised transforming ordinary generating function into exponential generating function
advanced example
May
19
revised transforming ordinary generating function into exponential generating function
remark
May
19
answered transforming ordinary generating function into exponential generating function
May
19
comment solve recurrence relation: comparisons to construct binary search tree with maple
(+1). This looks impressive. It just needs converting the Psi function into a harmonic number so the asymptotics are more apparent.
May
19
revised Show that the average depth of a leaf in a binary tree with n vertices is $ \Omega(\log n)$.
Maple
May
19
revised Show that the average depth of a leaf in a binary tree with n vertices is $ \Omega(\log n)$.
data from combstruct
May
19
revised Show that the average depth of a leaf in a binary tree with n vertices is $ \Omega(\log n)$.
correction