Intereting Posts

Achilles and the tortoise paradox?
Proving that a linear isometry on $\mathbb{R}^{n}$ is an orthogonal matrix
Prove by induction for $n \geq 1$, $x_n>x_{n+1} > \sqrt{R} $ and $ x_n- \sqrt{R} \leq \frac{1}{2^n} \cdotp \frac {(x_0- \sqrt{R})^2} {x_0} $
log sin and log cos integral, maybe relate to fourier series
Why isn't $\mathbb{R}^2$ a countable union of ranges of curves?
References for coordinate-free linear algebra books
Proof of inequality $2(\sqrt{n+1}-\sqrt{n}) < \frac{1}{\sqrt{n}} < 2(\sqrt{n} – \sqrt{n-1})$ using induction
Why does specifying an interval for a function make the function odd or even?
Theorem 6.12 (b) in Baby Rudin: If $f_1 \leq f_2$ on $$, then $\int_a^b f_1 d\alpha \leq \int_a^b f_2 d\alpha$
For self-adjoint operators, eigenvectors that correspond to distinct eigenvalues are orthogonal
Proof $ \int_0^\infty \frac{\cos(2\pi x^2)}{\cosh^2(\pi x)}dx=\frac 14$?
What's the dual of a binary operation?
Sum of $k$-th powers
Complex chain rule for complex valued functions
Integral $\int_1^\infty\frac{dx}{1+2^x+3^x}$

$$C_{n+1} = \sum_{k=0}^{\lfloor n/2\rfloor}{n\choose 2k}\cdot C_k\cdot 2^{n-2k}$$

where $C_n$ are the Catalan numbers.

I think we start by diving both sides by $2^n$, but unsure of where to go from there

- Proving this identity $\sum_k\frac{1}{k}\binom{2k-2}{k-1}\binom{2n-2k+1}{n-k}=\binom{2n}{n-1}$ using lattice paths
- How to prove $\sum_{s=0}^{m}{2s\choose s}{s\choose m-s}\frac{(-1)^s}{s+1}=(-1)^m$?
- Catalan Numbers Staircase bijection
- Harmonic Numbers series I
- Catalan number interpretation
- Identity with Harmonic and Catalan numbers

- Counting ways to partition a set into fixed number of subsets
- Identity involving Euler's totient function: $\sum \limits_{k=1}^n \left\lfloor \frac{n}{k} \right\rfloor \varphi(k) = \frac{n(n+1)}{2}$
- An Identity for Pell-numbers
- In how many ways a train can stop at $K$ of $N$ intermediate stations without stopping in any consecutive stations
- Squarefree polynomials over finite fields
- eigen decomposition of an interesting matrix (general case)
- Proof for number of weak compositions
- Number of all labeled, unordered rooted trees with $n$ vertices and $k$ leaves.
- How many different arrangements?
- Parity of Binomial Coefficients

Notice that $2^{-2k}\binom{n}{2k}\binom{2k}{k}=\binom{n/2}{k}\cdot \binom{n/2-1/2}{k}$. So

$$A_n=\sum_{k=0}^{\lfloor n/2 \rfloor}2^n \cdot 2^{-2k}\cdot \binom{n}{2k}\binom{2k}{k}\cdot\dfrac{1}{k+1}=2^n\sum_{k=0}^{\lfloor n/2 \rfloor} \binom{n/2}{k}\cdot \binom{n/2-1/2}{k}\cdot\dfrac{1}{k+1}$$

Without loss of generality, suppose $n/2 \in \mathbb{N}$. By Vandermonde’s identity, we have

$$A_n=\dfrac{2^n}{n/2+1} \cdot \binom{n+1/2}{n/2}=\dfrac{1}{n+2}\binom{2(n+1)}{n+1}=C_{n+1}$$

Here is a proof using the method by Wilf from

*Generatingfunctionology.*

Suppose we are trying to show that

