 Conditional composition of two independent binomial counts

Let $X$ and $Y$ be independent random variables with binomial distributions $\mathrm{Bin}(n,p)$ and $\mathrm{Bin}(m,q)$. Conditional on $X+Y=k$ having positive probability, the possible values of $X$ satisfy $\max (0,k-m)\le j\le \min (n,k)$. Their probabilities arewhere the denominator sums over that feasible integer range. The formula follows by multiplying independent binomial probabilities and dividing by the probability of the disjoint union of all feasible count pairs.

For $p,q\in (0,1)$, common factors cancel and the weights are proportional to $\left(\genfrac{}{}{0ex}{}{n}{j}\right)\left(\genfrac{}{}{0ex}{}{m}{k-j}\right){\theta }^j$, where $\theta =p(1-q)/[q(1-p)]$. If $p=q$, this reduces to the hypergeometric distribution, with probabilities $\left(\genfrac{}{}{0ex}{}{n}{j}\right)\left(\genfrac{}{}{0ex}{}{m}{k-j}\right)/\left(\genfrac{}{}{0ex}{}{n+m}{k}\right)$. At parameter endpoints, use the original probability weights and check that the conditioning event has positive probability before dividing.