BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

Sets problem

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Master | Next Rank: 500 Posts
Posts: 142
Joined: Sun Jun 12, 2011 7:55 amFollowed by: 3 members
Thanked: 5 times
by metallicafan » Tue May 01, 2012 4:29 pm
Each of the terms in sets R, S, and T are positive integers. If 9 of the integers in R are also in S, 12 of the integers that are in S are also T, and 4 of the integers that are in R are also in T, how many unique positive integers are contained in the three sets?

(1) 1 of the integers is in R, S, and T.
(2) R has 20 terms, S has 24 terms, and T has 30 terms.

Source: www.gmathacks.com
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Data Sufficiency |
Master | Next Rank: 500 Posts
Posts: 142
Joined: Thu Apr 26, 2012 3:24 am
Location: India
Thanked: 28 times

by mathbyvemuri » Tue May 01, 2012 8:54 pm
Two statements together are required to solve it.
Answer option "C"

Explanation:
R and S = 9
S and T = 12
R and T = 4
only "R" + only "S" + only "T" is required

Only "R" = R - (R and S) - (R and T) - (R and S and T)
Only "S" = S - (S and R) - (S and T) - (R and S and T)
Only "T" = T - (T and R) - (T and S) - (R and S and T)

only "R" + only "S" + only "T"
= R+S+T-2(R and S)-2(R and T)-2(S and T)-3(R and S and T)

So to get the final answer we additionally need R,S,T and (R and S and T)

statement(1) gives (R and S and T), which alone is not sufficient
statement(2) gives R, S , T values, which alone is not sufficient

But (1) and (2) together are sufficient
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 299
Joined: Tue Feb 15, 2011 10:27 amFollowed by: 2 members
Thanked: 9 times

by hey_thr67 » Tue May 08, 2012 11:43 pm
Answer is C
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
GMAT Instructor
Posts: 3225
Joined: Tue Jan 08, 2008 2:40 pmFollowed by: 614 members
Location: Toronto
Thanked: 1710 times
GMAT Score:800

by Stuart@KaplanGMAT » Wed May 09, 2012 4:31 am
metallicafan wrote:Each of the terms in sets R, S, and T are positive integers. If 9 of the integers in R are also in S, 12 of the integers that are in S are also T, and 4 of the integers that are in R are also in T, how many unique positive integers are contained in the three sets?

(1) 1 of the integers is in R, S, and T.
(2) R has 20 terms, S has 24 terms, and T has 30 terms.

Source: www.gmathacks.com
Let's solve using the most powerful rule for data sufficiency: number of equations vs number of unknowns.

First, picture (sorry, I'm not good at computer diagrams!) a Venn diagram with 3 circles. There are 7 different sections: Only R, only S, only T, RS overlap, RT overlap, ST overlap, RST overlap. Think of each of those sections as an unknown, giving us a total of 7 variables.

Next, break down the question stem: it gives us 3 equations related to the unknowns. So, we're missing 4 equations to solve.

1) 1 equation - insufficient.
2) 3 equations - insufficient.

Together: 4 equations - just what we needed - sufficient, choose C!
Image

Stuart Kovinsky | Kaplan GMAT Faculty | Toronto

Kaplan Exclusive: The Official Test Day Experience | Ready to Take a Free Practice Test? | Kaplan/Beat the GMAT Member Discount
BTG100 for $100 off a full course
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1