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

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

130-point score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Colour

Expert replies
by shashank.ism » Wed Feb 10, 2010 10:40 am
Four circles having radius 1 cm, 2 cm, 3 cm and 4 cm intersect each other to create maximum possible number of bounded regions. What is the minimum possible number of different colours required to fill in the bounded regions so that no two adjacent regions are filled with the same colour?


A) 5
B) 4
C) 3
D) 6
E) 7
My Websites:
www.mba.webmaggu.com - India's social Network for MBA Aspirants

www.deal.webmaggu.com -India's online discount, coupon, free stuff informer.

www.dictionary.webmaggu.com - A compact free online dictionary with images.

Nothing is Impossible, even Impossible says I'm possible.
Join the discussion
Source: — Problem Solving |

by harsh.champ » Wed Feb 10, 2010 9:45 pm
shashank.ism wrote:Four circles having radius 1 cm, 2 cm, 3 cm and 4 cm intersect each other to create maximum possible number of bounded regions. What is the minimum possible number of different colours required to fill in the bounded regions so that no two adjacent regions are filled with the same colour?


A) 5
B) 4
C) 3
D) 6
E) 7
For maximum possible bounded regions,there will always be a 2-set intersection.Let the circles be A,B,C,D.
1st circle-color 1
2nd circle-color 2
3rd circle-color 1
4th circle-color 2
intersections of 2 sets will be of the 3rd color.[spoiler]
Hence,C.[/spoiler]


What's the answer??
It takes time and effort to explain, so if my comment helped you please press Thanks button :)



Just because something is hard doesn't mean you shouldn't try,it means you should just try harder.

"Keep Walking" - Johnny Walker :P
Join the discussion