The grayed portion of the Venn diagram corresponds to those integers which are not in any of,, or. Therefore, we eliminate any choices that are in any of the three sets.

is the set of integers which end in 1 or 6; we can eliminate 166 and 176 immediately.

is the set of perfect square integers; we can eliminate 144, since.

is the set of integers which, when divided by 4, yields remainder 2. Since, we can eliminate 154.

All four choices have been eliminated.

is the union of setsand- that is, the set of all elements ofthat are elements of eitheror. We want all of the letters that fall in either circle, which from the diagram can be seen to be all of the letters except. Therefore,

Based on the information given, you can construct the following Venn Diagram:

我n order to find the overlap, you need to find out how many are in the circles together. This is easy. Subtract:. Now, since the overlap represents a duplication, you need to subtract out one of those duplicate values. Let's call that; therefore, we know that:

Solving for, you get:

Based on the information given, you can draw the following Venn Diagram:

To solve this, remember that the total number of values in the two circles is:

(We must do this because of the overlap. You need to subtract out one instance of that overlap.)

我f we assign the valuefor the unknown region, we know:

Based on the information, you can draw the following Venn Diagram:

我t is very easy to solve for the number of plants that have green leaves but not large ones. This is merely. We find this by eliminating the large-leaved plants from the green ones (by subtracting the overlap from the green ones).

Based on the information given, you can draw the following Venn Diagram:

Now, you must begin by solving for. You know that the two circles together will havein them. This is arrived at by subtracting the people who have neither books nor pens () from the "universe" of people in the sample space (). Now, we know that. This is because of the overlap ofin both groups. We have to get rid of one instance of that. Thus we can solve for:

Now, we can find the number of people with只有书by subtractingfrom theto get.

Carter would not fall in set A, since he was not a President born in Virginia.

He would not fall in B, since he was born before 1850.

He would fall in C, since his first name is James.

He would fall in the region included in set C, butnotA or B - this is Region V.

Carter would not fall in set A, since he was not a President born in Virginia.

He would fall in B, since he was born after 1850.

He would fall in C, since his first name is James.

He would fall in the region included in sets B and C, butnotA - this is Region III.

The subset must comprise words that fall inside set, but neithernor.

Therefore, all of the words in the subset must have exactly five letters, but cannot begin with a vowel or end with a consonant - that is, we are looking for a set of five-letter words that begin with a consonant and end with a vowel.

The only set among the five choices that matches this description is the set

{price, value, pinna, trove, three}.

The subset must comprise words that fall inside setsand, butnot. Therefore, all of the words in the subset must begin with a consonant, end with a vowel, andnothave six letters.

Of the given choices, the only set whose elements fit this description is {plateau, portmanteau, calliope, marionette, taco}.