paper

Solvability of

arXiv:2406.10404

Abstract

Suppose and are positive integers, and is a nonnegative integer such that . In this paper, we will prove if and only if . We do this by looking at different cases depending on the values of and . 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ănică, Shanta, Shorey and Nair are also used.

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