There are twelve identical looking islanders and a seesaw. One of the islanders weighs slightly more or less then the other 11, and you must find out which. What is the least amount of times you can use the seesaw to solve this problem?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This problem is similar to a balance puzzle , except this time each islander is like a coin and the seesaw is like the balance. Since the target islander weighs differently than the others, the least number of weighings for c = 1 2 islanders will be ⌈ lo g 3 ( 2 c + 1 ) ⌉ = 3 .