Forums

Solve this Riddle if you can

Sort:
chasm1995
keju wrote:

A plane full of Canadians crashes and explodes on the exact border between Mexico and the USA. In which country should the survivors be buried?

Canada, where they are from.

pdela

I think to solve this one is awarded with a million $. But there is proof it can be done. It's equivalent to show that P = NP, and this is not known to be correct, actually it's assumed it is not

We denote by messenger problem (since in practice this question should be solved by each postman, anyway also by many travelers) the task to find, for finitely many points whose pairwise distances are known, the shortest route connecting the points. Of course, this problem is solvable by finitely many trials. Rules which would push the number of trials below the number of permutations of the given points, are not known. The rule that one first should go from the starting point to the closest point, then to the point closest to this, etc., in general does not yield the shortest route

LudRa95
pdela wrote:

I think to solve this one is awarded with a million $. But there is proof it can be done. It's equivalent to show that P = NP, and this is not known to be correct, actually it's assumed it is not

We denote by messenger problem (since in practice this question should be solved by each postman, anyway also by many travelers) the task to find, for finitely many points whose pairwise distances are known, the shortest route connecting the points. Of course, this problem is solvable by finitely many trials. Rules which would push the number of trials below the number of permutations of the given points, are not known. The rule that one first should go from the starting point to the closest point, then to the point closest to this, etc., in general does not yield the shortest route

Solved a long time ago:

http://en.wikipedia.org/wiki/Minimum_spanning_tree

It's part of all/most first courses in graph theory.

As for a specific solution:

http://en.wikipedia.org/wiki/Reverse-delete_algorithm

pdela
LudRa95 wrote:
pdela wrote:

I think to solve this one is awarded with a million $. But there is proof it can be done. It's equivalent to show that P = NP, and this is not known to be correct, actually it's assumed it is not

We denote by messenger problem (since in practice this question should be solved by each postman, anyway also by many travelers) the task to find, for finitely many points whose pairwise distances are known, the shortest route connecting the points. Of course, this problem is solvable by finitely many trials. Rules which would push the number of trials below the number of permutations of the given points, are not known. The rule that one first should go from the starting point to the closest point, then to the point closest to this, etc., in general does not yield the shortest route

Solved a long time ago:

http://en.wikipedia.org/wiki/Minimum_spanning_tree

It's part of all/most first courses in graph theory.

As for a specific solution:

http://en.wikipedia.org/wiki/Reverse-delete_algorithm

A practical solution that can be computed in less that several ages of the universe

by the way that problem is a different one

keju
SmyslovFan wrote:

The survivors, when they finally die, should be buried whereever they state in their wills.

Laughing

LudRa95
pdela wrote:
LudRa95 wrote:
pdela wrote:

I think to solve this one is awarded with a million $. But there is proof it can be done. It's equivalent to show that P = NP, and this is not known to be correct, actually it's assumed it is not

We denote by messenger problem (since in practice this question should be solved by each postman, anyway also by many travelers) the task to find, for finitely many points whose pairwise distances are known, the shortest route connecting the points. Of course, this problem is solvable by finitely many trials. Rules which would push the number of trials below the number of permutations of the given points, are not known. The rule that one first should go from the starting point to the closest point, then to the point closest to this, etc., in general does not yield the shortest route

Solved a long time ago:

http://en.wikipedia.org/wiki/Minimum_spanning_tree

It's part of all/most first courses in graph theory.

As for a specific solution:

http://en.wikipedia.org/wiki/Reverse-delete_algorithm

A practical solution that can be computed in less that several ages of the universe

by the way that problem is a different one

The computation time depends on the number of edges and vertices (although, at careful reading, you do give a relative condition of the computation time). 

It's the same problem. The "points" in your formulation are the vertices/nodes of the graph and the "distances" are the weights of the edges.

Kikyo_Sushi
keju wrote:

A plane full of Canadians crashes and explodes on the exact border between Mexico and the USA. In which country should the survivors be buried?

The Survivors are still alive ; they are not the Victims so why should they be buried ?

