Find the number of ways in which $n$ boys and $n$ girls ($n>1$) can be seated in a row of seats if the boys and the girls are to have alternate seats and one particular boy and one particular girl must not sit next to each other.
P.S.: Official A-level Pure Maths (1969) Answer is $2(2(n!)-1-2(n-1))$ but my answer is $2((n!)^2-1-2(n-1))$, what's wrong here?
After my deep thought, the official answer makes no sense to me. However, my answer is $2((n!)^2-(n-1)-2(n-1)(n-1)^2)$. Simply listing all possible permutation, which has $(n!)^2$ ways, and cancels those where the boy and the girl sitting next to each other, which has $(n-1)+2(n-1)^3$ ways.
(Total no of cases) minus (cases boy 1 and girl 1 are together)
$=2 (n!)^2 - \text{($n-1$ girls and $n-1$ boys seat alternatively)} \times (2n-1)$ [As there are $2n-1$ gaps, and in each, boy $1$ and girl $1$ can only be fitted in $1$ way so that boys and girls sit alternatively]
$= 2(n!)^2 - 2{(n-1)!}^2 \times (2n-1)$
$= 2{(n-1)!}^2 [ n^2 - 2n +1]$
I may be wrong but i think u should check the answer again