Solvability of $\binom{2k}{k} = \binom{2a}{a} \binom{x+2b}{b}$

Suppose $k,x,$ and $b$ are positive integers, and $a$ is a nonnegative integer such that $k=a+b$. In this paper, we will prove $\binom{2k}{k} = \binom{2a}{a} \binom{x+2b}{b}$ if and only if $x=a=1$. We do this by looking at different cases depending on the values of $x$ and $k$. We use varying techniques to prove the cases, such as direct proof, verification through Maple software, and a proof technique found in Moser's paper. Previous results from Hanson, St\u{a}nic\u{a}, Shanta, Shorey and Nair are also used.