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
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
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.

715+ 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.

An jar is filled with red, white, and blue tokens that are e

Expert replies
by hazelnut01 » Tue Apr 04, 2017 5:58 pm
A jar is filled with red, white, and blue tokens that are equivalent except for their color. The chance of randomly selecting a red token, replacing it, then randomly selecting a white token is the same as the chance of randomly selecting a blue token. If the number of tokens of every color is a multiple of 3, what is the smallest possible total number of tokens in the jar?

(A) 9
(B) 12
(C) 15
(D) 18
(E) 21

Source: Manhattan Prep
Official Answer : D
Join the discussion
Source: — Problem Solving |

by Jay@ManhattanReview » Wed Apr 05, 2017 12:50 am
ziyuenlau wrote:A jar is filled with red, white, and blue tokens that are equivalent except for their color. The chance of randomly selecting a red token, replacing it, then randomly selecting a white token is the same as the chance of randomly selecting a blue token. If the number of tokens of every color is a multiple of 3, what is the smallest possible total number of tokens in the jar?

(A) 9
(B) 12
(C) 15
(D) 18
(E) 21

Source: Manhattan Prep
Official Answer : D
Hi ziyuenlau,

Say there are r red, w white, and b blue tokens.

As per the question,

[r/(r+w+b)] * [w/(r+w+b)] = [b/(r+w+b)]

=> [(rw)/(r+w+b)] = b

=> rw = b(r+w+b)

Since r, w and b are multiples of 3, let's assume that r = 3a, w = 3b and b = 3c; where a, b and c are positive integers.

Thus, rw = b(r+w+b) => 3a*3b = 3c(3a+3b+3c)

=> ab = c(a+b+c)

We see that in RHS, c is multiplied to (a+b+c), the sum of a, b, and c, thus, the value of c must be the least among a, b and c.

Say c = 1

Thus, ab = (a+b+1)

Now since a and b must be greater than c = 1, the minimum value they can take = 2

Say a = b = 2

Thus, ab = (a+b+1) => LHS = ab = 2*2 = 4 and RHS = (a+b+1) = (2+2+1) = 5. They are not equal. So this is not possible!

Say a = 2 and b = 3

Thus, ab = (a+b+1) => LHS = ab = 2*3 = 6 and RHS = (a+b+1) = (2+3+1) = 6. They are equal. Thus works.

Thus, a = 2, b = 3 and c = 1.

=> # of red token = 3a = 3*2 = 6
=> # of white token = 3b = 3*3 = 9
=> # of blue token = 3c = 3*1 = 3

=> Total number of tokens = 6 + 9 + 3 = 18.

The correct answer: D

Hope this helps!

Relevant book: Manhattan Review GMAT Combinatorics and Probability Guide

-Jay
_________________
Manhattan Review GMAT Prep

Locations: Helsinki | Copenhagen | Bukarest | Riga | and many more...

Schedule your free consultation with an experienced GMAT Prep Advisor! Click here.
Join the discussion

by GMATGuruNY » Wed Apr 05, 2017 3:22 am
ziyuenlau wrote:A jar is filled with red, white, and blue tokens that are equivalent except for their color. The chance of randomly selecting a red token, replacing it, then randomly selecting a white token is the same as the chance of randomly selecting a blue token. If the number of tokens of every color is a multiple of 3, what is the smallest possible total number of tokens in the jar?

(A) 9
(B) 12
(C) 15
(D) 18
(E) 21
We can PLUG IN THE ANSWERS, which represent the total number of tokens.
When the correct answer choice is plugged in, P(red then white) = P(blue).
Since the question stem asks for the SMALLEST POSSIBLE TOTAL, start with the smallest answer choice.

A: 9 tokens, implying 3 red, 3 white, 3 blue
P(red then white) = 3/9 * 3/9 = 1/9.
P(blue) = 3/9 = 1/3.
Since P(red then white) < P(blue), eliminate A.

To increase the value of P(red then white), R+W must constitute a greater portion of the total.
Thus, as we test the remaining answer choices, we should keep increasing the value of R+W.

B: 12 tokens, allowing for 6 red, 3 white, 3 blue
P(red then white) = 6/12 * 3/12 = 1/8.
P(blue) = 3/12 = 1/4.
Since P(red then white) < P(blue), eliminate B.

C: 15 tokens
Case 1: 9 red, 3 white and 3 blue, in which case P(red then white) = 9/15 * 3/15 = 3/25.
Case 2: 6 red, 6 white and 3 blue, in which case P(red then white) = 6/15 * 6/15 = 4/25.
P(blue) = 3/15 = 1/5.
In each case, P(red then white) < P(blue).
Eliminate C.

Notice that Case 2 -- in which R=W -- yields a greater result than Case 1.
Thus, in D and E, we should test cases in which the values for R and W are as close as possible.

D: 18 tokens, allowing for 9 red, 6 white, 3 blue
P(red then white) = 9/18 * 6/18 = 1/6.
P(blue) = 3/18 = 1/6.
Success!

The correct answer is D.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Join the discussion