LOGIC PROBLEMS  You are mixing cement and the recipe calls for five gallons of water.

You have a garden hose giving you all the water you need. The problem is that you only have a four gallon bucket and a seven gallon bucket and nether has graduation marks. Find a method to measure five gallons.

Answer: Pour the four gallon bucket filled with water into the empty seven gallon bucket. Fill the four gallon bucket up again and poor as much as you can into the seven gallon bucket until the seven gallon bucket is fill. Now there is one gallon left in the four gallon bucket. Empty the seven gallon bucket and transfer the one gallon of water into the seven gallon bucket. Fill the four gallon bucket one more time, then pour the four gallons into the seven gallon bucket making which already has one gallon in it, making a total of five gallons

 The Pot of Beans A pot contains 75 white beans and 150 black ones. Next to the pot is a large pile of black beans. A somewhat demented cook removes the beans from the pot, one at a time, according to the following strange rule: He removes two beans from the pot at random. If at least one of the beans is black, he places it on the bean-pile and drops the other bean, no matter what color, back in the pot. If both beans are white, on the other hand, he discards both of them and removes one black bean from the pile and drops it in the pot. At each turn of this procedure, the pot has one less bean in it. Eventually, just one bean is left in the pot. What color is it? Answer: White. The cook only ever removes the white beans two at a time, and there are an odd number of them. When the cook gets to the last white bean, and picks it up along with a black bean, the white one always goes back into the pot. The Pigeon Two friends decide to get together; so they start riding bikes towards each other. They plan to meet halfway. Each is riding at 6 MPH. They live 36 miles apart. One of them has a pet carrier pigeon and it starts flying the instant the friends start traveling. The pigeon flies back and forth at 18 MPH between the 2 friends until the friends meet.

How many miles does the pigeon travel? Hint: You must presume that the pigeon can go from 0 to 18 mph instantaneously, plus also turn around instantaneously.

Answer: 54.

It takes 3 hours for the friends to meet; so the pigeon flies for 3 hours at 18 MPH = 54 miles.

 The Emperor

You are the ruler of a medieval empire and you are about to have a celebration tomorrow. The celebration is the most important party you have ever hosted. You've got 1000 bottles of wine you were planning to open for the celebration, but you find out that one of them is poisoned. The poison exhibits no symptoms until death. Death occurs within ten to twenty hours after consuming even the minutest amount of poison. You have over a thousand slaves at your disposal and just under 24 hours to determine which single bottle is poisoned. You have a handful of prisoners about to be executed, and it would mar your celebration to have anyone else killed. What is the smallest number of prisoners you must have to drink from the bottles to be absolutely sure to find the poisoned bottle within 24 hours? Hint: It is much smaller than you first might think. Try to solve the problem first with one poisoned bottle out of eight total bottles of wine. Answer: 10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

 Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine. Bottle 1 Bottle 8 Prisoner A Prisoner B Prisoner C Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7

X X

X X X

X X X X

X X X

In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combinations so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a millilitre from each bottle, they will only consume the equivalent of about one bottle of wine each.

 Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combinations where all but one prisoner must sip from the wine. By avoiding these two types of combinations you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

 The Fake Coin You have twelve coins. You know that one is fake. The only thing that distinguishes the fake coin from the real coins is that its weight is imperceptibly different. You have a perfectly balanced scale. The scale only tells you which side weighs more than the other side. What is the smallest number of times you must use the scale in order to always find the fake coin? Use only the twelve coins themselves and no others, no other weights, no cutting coins, no pencil marks on the scale. etc. These are modern coins, so the fake coin is not necessarily lighter. Presume the worst case scenario, and don't hope that you will pick the right coin on the first attempt. Answer: 3.

