#51 · ypercube
19 Jul 2004
yes, congrats to Eduard! also "Batman and Robin". Also there is a movie with the title "midnight express".
Public forum discussion.
19 Jul 2004
yes, congrats to Eduard! also "Batman and Robin". Also there is a movie with the title "midnight express".
19 Jul 2004
I would not have figured out yper's #2 riddle in a million years. As I just told our riddle master, Klaashaas, that the last movie I saw was "Titanic" about 10 years ago. :)
19 Jul 2004
In a battle the General of the winning army wants to give the prisoners of war another chance to live. He makes the following proposal
Tomorrow i will line all you you up in a column and you will only se the prisoner in front of you. You will then be given a hat of white,blue or red colour. Starting from the prisoner that see all the others you will call out the colour of your own hat. If you call out the wrong colour you will be beheaded, and if you call out anything else but one of the three colour you will all be beheaded. If you call out the right colour you are free to go.
The prisoners gather together and come up with a plan how to save as many of them as possible.
How many can they save and how do they do it?
19 Jul 2004
Correction to the above riddle. The prisoners will see all the prisoners in front of them, but not their own hat(of course) and not the hats of the ones behind.
19 Jul 2004
klaashaas,
good question - I made a mistake. (sigh) It's correct.
19 Jul 2004
Glenn's solution is correct and the only one I'm aware of. I didn't mention the clock explicitly, but I mentioned the 12th ring of a bell.
19 Jul 2004
The riddle of Johan Roos.
To save at least every second is easy. Is there a way to save more?
19 Jul 2004
yes, the prisoners can do better than that ;)
19 Jul 2004
1,3,4,6 use these digits all exactly once to make 24 using + - * and/or / (addition, substraction, multiplication and division in case some of us use different notation). You mustn't combine digits to make another number (somehow i always get this question asked when posing this riddle, so from now on i add it).
19 Jul 2004
Not to spoil your riddle... you may use brackets and f..., right?
19 Jul 2004
yes and yes ;).
20 Jul 2004
FOr Roos column of POWs puzzle, the prisoners can guarantee
that all but one of them survive. In fact you can increase
the number of hat colors to as large as you like and still
guarantee that all but one of them survive! :-)
Here's a nice geometric puzzle that is virtually unknown.
Don't worry, you don't need any geometric identities or
formulas to solve this, you just have to look at in the
right way.
The counter-intuitive trip:
===========================
One summer day while painting his house, Jack placed a
ladder flat against the side of his house (perpendicular
to the ground) and began to climb it. When he got half-
way up, he tipped over backwards. It's easy to see that
while clinging to the middle rung, his trip from point A
on the side of the house to point B on the ground followed
a path that is exactly 1/4 of a circle whose center is at
the point where his house meets the ground and whose radius
is half the length of the ladder.
Six months later, Jack had recovered from his injuries and
decided to finish the job despite the fact that it was now
in the middle of winter. Being a slow learner, Jack placed
the ladder exactly as before and again had a problem when
he reached the half-way point. The ground was now a sheet
of ice and instead of tipping backwards, the base of the
ladder slipped out and the top slid down the side of the
house. Jack clinging to the center rung wound up moving
from point A on the side of his house to point B on the
ground as before.
The problem: Describe the path he traveled the second time.
20 Jul 2004
Glenn is right :-)
And for all you others, how do they do it ;)
20 Jul 2004
Here is another(well known) riddle
A man has 3000 bananas and a camel.
In front of him lies a desert 1000 miles wide he has to cross.
Unfortunately his camel can only carry a maximum of 1000 bananas and the camel needs to eat one banana every mile he travels.
How many bananas can the man bring over the desert?
20 Jul 2004
Scale weight riddle #1:
This is a classic, and you've probably seen it before:
You have 12 balls and a scale weight. All balls weight the same, except for one, which is either heavier or lighter than the others.
Using the weight only 3 times, decide which ball is different, and wether it is heavier or lighter than the others.
20 Jul 2004
Scale weight riddle #2:
More fun: Same weight, and again, one ball weights either more or less than the others, who all have the same weight. Now you can use the weight 4 times.
What is the maximum number of balls you can start out with, and still be certian that you can find the ball that is different, and be able to determine wether it is heavier or lighter than the others?
21 Jul 2004
Arrange seven distinct points on a plane such that for
every collection of three of these points, at least two of
them are exactly one unit apart. (try it! It's harder than
it sounds.)
21 Jul 2004
A man had jut boarded an airplane when there was i problem and the pilot urged everyone to use their parrachute and jump. The man jumped out and eventually landed in water. As he knew the region well he knew he had landed in a river which was exactly 100m wide and totally straight for many miles. The problem was that it was night and he had lost all sense of direction.
What is the shortest distance the man need to swim in order to be sure to reach the shore?
PS: This problem needs some math experience
21 Jul 2004
What is the shortest distance the man need to swim in order
to be sure to reach the shore?
He can do it in 231m. I don't know if there is a better solution.
21 Jul 2004
There are better solutions ;)
21 Jul 2004
> What is the shortest distance the man need to swim in
> order to be sure to reach the shore?
Well, suppose we find such a theoretical path - would that
help the man at all? Given that it's pitch dark, and that he
is in a river, having lost all sense of direction, would he
be able to swim the optimal path or curve? It would probably
hard to swim a specific curve even if it's daylight and the
river isn't flowing. ;-)
21 Jul 2004
Yes Abigail, I am afraid the man succumbed to the forces of nature in the true version. Although he managed to call me on his cellphone and tell me he had come up with a nice riddle(as he knew I like riddles so much). And by the way he mentioned the rived wasnt flowing as he felt the bottom on some places ;)
21 Jul 2004
A normal coin weighs 0.999 ounces, a heavy coin weighs
1.049 ounces, and a light coin weighs 0.949 ounces. You
have a postage scale that you can set for any whole number
of ounces and it will tell you if the load weighs more or
less than the set amount (the scale is sensitive enough
to detect that a single normal coin weighs less than one
ounce). You have two bags of coins. One bag contains 20 normal coins; the other bag contains one heavy coin,
one light coin, and 18 normal coins; but you don't know
which bag is which. How many weighings do you need in order
to find out which bag contains the off-weight coins?
21 Jul 2004
Johan, the "Old Man River" problem is a good one. Let me make sure I understood the problem correctly:
(a) The man landed in an arbitrary spot in the river,
(b) the river water is almost stagnant, such that the flow speed is irrelevant, (if so, why don't you modify your river into a corn field? :) )
(c) The man is capable of making circular curves.
21 Jul 2004
Tim, you have understood correctly.
I like the corn field alternation, I use that from now on :-)
23 Jul 2004
"Have you guessed the riddle yet?" the Hatter said, turning to Alice again.
"No, I give up," Alice replied. "What's the answer?"
"I haven't the slightest idea," said the Hatter.
"Nor I," said the March Hare.
Alice sighed wearily. "I think you might do something better with the time," she said, "then wasting it in asking riddles that have no answers."
"If you knew Time as well as I do," said the Hatter, "you wouldn't talk about wasting 'it'. It's 'him'."
"I don't know what you mean," said Alice.
"Of course you don't!" the Hatter said, tossing his head contemptuously. "I daresay you never even spoke to Time!"
23 Jul 2004
As this riddle thread originated in the streetsoccers forum i think it would be nice with a "soccer problem"
Suppose you are a left winger running towards the opponent goal on a line parallell to the side line to the left of the goal.
When should he shoot at the goal?
That is when is the angle(that the player sees) between the goalposts largest.
The solution to this problem can be stated without mentioning any distances ;)
23 Jul 2004
Well, there are many lines running parallel to that line. Since the answer is trivial for some lines (for instance, for any line that will run through the goal, the answer would be "on the goal line"), do you have a particular line in mind, or do you want an answer with a formula?
23 Jul 2004
He runs to the left of the goal. So the line does not go through the goal. Otherwise the answer is independent of what line he runs along.
23 Jul 2004
i stole this one from ecoist, but it's a good simple one
prove that n^4 + 4 is never prime except for n=1
23 Jul 2004
That seems to be a direct result from fermat's little theorem. a^(p-1)=1 modulo p, substitute p with 5 and add 4 to both sides and we get that a^4 + 4=0 modulo 5, or always a multiple of 5, hence the only primenumber possible is 5 itself being 1^4 + 4
23 Jul 2004
this was more posed toward people who haven't had number theory, but FLT is good too...this problem can be solved with high school algebra
23 Jul 2004
Ok, hope the html works. Whoever doesn't want to see the solution, don't move ur cursor over the black text while pressing down the button (like copy pasting).
n^4+4=(n^2+2n+2)(n^2-2n+2), which factors the number. Unless ofcourse n^2-2n+2=1 or n=1.
23 Jul 2004
wow, you are good....2 solutions in 10 minutes, when i first started studying math, before i had heard of FLT, it took me about an hour to get that...
23 Jul 2004
a^(p-1)=1 mod p only holds if (a,p)=1,ie no common divisor
for example it doesn't hold for a = 5 and p = 5
23 Jul 2004
ok, well his second one is still good
23 Jul 2004
yes, the second one is nice :-)
23 Jul 2004
Not only was I impressed by Michael's quick solution, but I was equally impressed by his html code!!
I have another maths puzzle which I found very elegant: (I hope it gives Michael more of a challenge)
If n^2 + n + 1 = 0,
then what does n^17 + n^10 + n^6 equal??
There is a solution that uses schoolboy algebra...
23 Jul 2004
More generally, n^4 + 4m^4 is never prime unless n = m = +/- 1 (you can probably guess how to prove it).
23 Jul 2004
If n^2 + n + 1 = 0, then n^3 = 1, so n^17 + n^10 + n^6 = n^2 * (n^3)^5 + n * (n^3)^3 + (n^3)^2 = n^2 + n + 1 = 0.
23 Jul 2004
What's the derivative of x^(1/ln x) ?
23 Jul 2004
e
23 Jul 2004
sorry, derivative is 0, function is e
23 Jul 2004
Yes. I have once watched a maths professor get it wrong. :-)
23 Jul 2004
i have heard most of the puzzles here and have a few variants to offer:
1) make 24 using 5 5 5 1 and use as many + - * / () as you like. (this is not as neat as 1 3 4 6, however.) i actually used to play this game with cards -- remove the face cards (JQK) from a deck, and then turn over 4 cards and whoever gets 24 fastest slaps the table, says his solution, and wins the cards. after a while this becomes a game of pure speed, and some of my friends moved onto 6 cards for the result of 108.
2) Roo's POW column problem is nice, but as stated a prisoner can say as many words as he likes (before being killed -- i.e. sacrificing himself), and therefore there is a trivial solution to save everyone but the last one. how about we restrict the problem slightly: each prisoner can only call out 1 of the 3 colors. (i know in "real life" nothing can prevent a self-sacrificial prisoner from saying other words, or saying more than 1 word, but this is a puzzle!) it is still easy to save half the prisoners, but can you save more?
3) a nice twist on the scale puzzle:
You have _14_ balls and a scale weight. All balls weight the same, except for one, which is either heavier or lighter than the others. You also have 1 extra ball (a 15th ball) which you know has standard weight (i.e. equal to 13 of the 14 balls). Using the weight only 3 times, decide which ball is different. Marius -- this puzzle is especially for you since you might find the twist interesting.
4) finally, a variant on a well-known logic puzzle which i'm surprised has not yet been quoted here:
You are in a room with 2 doors. One leads to heaven, and one leads to hell, but you dont know which is which. There are two figures in the room, one standing next to each door. One is an angel who always tell the truth, and the other is a devil who always lies, but they look exactly alike and you cannot tell who is who. You also dont know whether the angel is standing next to the heaven door or the hell door. You are allowed to ask one of them one Yes/No question, and after that figure answers, you must choose a door to enter.
Now (here's the unusual twist) angels and devils are very proud and they will not answer you in any earthly language. They of course understand your langugage, but they will only answer in their own language. You know that in their language, the words for "yes" and "no" are "google" and "yahoo", but you dont remember whether yes is google (and no is yahoo), or yes is yahoo (and no is google). So finally here is the puzzle: what question do you ask so that you can find the door to heaven?
have fun!
26 Jul 2004
To Tasmanian Devil: I think your solution to goat riddle isn't right. After the host opened the door with a goat behind it it's clear that you have chance 1/2 for goat and 1/2 for BMW. There is no advantage of switch.
Since I suppose it won't convince you there is a bit more explanation. The main problem with your solution is that the probability *does* change after host openes the door because now it is conditional probability (we have additional information).
So let A be event that you chose the door with BMW in your first atempt, B be the event that the host chose the one of the remaining doors with goat, A' and B' be the complement events respectively. Then obviously P(A)=1/3, P(A')=2/3, P(A&B)=1/3*1=1/3 and so P(B|A)=P(B&A)/P(A)=1; P(A'&B)=2/3*1/2=1/3 and so P(B|A')=P(B&A')/P(A')=1/2. So we have:
P(B)=P(B|A)*P(A)+P(B|A')*P(A')=1*1/3+1/2*2/3=2/3
so finally for probability P(A|B) that you won BMW *without* switch *after* you know that at other doors is got, we have
P(A|B)=P(A&B)/P(B)=(1/3)/(2/3)=1/2,
which is quite unsurprising. [Well, at least for me. :)]
And yes, I know that this solution can be shortened - for example we can compute P(B) directly as P(A&B)+P(A'&B). [After all the shortest solution is probably in my first paragraph. :)] But I think that this solution better shows the conditional probability.
27 Jul 2004
To Tasmanian Devil: As I was just warned by klaashaas the host doesn't choose the doors randomly but he is aware of the location of BMW and goats and he always choose the door with goat. In such case the switch doubles the chances, of course. So forget of my previous message. And thanks to klaashaas.
27 Jul 2004
A man at a certain point on earth. He goes 100m to the South, then 100m to the West, and finally 100m to the North, and he arrives where he has started. He is not on the North Pole. Is this possible? (I posted this under solutions accidentally.)
27 Jul 2004
(Assuming certain geometrical idealisations.)
27 Jul 2004
Yes, if he is whenever on the latitude line which is about 115.9m to the north from the south pole. The latitude line which is about 15.9m to the north from the south pole has length 100m.