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 →

Venn Diagram - Need help with a question

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Newbie | Next Rank: 10 Posts
Posts: 2
Joined: Sun Aug 08, 2010 5:03 am
by prabhu.mohan » Sun Aug 08, 2010 6:16 am
Hi All,

I am facing difficulty solving a Venn diagram problem. I'm posting it here for some help!!

Among 300 people, each one likes atleast one fruit among apple, orange and pineapple. 150 like pineapple and 180 like apple. If the number of people who like exactly one fruit it 160, what is the maximum possible number of people who like orange??
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Newbie | Next Rank: 10 Posts
Posts: 1
Joined: Sun Aug 08, 2010 11:30 am

by jeegmat » Sun Aug 08, 2010 11:40 am
Hi Prabhu,

the Following explanation would suffice

For the Third set to be maximum it is better to be disjoint or have a least possible intersection with the others.
because the set for only one is defined.

I think the answer is 110.


[/img]
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1