Re: Problem Involving Sets

Hey Fratricide.

Hint: You should try using de-morgans theorems where not (A OR B) = not(A) AND not(B) to find not(Blond) OR not(Blue-Eyed).

Re: Problem Involving Sets

Could you elaborate, please?

Re: Problem Involving Sets

You are basically trying to find not(Blond) OR not(Blue-eyed). Using de-morgans laws this is equivalent to not(Blond AND Blue-Eyed).

Note that the last thing that was mentioned was 5 are blue-eyed-blonde-girls or Blue-eyed AND Blonde. (You need to use this piece of information).

Remember that

(Blonde AND Blue-Eyed) OR (Note Blonde AND Blue-Eyed) = Blue-Eyed and

(Blond and Non-Blue-Eyed) OR (Blonde and Blue-Eyed) = Blonde.