A man desires to throw a party for some of his friends. In how many ways can he select $8$ friends from a group of $14$ friends if the two of his friends(say ’A’ and ’B’) will not attend the party together?
This is what I've done:
Lets make two groups one for A and one for B
$A$ = $\{A,C,D,E,F,G,H,I,J,K,L,M,N\}$
$B$ = $\{B,C,D,E,F,G,H,I,J,K,L,M,N\}$
Since $A$ and $B$ will not attend together, there is only 13 friends to choose from:
$^{13}C_8 = 1287$ ways to invite.
Is this approach and answer correct?