Intereting Posts

Filling a unit cube with countable balls.
When is a flat morphism open?
Union of two self-intersecting planes is not a surface
How to prove that exists distinct $x_1,x_2 \in(a,b)$ such that $f '(x_1)f '(x_2)=1$?
How exactly do you measure circumference or diameter?
Confused on Injection and Surjection Question – Not sure how to justify
If $A^2 = I$, then $A$ is diagonalizable, and is $I$ if $1$ is its only eigenvalue
How to solve this equation if $x\in \mathbb{R}$, $x ^3+1 =2\sqrt { 2x-1 }$, find $x$
Is there a uniform distribution over the real line?
If a cyclotomic integer has (rational) prime norm, is it a prime element?
The existence of analytical branch of the logarithm of a holomorphic function
Can these bounds, for the deficiency $D(x)=2x-\sigma(x)$ of a deficient number $x>1$, be improved?
Unique Groups for Game Tournament
Necessary/sufficient conditions for an infinite product to be exactly equal to $1$
Improper integral of a rational function:$\int_0^\infty \frac{5t^6}{1+t^{10}}dt$

Consider a ordered set consisting of $N$ integers. It is called beautiful if for every integer $x$ in the set, either $x-1$ or $x+1$ is present in the set.

How many beautiful sets can be created using the numbers $1$ to $M$ of size $K$ for some arbitrary $M$ and $K$?

The number of sets created using the numbers from $1$ to $6$ of size $4$ is 6. Ex: (1, 2, 3, 4), (2,3,4,5),(3,4,5,6),(1,2,4,5),(1,2,5,6) ,(2,3,5,6).

- Combinatorial proof of the identity ${n+1\choose k+1}={k\choose k}+{k+1\choose k}+…+{n-1\choose k}+{n\choose k}$
- Number of ways to write set $S$ as union of $l$ unique $k$-subsets
- Tiling of regular polygon by rhombuses
- Improvised Question: Combination of selection of pens
- What are the total number of ordered permutations of a list of elements (possibly repeated)?
- Probability of two people meeting in a given square grid.

- Mondrian Art Problem Upper Bound for defect
- Is this determinant identity known?
- Coupon collector without replacement
- very stupid confusion in probablity or combination?
- Number of singular $2\times2$ matrices with distinct integer entries
- Prove that for all non-negative integers $m,n$, $\frac{(2m)!(2n)!}{m!n!(m + n)!}$ is an integer.
- Why can a Venn diagram for 4+ sets not be constructed using circles?
- Can this product be written so that symmetry is manifest?
- Coloring the faces of a hypercube
- A generalization of Kirkman's schoolgirl problem

We want to count the number of strings of length $M+1$ consisting of $M-K+1$ atoms that look like

$$

\underbrace{\ 0\ }_1,\underbrace{110}_{x^2},\underbrace{1110}_{x^3},\underbrace{11110}_{x^4},\dots

$$

That is, there are $M-K+1$ zeros and $K$ ones. Since the atoms all end with a zero, we’ve added one to the number of zeros and one to the length the string.

As seen by the monomials under the atoms, we want to count the coefficient of $x^K$ in $\left(1+x^2+x^3+x^4+x^5+\dots\right)^{M-K+1}$. Since

$$

\begin{align}

1+x^2+x^3+x^4+x^5+\dots

&=\frac1{1-x}-x\\

&=\frac{1-x+x^2}{1-x}\\

&=\frac{1+x^3}{1-x^2}

\end{align}

$$

what we are looking for is

$$

\bbox[5px,border:2px solid #C0A000]{\left[x^K\right]\left(\frac{1+x^3}{1-x^2}\right)^{M-K+1}}

$$

To compute this coefficient, we use the Binomial Theorem

$$

\begin{align}

\left(\frac{1+x^3}{1-x^2}\right)^{M-K+1}

&=\sum_{a=0}^{M-K+1}\binom{M{-}K{+}1}{a}x^{3a}\sum_{b=0}^\infty(-1)^b\binom{-M{+}K{-}1}{b}x^{2b}\\

&=\sum_{a=0}^{M-K+1}\binom{M-K+1}{a}x^{3a}\sum_{b=0}^\infty\binom{M{-}K{+}b}{b}x^{2b}

\end{align}

$$

Therefore,

$$

\begin{align}

\left[x^K\right]\left(\frac{1+x^3}{1-x^2}\right)^{M-K+1}

&=\bbox[5px,border:2px solid #C0A000]{\sum_{3a+2b=K}\binom{M{-}K{+}1}{a}\binom{M{-}K{+}b}{b}}\\

&=\left\{\begin{array}{}

\displaystyle\sum_{j=0}^{\lfloor K/6\rfloor}\binom{M{-}K{+}1}{2j}\binom{M{-}\frac K2{-}3j}{\frac K2-3j}&\text{if $K$ is even}\\

\displaystyle\sum_{j=0}^{\lfloor(K-3)/6\rfloor}\binom{M{-}K{+}1}{2j+1}\binom{M{-}\frac{K+3}2{-}3j}{\frac{K-3}2-3j}&\text{if $K$ is odd}

\end{array}\right.

\end{align}

$$

To check this with the example given, $6-4+1=3$, so consider

$$

\left(\frac{1+x^3}{1-x^2}\right)^3=1+3x^2+3x^3+6x^4+9x^5+\dots

$$

Note that the coefficient of $x^4$ is $6$.

Also, since $K$ is even,

$$

\binom{6-4+1}{0}\binom{6-2}{2}=6

$$

- Inverse Gaussian distribution
- Unique line in $\mathbb{P}^3$ through a point $p$ and intersecting two disjoint lines
- Circular Permutation
- What are the practical applications of this trigonometric identity?
- If I roll two fair dice, the probability that I would get at least one 6 would be…
- How to find a random axis or unit vector in 3D?
- Why is $\pi$ irrational if it is represented as $c/d$?
- symmetric positive definite matrix question
- Number of roots of polynomials in $\mathbb Z/p \mathbb Z $
- Why does $\int_a^b fg\, dx = 0$ imply that $f = 0$?
- Prove $\frac{|a+b|}{1+|a+b|}<\frac{|a|}{1+|a|}+\frac{|b|}{1+|b|}$.
- Epimorphisms from a free group onto a free group
- Open mapping of the unit ball into itself
- Isomorphism vs equality of graphs
- On critical points of a large function