1. The problem statement, all variables and given/known data In how many ways can m men and n women be arranged such that no two women are besides each other? (m > n) 2. Relevant equations 3. The attempt at a solution The given answer is m! x P(m + 1, n). I understood how the answer should be a multiple of m!. I also understood that there should be an n in P(m + 1, n). What I couldn't get was how do we get the m + 1 part?