Intereting Posts

Verification of convolution between gaussian and uniform distributions
Center of Direct Product is the Direct Product of Centers
Why does $1/x$ diverge?
Prove that $\gcd(x, y)=\gcd(x,ax+y)$, would this be the correct reasoning?
“Every linear mapping on a finite dimensional space is continuous”
How to show that the Dini Derivatives of a measurable function is measurable?
Prove an inequality with a $\sin$ function: $\sin(x) > \frac2\pi x$ for $0<x<\frac\pi2$
Are Singleton sets in $\mathbb{R}$ both closed and open?
Perpendicular Bisector of Made from Two Points
Random determinant problem
Suppose an entire function $f$ is real if and only if $z$ is real. Prove that $f$ has at most $1$ zero.
If $\|Tv\|=\|T^*v\|$ for all $v\in V$, then $T$ is a normal operator
Conditional probability branching process
Ordinal addition is associative
Fundamental group of $SO(3)$

Let $e(n)$ be the number of partitions of $n$ with even number of even parts and let $o(n)$ denote the number of partitions with odd number of even parts. In Enumerative Combinatorics 1, it is claimed that it is easy to see that $\sum_{n \geq 0} (e(n) – o(n)) x^n = \frac{1}{(1-x) \times (1+x^2) \times (1 – x^3 ) \times (1+x^4) \times … }$. I have been racking my head over this for the past few hours, and I can’t see any light.

I noticed, that $e(n) – o(n) = 2e(n) – p(n)$ where $p(n)$ is the number of partitions of $n$, so the above claim is equivalent to showing $\sum_{ n \geq 0} e(n)x^n = \frac{1}{2} \frac{1}{(1-x)(1-x^3)(1-x^5)…}( \frac{1}{(1-x^2)(1-x^4)….} + \frac{1}{(1+x^2)(1+x^4)……..})$, and similarly, it is equivalent to $\sum_{ n \geq 0} o(n)x^n = \frac{1}{2} \frac{1}{(1-x)(1-x^3)(1-x^5)…}( \frac{1}{(1-x^2)(1-x^4)….} – \frac{1}{(1+x^2)(1+x^4)……..})$, but these identities appear more difficult than the original one.

Any hints and suggestions appreciated.

- Ordered set partitions
- (Counting problem) very interesting Modular N algebraic eqs - for combinatorics-permutation experts
- Matching Hats AND Coats Problem
- Number of isomorphism classes of a tree on n vertices
- eigen decomposition of an interesting matrix (general case)
- What is the count of the strict partitions of n in k parts not exceeding m?

- Sum of the series $\binom{n}{0}-\binom{n-1}{1}+\binom{n-2}{2}-\binom{n-3}{3}+…$
- Number of bitstrings with $000$ as substring
- Finding the number of monotonic paths not crossing the diagonal
- Enigma : of Wizards, Dwarves and Hats
- Counting subsets containing three consecutive elements (previously Summation over large values of nCr)
- Counting integer partitions of n into exactly k distinct parts size at most M
- Combinatorial proof of summation of $\sum\limits_{k = 0}^n {n \choose k}^2= {2n \choose n}$
- Calculate winning outcomes of plurality voting
- Multiple choice exam where no two consecutive answers are the same (2)
- Maximal unit lengths in 3D with $n$ points.

Now,

$$ \frac{1}{(1-x)(1+x^2)(1-x^3)\dots} $$

$$ = (1+x+x^2+\dots)(1-x^2+x^4-\dots)(1+x^3+x^6+\dots)(1-x^4+x^8-\dots)\dots $$

Consider a term which provides a negative coefficient to $x^n$

If we pick $x^{2n_2}$ from the second term, $x^{4n_4}$ from the fourth and so on,

The coefficient of $-1$ is $$(-1)^{n_2 + n_4 + \dots}$$

this will be negative if and only if $n_2 + n_4 + \dots$ is odd which comes from $o(n)$.

The positive ones come from $e(n)$.

Thus we must have that

$$\sum (e(n) – o(n))x^n = \frac{1}{(1-x)(1+x^2)(1-x^3)\dots}$$

- Sum of numbers on chessboard.
- Should the domain of a function be inferred?
- rank of block triangular matrix and its relation to the rank of its diagonal blocks
- Uniform Integrability
- Show that $ \sum_{r=1}^{n-1}\binom{n-2}{r-1}r^{r-1}(n-r)^{n-r-2}= n^{n-2} $
- How to prove $\int_0^1 \frac{1+x^{30}}{1+x^{60}} dx = 1 + \frac{c}{31}$, where $0 < c < 1$
- Trace of a nilpotent matrix is zero.
- (ZF)subsequence convergent to a limit point of a sequence
- Solving Cubic Equations (With Origami)
- Proving $n! \ge 2^{n-1 }$for all $n\ge1 $by mathematical Induction
- What is the equation of a general circle in 3-D space?
- Generating function: Find a closed form of $\sum_{k=0}^n (-3)^k(k+1)$
- Bounds on $\sum_{k=0}^{m} \binom{n}{k}x^k$ and $\sum_{k=0}^{m} \binom{n}{k}x^k(1-x)^{n-k}, m<n$
- Closed form formula for $\sum\limits_{k=1}^n k^k$
- Group actions and associated bundles