You are not logged in.
Pages: 1
A young boy is going to school from his house in the countryside and has to pass through a small forest. He has a snack with him, which he must eat at the noon break, but he is hungry so he eats it while walking to school.
He realizes, of course, that there will be nothing left to eat at the break!
Fortunately, the forest is full of pears that have fallen off the trees, one every few steps, on his way to school. Some of them are rotten, though, which cannot be discerned from the good ones. Only one pear can fit in his lunch box, so he must take with him exactly one pear. Furthermore, he has with him a small balance scale which he needs for the class of physics. He knows that all good pears have exactly the same weight and also that all rotten pears have different weights from the good ones (can also be different from each other but not necessarily). Knowing also that there are more good pears than rotten, how can he select exactly one good pear without walking back and forth?
Offline
No limitation in number of weightings, right?
Offline
No, the only limitation is that he cannot step back as he walks to the school.
Any clue, guys??
Offline
Pages: 1