If you knew the fake coin was lighter, then the solution would have an easy explanation. But you do not. So.... Number the coins 1 through 12. 1. Weigh coins 1,2,3,4 against coins 5,6,7,8. 1.1. If they balance, then weigh coins 9 and 10 against coins 11 and 8 (we know from the first weighing that 8 is a good coin). 1.1.1. If the second weighing also balances, we know coin 12 (the only one not yet weighed) is the counterfeit. The third weighing indicates whether it is heavy or light. 1.1.2. If (at the second weighing) coins 11 and 8 are heavier than coins 9 and 10, either 11 is heavy or 9 is light or 10 is light. Weigh 9 against 10. If they balance, 11 is heavy. If they don't balance, you know that either 9 or 10 is light, so the top coin is the fake. 1.1.3 If (at the second weighing) coins 11 and 8 are lighter than coins 9 and 10, either 11 is light or 9 is heavy or 10 is heavy. Weigh 9 against 10. If they balance, 11 is light. If they don't balance, you know that either 9 or 10 is heavy, so the bottom coin is the fake. 1.2. Now if (at first weighing) the side with coins 5,6,7,8 are heavier than the side with coins 1,2,3,4. This means that either 1,2,3,4 is light or 5,6,7,8 is heavy. Weigh 1,2, and 5 against 3,6, and 9. 1.2.1. If (when we weigh 1,2, and 5 against 3,6 and 9) they balance, it means that either 7 or 8 is heavy or 4 is light. By weighing 7 and 8 we obtain the answer, because if they balance, then 4 has to be light. If 7 and 8 do not balance, then the heavier coin is the counterfeit. 1.2.2. If (when we weigh 1,2, and 5 against 3,6 and 9) the right side is heavier, then either 6 is heavy or 1 is light or 2 is light. By weighing 1 against 2 the solution is obtained. 1.2.3. If (when we weigh 1,2, and 5 against 3, 6 and 9) the right side is lighter, then either 3 is light or 5 is heavy. By weighing 3 against a good coin the solution is easily arrived at. 1.3 If (at the first weighing) coins 1,2,3,4 are heavier than coins 5,6,7,8 then repeat the previous steps 1.2 through 1.2.3 but switch the numbers of coins 1,2,3,4 with 5,6,7,8. . The Card Trick

