Categories

# Extremal Principle for Counting – AMC 10

Extremal Principle is used in a variety of problems in Math Olympiad. The following problem from AMC 10 is a very nice example of this idea.

Extremal Principle is used in a variety of problems in Math Olympiad. The following problem from AMC 10 is a very nice example of this idea.

## AMC 10 Problem 4 (2019)- Based on Extremal Principle

A box contains 28 red balls, 20 green balls, 19 yellow balls, 13 blue balls, 11 white balls, and 9 black balls. What is the minimum number of balls that must be drawn from the box without replacement to guarantee that at least 15 balls of a single color will be drawn?

## Try this problem. Send answers to helpdesk@cheenta.com

Suppose there 5 blue balls, 7 white balls, and 9 green balls. At least how many balls should you pick up (without looking a and without replacement) to be sure that you have picked up at least 4 balls of the same color?

You can also try these problems related to spiral similarity.

You may also click the link to learn its application:- https://www.youtube.com/watch?v=8o8AAWt960o

## By Ashani Dasgupta

Ph.D. in Mathematics from University of Wisconsin Milwaukee (USA)
Founder - Faculty at Cheenta

## 8 replies on “Extremal Principle for Counting – AMC 10”

Maharshi Borahsays:

10 is the answer

That is right

Ajay Poddarsays:

3+3+3+1=10

Correct!

Arghaya Mauliksays:

Is the answer 76? My internet is slow and I’m unable to watch the video. According to my analysis it’s 14+14+14+13+11+9=75, which is the most unlucky case possible, hence to ensure 15 balls of a same colour, we need to take out one extra. That gives 76.

Correct

Arghaya Mauliksays:

The answer to the successive given question is 3+3+3+(1)=10, as 3+3+3 is the most unluckiest condition.
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://usa.cheenta.com/extremal-principle-for-counting-amc-10/", "fetch_time": 1631960479000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-39/segments/1631780056392.79/warc/CC-MAIN-20210918093220-20210918123220-00189.warc.gz", "warc_record_offset": 642302720, "warc_record_length": 33030, "token_count": 477, "char_count": 1792, "score": 4.09375, "int_score": 4, "crawl": "CC-MAIN-2021-39", "snapshot_type": "latest", "language": "en", "language_score": 0.9108448624610901, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00036-of-00064.parquet"}