Strategies; considering extreme cases.

Problem.

In a drawer, there are 8 blue socks, 6 green socks, and 12 black socks. What is the smallest number of socks that must be taken from the drawer without looking at the socks to be certain of having 2 socks of the same color.

Solution

At first glance this problem appears to be similar to the model problem discussed previously. However,there is a slight difference. In this case, we are looking for a matching pair of socks of any color. We now apply extreme case reasoning, similar to that which we used previously. The worst case scenario has us picking 1 blue sock, and 1 black sock in our first three picks. Thus, the fourth sock must provide us with a matching pair, regardless of what color it is. The smallest number of socks to gurantee a matching pair is 4.

Iklan

Tentang matitaputtychristi

Friendly
Pos ini dipublikasikan di Problem Solving, Strategy. Tandai permalink.

Tinggalkan Balasan

Isikan data di bawah atau klik salah satu ikon untuk log in:

Logo WordPress.com

You are commenting using your WordPress.com account. Logout / Ubah )

Gambar Twitter

You are commenting using your Twitter account. Logout / Ubah )

Foto Facebook

You are commenting using your Facebook account. Logout / Ubah )

Foto Google+

You are commenting using your Google+ account. Logout / Ubah )

Connecting to %s