$$C_{n+1} = 2^n \sum_{k=0}^{\lfloor n/2 \rfloor}

{n\choose 2k} C_k 2^{-2k}$$

where $C_n = \frac{1}{n+1}{2n\choose n}$ is the $n$-th Catalan number.

Recall the Catalan number recurrence

$$C_{n+1} = \sum_{k=0}^n C_k C_{n-k}$$

which implies for the generating function $C(z)$ of these numbers that

$$\frac{C(z)-1}{z} = C(z)^2$$

which has solutions $$C_{1,2}(z) = \frac{1\pm \sqrt{1-4z}}{2z}$$

of which the second one is analytic at zero so that

$$C(z) = \frac{1- \sqrt{1-4z}}{2z}.$$

Following Wilf we introduce the generating function $D(z)$ where

$$D(z) = \sum_{n\ge 0} z^n 2^n

\sum_{k=0}^{\lfloor n/2 \rfloor}

{n\choose 2k} C_k 2^{-2k}

= \sum_{k\ge 0} C_k 2^{-2k}

\sum_{n\ge 2k} {n\choose 2k} z^n 2^n

\\ = \sum_{k\ge 0} C_k 2^{-2k}

\sum_{n\ge 0} {n+2k\choose 2k} z^{n+2k} 2^{n+2k}

= \sum_{k\ge 0} C_k z^{2k}

\sum_{n\ge 0} {n+2k\choose 2k} z^n 2^n

\\ = \sum_{k\ge 0} C_k z^{2k} \frac{1}{(1-2z)^{2k+1}}.$$

This gives that

$$D(z) = \frac{1}{1-2z}

\frac{1-\sqrt{1-4z^2/(1-2z)^2}}{2z^2/(1-2z)^2}

\\ = \frac{(1-2z)^2}{1-2z}

\frac{1-\sqrt{1-4z^2/(1-2z)^2}}{2z^2}

= (1-2z)

\frac{1-\sqrt{1-4z^2/(1-2z)^2}}{2z^2}

\\= \frac{1-2z-\sqrt{(1-2z)^2-4z^2}}{2z^2}

= \frac{1-2z-\sqrt{1-4z}}{2z^2}.$$

On the other hand

$$\sum_{n\ge 0} C_{n+1} z^n

= \frac{C(z)-1}{z}

= \frac{1}{z} \left(\frac{1- \sqrt{1-4z}}{2z} -1 \right)

\\ = \frac{1}{z} \left(\frac{1- 2z -\sqrt{1-4z}}{2z}\right)

= \frac{1- 2z -\sqrt{1-4z}}{2z^2}.$$

We have equality, QED.

- pandigital rational approximations to the golden ratio and the base of the natural logarithm
- This is a possible proof of the Riemann Hypothesis
- Calculating derivative by definition vs not by definition
- Verify that $4(29!)+5!$ is divisible by $31$.
- Proof that if $s_n \leq t_n$ for $n \geq N$, then $\liminf_{n \rightarrow \infty} s_n \leq \liminf_{n \rightarrow \infty} t_n$
- Show that if $x\geq 0$ and $n$ is a positive integer, then $\sum_{k=0}^{n-1}\left\lfloor {x+\frac{k}{n}}\right\rfloor=\lfloor {nx}\rfloor$
- Surjective endomorphism preserves Haar measure
- How prove that $\lim\limits_{x\to+\infty}f(x)=\lim\limits_{x\to+\infty}f'(x)=0$ if $\lim\limits_{x\to+\infty}(^2+f^3(x))=0$?
- Are compact subsets of $\mathbb{R}$ with the compact complement topology closed?
- Norm of integral operator in $L_2$
- The group of $k$-automorphisms of $k]$, $k$ is a field
- Existence of subgroup of order six in $A_4$
- Cyclotomic polynomial
- An oddity in some linear equations
- Algorithm wanted: Enumerate all subsets of a set in order of increasing sums