Explanation

We have a group of 60 integers that we don't know too much about. It looks like a number properties or prime factorization question, since we are talking about divisibility. But when we glance over the data statements, we think we are talking about overlapping sets, and the divisibility question is merely a disguise. Anyway, we want to know how many of these numbers are divisible neither by 7 nor by 13. If we use the two-set Venn diagram equation, , then we are looking for N and we have virtually no other information, except that . On to the statements, separately first.

Statement (1) tells us that . We are still missing the value of G2, so this statement is insufficient.

Statement (2) tells us that . We are missing the values of G1 and G2, so this statement is insufficient.

With both statements, we have B, and we can solve for G1. We are still missing the value of G2, so we cannot solve uniquely for N. The statements together are insufficient.

The correct answer is (E).