A certain company assigns employees to offices in such a way that some of the offices can be empty and more than one employee can be assigned to an office. In how many ways can the company assign 3 employees to 2 different offices?
I suppose this is the easiest problem one can expect on GMAT, still i got it wrong..........i picked B, please help! What concept i'm missing over here?
I don' think this is easy at all. Ive never seen a combinatorics Q like this before.
Is the answer E? Im stuck btwn D or E, but id vouch for E. I can't really explain it, its just what I got in my notes.
we have 3!/2! * 3!/2! = 9. But i really don't know if this is correct.