Six alphabets, A,B,C,D,E, and F have to be arranged in six numbered positions(1-6). How many ways can you arrange them so that A is not in position numbered 1 , B a is not in position numbered 2 and C is a is not in position numbered 4.
I am trying to break this problem into boolean algebra. Let X=# of ways A is in position 1 Y=# of ways B is in position 2 Z=# of ways C is in position 4
The question is basically asking in how many ways is ~Xu~Yu~Z which is:
(~X)or(~Y)or(~Z)=~X+~Y+~Z-(~X)n(~Y)-(~X)n(~Y)-(~Y)n(~Z)+(~X)n(~Y)n(~Z) for which I get=3*600-3*288+6. Am I doing this correctly?
Could have I solved this problem by rewording ~Xu~Yu~Z=~(XuYuZ)=Total-(XuYuZ)?