LudRa95
Kikyo_Sushi wrote:
keju wrote:

A plane full of Canadians crashes and explodes on the exact border between Mexico and the USA. In which country should the survivors be buried?

The Survivors are still alive ; they are not the Victims so why should they be buried ?

For fun.

macer75
Kikyo_Sushi wrote:
keju wrote:

A plane full of Canadians crashes and explodes on the exact border between Mexico and the USA. In which country should the survivors be buried?

The Survivors are still alive ; they are not the Victims so why should they be buried ?

lol that one got me. I didin't realize the answer until i saw it

chasm1995
Cogwheel wrote:
chasm1995 wrote:
keju wrote:

A plane full of Canadians crashes and explodes on the exact border between Mexico and the USA. In which country should the survivors be buried?

Canada, where they are from.

You're kidding, right? Why would you bary people alive? DX

Not when they're alive, but after they die they will most likely be buried in their home country.

Kikyo_Sushi

.. or maybe he meant to say Victims n' not Survivors ?

keju

No, it's that type of riddle. Trick riddle.

A businessman is hurrying to catch a plane and stops by his office to get the tickets. There, he meets the night watchman, who grabs the businessman by the wrist and urges him not to get on the plane. "Sir, I had the most vivid dream last night in which a plane crashes and everyone is killed. You mustn't get on the plane". The businessman cancels his flight and, sure enough, the plane crashes and everyone dies. Relieved, he rewards the night watchman with $10,000 and then promptly fires him. Why?

TheGrobe

No, he meant to say survivors.  It's similar to the question about determining the direction an egg would roll when a rooster lays it right on the peak of the barn roof.

chasm1995
TheGrobe wrote:

No, he meant to say survivors.  It's similar to the question about determining the direction an egg would roll when a rooster lays it right on the peak of the barn roof.

It depends on which direction the next breeze strong enough to move the egg is.  Innocent

LoekBergman
keju wrote:

No, it's that type of riddle. Trick riddle.

A businessman is hurrying to catch a plane and stops by his office to get the tickets. There, he meets the night watchman, who grabs the businessman by the wrist and urges him not to get on the plane. "Sir, I had the most vivid dream last night in which a plane crashes and everyone is killed. You mustn't get on the plane". The businessman cancels his flight and, sure enough, the plane crashes and everyone dies. Relieved, he rewards the night watchman with $10,000 and then promptly fires him. Why?

If the businessman had not gone to the office to get his tickets would he not have met the night watchman. That man apparently knew that the businessman was going with that flight and die, but had not taken the initiative to contact the businessman. If it was up to the night watchman, then would the businessman been dead by now.

TheGrobe
chasm1995 wrote:
TheGrobe wrote:

No, he meant to say survivors.  It's similar to the question about determining the direction an egg would roll when a rooster lays it right on the peak of the barn roof.

It depends on which direction the next breeze strong enough to move the egg is.  

What egg?

chasm1995
TheGrobe wrote:
chasm1995 wrote:
TheGrobe wrote:

No, he meant to say survivors.  It's similar to the question about determining the direction an egg would roll when a rooster lays it right on the peak of the barn roof.

It depends on which direction the next breeze strong enough to move the egg is.  

What egg?

The rooster took an egg from a hen and put it up there.

winerkleiner
keju wrote:

A plane full of Canadians crashes and explodes on the exact border between Mexico and the USA. In which country should the survivors be buried?

Since when do they bury survivors?

Tamama-nitouhei
keju wrote:

No, it's that type of riddle. Trick riddle.

A businessman is hurrying to catch a plane and stops by his office to get the tickets. There, he meets the night watchman, who grabs the businessman by the wrist and urges him not to get on the plane. "Sir, I had the most vivid dream last night in which a plane crashes and everyone is killed. You mustn't get on the plane". The businessman cancels his flight and, sure enough, the plane crashes and everyone dies. Relieved, he rewards the night watchman with $10,000 and then promptly fires him. Why?

Because he was sleeping on the job?

risteard40

1+2+3+4+5 x6 = 90 -7 = 83 + 8 = 91 +9 = 100