Lesson In the worst case

Algebra ->  Customizable Word Problem Solvers  -> Misc -> Lesson In the worst case      Log On

Ad: Over 600 Algebra Word Problems at edhelper.com


   


This Lesson (In the worst case) was created by by ikleyn(52776) About Me : View Source, Show
About ikleyn:

In the worst case


Problem 1

I have a pile of socks which contains  12  white socks,  12  black socks,  and  12  red socks.
How many socks must I take from the pile to be certain that I have at least one matching pair?

Solution

3 + 1 = 4.    ANSWER



In the worst case,  your first 3 socks will be of three different colors;


but then any taken fourth sock will match with some of the three previous socks and will create a pair.

Problem 2

A box contains  3  red marbles,  3  blue marbles,  3 green  marbles,  3  yellow and  3  purple marbles.
What is the smallest number of marbles that we need to take out of the box to make sure we have at least  2  marbles of the same color?

Solution

In the worst case, you will take 1 red, 1 blue, 1 green, 1 yellow and 1 purple marble.


After that, whichever other marble you will take from the box, you will have at least 2 marbles of the same color.


ANSWER.  6 marbles.

Problem 3

A box contains  7  red cards,  2 blue cards,  3 green cards.
What is the he smallest number of cards we must take from the box to make sure that we have  2  red cards ?

Solution

In the worst case, we should take all blue cards (2) and all green cards (3).


    2 + 3 = 5.


After taking the 6-th card we inevitably will have at least one red card,

and after taking the 7-th card we inevitably will have at least two red cards.


ANSWER.  After taking 7 (seven) cards we inevitably will have at least two red cards.

Problem 4

A box contains  4  red cards,  2  blue cards and  3  green cards.
What is the smallest number of cards we must take from the box to make sure that we have at least  2  red cards?

Solution

In the worst case, you draw 2 blue and 3 green cards (in any order).


Then, whichever 2 cards you draw after that, you INEVITABLY will draw 2 red cards.


So, after drawing (2+3) + 2 = 7 cards you are GUARANTEED to have 2 red cards.


ANSWER.  Whatever (2 + 3) + 2 = 7 card you take from the box, at least 2 of them will be red.

Problem 5

Toni has  10  identical blue socks,  14  identical green socks,  and  4  identical red socks in a drawer.
She removes socks from the drawer one at a time at random without looking.
What is the least number of socks that Toni needs to pull out to be sure of having at least  4  pairs of the same color?

Solution

In the worst case scenario,  Toni will pull out 4 identical red socks,  7 identical blue socks and 7 identical green socks,

but still will not have 4 pairs of the same color.


Notice that         4 + 7 + 7 = 18   socks.


But then,  had Toni pull out anyone of remaining socks from the drawer,

this  19-th sock will create four pairs of identical socks,  either blue or green.


Therefore,  the least number of socks that Toni needs to pull out to be sure of having  4  pairs of the same color is  19.

Problem 6

You have a playlist with  12  pop songs and  29  R&B songs. You randomize and hit play.
How many songs do you have to listen to in order to guarantee you hear two songs from the same genre?
How many songs do you have to listen to in order to guarantee you hear at least one  R&B  song and one pop song?

Solution

The answer to the first question is  3 songs.

Among any 3 songs from the given set, at least two INEVITABLY will be of the same genre.



The answer to the second question is 30 songs.

It is because in the worst case I will be forced to listen 29 R&B songs, in a row.

Problem 7

Peter has many socks,  all the same except that they are in five different colors.
He is leaving to catch an early train to go on a business trip,  and he does not want to wake his wife,  so he packs in the dark.
He needs eleven pairs of socks,  each sock in each pair the same color.
How many socks must he take from his drawer to be sure of achieving this?

Solution

It is a nice entertainment problem, and if you solve it for the first time in your life,
it is better do it step by step.


1) How many socks should he take to be sure that there is at least one good pair of the same color ?            

                                                                                                          
       In the worst  case, he will take 5 socks of different color,
                                                                                                          
       but any 6-th sock will match with one of 5, just taken.

       So, 6 socks is enough in this case.



