in Quantitative Aptitude recategorized by
1,041 views
1 vote
1 vote

There are $4$ red, $5$ green, and 6 blue balls inside a box. If $N$ number of balls are picked simultaneously, what is the smallest value of $N$ that guarantees there will be at least two balls of the same colour?

One cannot see the colour of the balls until they are picked.

  1. $4$
  2. $15$
  3. $5$
  4. $2$
in Quantitative Aptitude recategorized by
by
1.0k views
Migrated from GO Civil 6 months ago by Arjun

1 Answer

2 votes
2 votes

The Pigeonhole Principle tells us that if we have more objects to put into boxes than there are boxes, at least one box must contain multiple objects.

In this case, each color (red, green, and blue) can be considered a "box," and the balls we pick are the objects. We want to find the smallest value of $N$ such that we are guaranteed to have at least two balls of the same color.

The worst-case scenario for this problem is when we pick one ball of each color $\text{(1 red, 1 green, 1 blue)}.$ In this case, $N$ would be $3,$ and we still don't have two balls of the same color. However, if we pick just one more ball (regardless of its color), we will have at least two balls of the same color.

So, the smallest value of $N$ that guarantees there will be at least two balls of the same color is $4.$

Correct Answer: A

References:

Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true