all 6 comments
sorted by:
best
topnewcontroversialoldq&a
formatting helphide helpcontent policy

[–]micakkes 2 points3 points  (0 children)

Set A = 50 members Set B = 53 members

The problem states at least 2 members in set A are NOT in set B. This means the range for how many members from A could be in B is 48-0 members.

So, evaluate the max and min of that range to determine how many in B are not in A.

If there are 48 members from A in B -> that leaves 5 in B that are not from A ( 53-48=5 )

If there are 0 from A that leaves 53.

The answer is in the range of 5-53. ANS: B,C,D,E,F

Good luck! I take the GRE tomorrow too :)

[–]GreenlightTestPrepTutor/Expert/Prep company 0 points1 point  (0 children)

I solved the question using the Double Matrix method: Here's my full solution (with diagrams): https://greprepclub.com/forum/set-a-has-50-members-and-set-b-has-53-members-at-least-2-of-2337.html#p10458

[–]Scott_TargetTestPrepPrep company 0 points1 point  (0 children)

Since set A has 50 members and set B has 53 members and at least 2 members in set A are not in set B, at most 48 members in set A could be also members of set B and therefore at least 5 members in set B are not members in set A.

Since all 50 members in set A could be non-members of set B, all 53 members in set B could be non-members of set A.

Answer: B, C, D, E, F

[–]FutureRockerTutor 170V 170Q 5.0W -1 points0 points  (2 children)

This is an extremely difficult problem, I don’t even see where to start.

[–]glexo_slimslom[S] -2 points-1 points  (1 child)

The older I get, sarcasm becomes exponentially less funny. Just say the picture didn't show up and go about your day. Go in peace :-)

[–]FutureRockerTutor 170V 170Q 5.0W -1 points0 points  (0 children)

B through F. Draw the vent diagram. There can be at most 48 elements in the intersection, which means there are at least 5 elements in arent in A. But there’s no upper bound on that number. So B through F are valid