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 →

probability

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Master | Next Rank: 500 Posts
Posts: 117
Joined: Mon Oct 27, 2008 5:08 pm
Thanked: 1 times
by [email protected] » Thu Dec 25, 2008 9:19 pm
A company that ships boxes to a total of 12 distribution centers uses color coding to identify each center. if either a single color or a pair of two different colors is chosen to represent each center and if each center is uniquely represented by that choice fo one or two colors, what is the minimum number of colors needed for the coding

5
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Master | Next Rank: 500 Posts
Posts: 145
Joined: Mon Sep 29, 2008 1:14 am
Thanked: 13 times

by mental » Thu Dec 25, 2008 10:10 pm
Let n be the number of colours

total choices possible = n + nC2
Requirement n + nC2 = atleast 12

if n=3:
3 + 3C2 = 6 INSUFFICIENT

if n=4:
4 + 4C2 = 10 INSUFFICIENT

if n=5:
5 + 5C2 = 15 more than 12

we see that 4 colours wil result in only 10 possibilities.

So min number of colours required: 5
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 621
Joined: Wed Apr 09, 2008 7:13 pmFollowed by: 4 members
Thanked: 33 times

by vittalgmat » Fri Dec 26, 2008 6:47 pm
This can be solved another way.

So here it goes.
with 1 color: u can represent 2 choices.
color present = choice 1;
color absent = choice 2

extending this
2 colors --> 2*2 or 2^2 = 4 choices.

3 colors -> 2*2*2 or 2^3 = 8 choices

4 colors -> 2*2*2*2 or 2^4 = 16 choices.

So 4 colors is sufficient to represent 12 choices.

my guess is this is a moderate tough problem in the 600 -650 range.. But that is my guess.

As an aside, in the world of computerscience/digital electronics, this logic is very similar to finding out how many bits (binary digits) are needed to represent 'n' number of different characters.

HT Helps
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1