2)   How many socks should he take to be sure that there are at least two good pairs of the same color ? 


       In the previous case, worst case was 5 socks of different colors.

       After adding any 6-th sock, we have one good pair and match,

             but still may have 4 remaining socks of different colors.


       So, we should add the sock #7 to create possible worst case, and then add #8 to have a match guaranteed.

       So, the answer in this case is 8,  which is  "add 2 to 6".


3)   After that, the pattern is clear: to provide next match, we should add 2 socks from the drawer after every previous match.



4)  Following this pattern, I create the table below


        # of matching pairs    1    2     3    4     5     6     7     8     9     10     11

        # of socks to take     6    8    10   12    14    16    18    20    22     24     26


5)   ANSWER.  26 socks.

Problem 8

Eighteen points are equally spaced on a circle,  from which you will choose a certain number at random.
How many do you need to choose to guarantee that you will have the four corners of at least one rectangle?

Solution

Let the points on the circle are numbered consequently from 1 to 18, inclusive.

Let call them  A%5B1%5D, A%5B2%5D, A%5B3%5D, . . . , A%5B18%5D.


Notice that if a rectangle is inscribed in a circle, then its diagonals are DIAMETERS
of the circle. So, the opposite vertices of the rectangle are the opposite points on the circle.


Thus, diagonals of our rectangle connect opposite points on the circle.


Of 18 points A%5B1%5D, A%5B2%5D, A%5B3%5D, . . . , A%5B18%5D, we have 9 pairs with opposite points
(A%5B1%5D,A%5B10%5D), (A%5B2%5D,A%5B11%5D), . . . , (A%5B9%5D,A%5B18%5D).


Now my statement is that the ANSWER to the problem's question is 11 points of 18.


Indeed, among these 11 points, there is at least one pair of opposite points.
Removing this pair, you have remaining 16 points and 11-2 = 9 selected points.
Among these 9 selected points, there is at least one another pair of opposite points.

So, 11 points are ENOUGH, even in the WORST CASE.


From the other side, taking 10 points A%5B1%5D, A%5B2%5D, A%5B3%5D, . . . , A%5B10%5D, it is clear, that
among them, there is ONLY ONE pair (A%5B1%5D,A%5B10%5D) of opposite points to make a diameter/(=a diagonal),
and there are NO points to make another pair/(=another diagonal).



ANSWER.  11 points are needed to choose to GUARANTEE 
         that you will have the four corners of at least one rectangle.


My other additional lessons on Miscellaneous word problems in this site are
    - I do not have enough savings now
    - In a jar, all but 6 are red marbles
    - How many boys and how many girls are there in a family ?
    - What is the last digit of the number a^n ?
    - Find the last three digits of these numbers
    - What are the last two digits of the number 3^123 + 7^123 + 9^123 ?
    - Advanced logical problems
    - Prove that if a, b, and c are the sides of a triangle, then so are sqrt(a), sqrt(b) and sqrt(c)
    - Calculus optimization problems for shapes in 2D plane
    - Calculus optimization problems for 3D shapes
    - Solving some linear minimax problems in 3D space
    - Solving one non-linear minimax problems in 3D space
    - Solving linear minimax problem in three unknowns by the simplex method
    - The "pigeonhole principle" problems
    - Page numbers on the left and right facing pages of an opened book
    - Selected problems on counting elements in subsets of a given finite set
    - How many integer numbers in the range 1-300 are divisible by at least one of the integers 4, 6 and 15 ?
    - Nice problems to setup them using Venn diagram
    - Wrapping a gift
    - In preparation for Halloween
    - Nice entertainment problems related to divisibility property
    - Stars and bars method for Combinatorics problems
    - Math Olympiad level problem on caves and bats
    - Math Olympiad level problem on caught fishes
    - Math Olympiad level problem on pigeonhole principle
    - Math Olympiad level problem on placing books in bookcase
    - OVERVIEW of additional lessons on Miscellaneous word problems

Use this file/link  ALGEBRA-I - YOUR ONLINE TEXTBOOK  to navigate over all topics and lessons of the online textbook  ALGEBRA-I.

Use this file/link  ALGEBRA-II - YOUR ONLINE TEXTBOOK  to navigate over all topics and lessons of the online textbook  ALGEBRA-II.


This lesson has been accessed 2576 times.