I ask Alex to pick any 5 cards out of a deck with no Jokers. He can inspect then shuffle the deck before picking any five cards. He picks out 5 cards then hands them to me (Peter can't see any of this). I look at the cards and I pick 1 card out and give it back to Alex. I then arrange the other four cards in a special way, and give those 4 cards all face down, and in a neat pile, to Peter.

Peter looks at the 4 cards i gave him, and says out loud which card Alex is holding (suit and number). How? The solution uses pure logic, not sleight of hand. All Peter needs to know is the order of the cards and what is on their face, nothing more. Hint: There are only 4 suits, so there will be at least two cards of one suit, one higher and another lower. By careful selection and placement the cards can be used to encode the exact number and suit of the selected card.

 100 Gold Coins

Five pirates have obtained 100 gold coins and have to divide up the loot. The pirates are all extremely intelligent, treacherous and selfish (especially the captain). The captain always proposes a distribution of the loot. All pirates vote on the proposal, and if half the crew or more go "Aye", the loot is divided as proposed, as no pirate would be willing to take on the captain without superior force on their side. If the captain fails to obtain support of at least half his crew (which includes himself), he faces a mutiny, and all pirates will turn against him and make him walk the plank. The pirates start over again with the next senior pirate as captain. What is the maximum number of coins the captain can keep without risking his life? Hint: What happens if there are two pirates? Who completely loses out? What happens if there are three pirates? Who completely loses out? What happens if there are four pirates? Which two pirates completely lose out? Answer: 98 The captain says he will take 98 coins, and will give one coin to the third most senior pirate and another coin to the most junior pirate. He then explains his decision in a manner like this... If there were 2 pirates, pirate 2 being the most senior, he would just vote for himself and that would be 50% of the vote, so he's obviously going to keep all the money for himself.

If there were 3 pirates, pirate 3 has to convince at least one other person to join in his plan. Pirate 3 would take 99 gold coins and give 1 coin to pirate 1. Pirate 1 knows if he does not vote for pirate 3, then he gets nothing, so obviously is going to vote for this plan.

If there were 4 pirates, pirate 4 would give 1 coin to pirate 2, and pirate 2 knows if he does not vote for pirate 4, then he gets nothing, so obviously is going to vote for this plan.

As there are 5 pirates, pirates 1 & 3 had obviously better vote for the captain, or they face choosing nothing or risking death.

Answer: Pick out two cards of the same suit. Select a card for Alex where adding a number no greater than six will result in the number of the other card of the same suit. Adding one to the Ace would cycle to the beginning again and result in a Two. E.g. if you have a King and a Six of Diamonds, hand the King to Alex. The other three cards will be used to encode a number from 1 through 6. Devise a system with Peter to rank all cards uniquely from 1 to 52 (e.g. the two of hearts is 1, the two of diamonds is fourteen etc...). That will allow you to choose from six combinations, depending on where you put the lowest and highest cards.

 The Most Intelligent Prince A king wants his daughter to marry the smartest of 3 extremely intelligent young princes, and so the king's wise men devised an intelligence test. The princes are gathered into a room and seated, facing one another, and are shown 2 black hats and 3 white hats. They are blindfolded, and 1 hat is placed on each of their heads, with the remaining hats hidden in a different room. The king tells them that the first prince to deduce the color of his hat without removing it or looking at it will marry his daughter. A wrong guess will mean death. The blindfolds are then removed. You are one of the princes. You see 2 white hats on the other prince's heads. After some time you realize that the other prince's are unable to deduce the color of their hat, or are unwilling to guess. What color is your hat? Note: You know that your competitors are very intelligent and want nothing more than to marry the princess. You also know that the king is a man of his word, and he has said that the test is a fair test of intelligence and bravery. Hint: Based on what you know, why are the other princes unable to solve this puzzle? Answer: White. The king would not select two white hats and one black hat. This would mean two princes would see one black hat and one white hat. You would be at a disadvantage if you were the only prince wearing a black hat.

If you were wearing the black hat, it would not take long for one of the other princes to deduce he was wearing a white hat. If an intelligent prince saw a white hat and a black hat, he would eventually realize that the king would never select two black hats and one white hat. Any prince seeing two black hats would instantly know he was wearing a white hat. Therefore if a prince can see one black hat, he can work out he is wearing white. Therefore the only fair test is for all three princes to be wearing white hats. After waiting some time just to be sure, you can safely assert you are wearing a white hat.  The Greek Philosophers One day three Greek philosophers settled under the shade of an olive tree, opened a bottle of Retsina, and began a lengthy discussion of the Fundamental Ontological Question: Why does anything exist? After a while, they began to ramble. Then, one by one, they fell asleep. While the men slept, three owls, one above each philosopher, completed their digestive process, dropped a present on each philosopher's forehead, the flew off with a noisy "hoot." Perhaps the hoot awakened the philosophers. As soon as they looked at each other, all three began, simultaneously, to laugh. Then, one of them abruptly stopped laughing. Why? Hint: The one who stopped laughing, asked himself what the other philosophers were seeing that made them laugh. Answer: If he (the smartest philosopher) had nothing on his head, then he realized that the second smartest philosopher would have quickly worked out that the third smartest was laughing only at the second smartest philosopher, and thus the second smartest philosopher would have stopped laughing. Three men in a cafe order a meal the total cost of which is $15. They each contribute $5. The waiter takes the money to the chef who recognizes the three as friends and asks the waiter to return $5 to the men. The waiter is not only poor at mathematics but dishonest and instead of going to the trouble of splitting the $5 between the three he simply gives them $1 each and pockets the remaining $2 for himself. Now, each of the men effectively paid $4, the total paid is therefore $12. Add the $2 in the waiters pocket and this comes to $14.....where has the other $1 gone from the original $15?

Answer: The payments should equal the receipts. It does not make sense to add what was paid by the men ($12) to what was received from that payment by the waiter ($2) Although the initial bill was $15 dollars, one of the five dollar notes gets changed into five ones. The total the three men ultimately paid is $12, as they get three ones back. So from the $12 the men paid, the owner receives $10 and the waiter receives the $2 difference. $15 - $3 = $10 + $2 The Boxes There are three boxes. One is labeled "APPLES" another is labeled "ORANGES". The last one is labeled "APPLES AND ORANGES". You know that each is labeled incorrectly. You may ask me to pick one fruit from one box which you choose. How can you label the boxes correctly? Answer: Pick from the one labeled "Apples & Oranges". This box must contain either only apples or only oranges. E.g. if you find an Orange, label the box Orange, then change the Oranges box to Apples, and the Apples box to "Apples & Oranges" The Cannibals Three cannibals and three anthropologists have to cross a river. The boat they have is only big enough for two people. The cannibals will do as requested, even if they are on the other side of the river, with one exception. If at any point in time there are more cannibals on one side of the river than anthropologists, the cannibals will eat them. What plan can the anthropologists use for crossing the river so they don't get eaten? Note: One anthropologist can not control two cannibals on land, nor can one anthropologist on land control two cannibals on the boat if they are all on the same side of the river. This means an anthropologist will not survive being rowed across the river by a cannibal if there is one cannibal on the other side. Answer: First, two cannibals go across to the other side of the river, then the rower gets called back. Next, the rowing cannibal takes the second across and then gets called back, so now there are two cannibals on the far side. Two anthropologists go over, then one anthropologist accompanies one cannibal back, so now there is one anthropologist and one cannibal on the far side.

The last two anthropologists go over to the far side, so now all the anthropologists are across the other side, along with the boat and one cannibal. In two trips, the cannibal on the far side takes the boat and ferries the other two cannibals across the river. The Father A mother is 21 years older than her child. In exactly 6 years from now, the mother will be exactly 5 times as old as the child. Where's the father?

Answer: With the mother. If you do the math, you find out the child will be born in 9 months.

The Double Jeopardy Doors You are trapped in a room with two doors. One leads to certain death and the other leads to freedom. You don't know which is which. There are two robots guarding the doors. They will let you choose one door but upon doing so you must go through it. You can, however, ask one robot one question. The problem is one robot always tells the truth ,the other always lies and you don't know which is which. What is the question you ask? Hint: The two robots know each others personality. That they talk when they're bored, lonely, etc. Try to get the two robots to cancel their evil & good ways out. Answer: Ask one robot what the other robot would say, if it was asked which door was safe. Then go through the other door.

The Socks Cathy has six pairs of black socks and six pairs of white socks in her drawer. In complete darkness, and without looking, how many socks must she take from the drawer in order to be sure to get a pair that match?

Socks do not come in in left and right, so any black will pair with any other black and any white will pair with any other white. If you have three socks and they are either colored black or white, then you will have at least two socks of the same color, giving you one matching pair.

There is something about Mary Mary's mum has four children. The first child is called April. The second May. The third June. What is the name of the fourth child? Answer: Mary. Mary's mothers fourth child was Mary herself.

The Frog A frog is at the bottom of a 30 meter well. Each day he summons enough energy for one 3 meter leap up the well. Exhausted, he then hangs there for the rest of the day. At night, while he is asleep, he slips 2 meters backwards. How many days does it take him to escape from the well? Note: Assume after the first leap that his hind legs are exactly three meters up the well. His hind legs must clear the well for him to escape. Hint: Try to think the problem through for a five meter well. Now what is the solution for the 30 meter well? Answer: 28 Each day he makes it up another meter, and then on the twenty seventh day he can leap three meters and climb out.

Bulacan State University Malolos, Bulacan College of Criminal Justice Education

PROJECT IN PHILOSOPHY ( LOGIC PROBLEMS)

SUBMITTED BY: CARPIO, CHARRISE G. BALM 1-B

SUBMITTED TO: MR. RAYMUNDO FAUSTINO