Suppose we have to choose $mm_1$ items out of $m_1$ and $mm_2$ items out of $m_2$ such that $mm_1 + mm_2 = k$ where $k$ is fixed and known. This also constrains us such that $mm_1 < m_1$ and $mm_2 < m_2$. I want to maximize the value of $C^{m_1}_{mm_1} * C^{m_2}_{k-mm_1}$.
The naive solution will be to go through all the possible $k$, and choose $mm_1$ that gives the largest value. Is there a closed form solution for $mm_1$ to maximize the product?