Originally posted by BigDoggProblemOk, where does it say path has to be a straight line?
Let's have your solution. The two solutions given are in close agreement with the answer given on several math/puzzle sites. Evidently, they've all missed a main point, too.
So instead, lets make it a triangle with one apex where you are.
The size of the leg of this equalteral is 100 units. So one trip around it and you have gone 300 units but are back home. So load up a K of B's and take off, one trip round, you lose 300 B's and have moved 700 B's 300 units. So reload, do that three times and you arive back home having moved 900 units and moved 2100 B's so now take off on one more leg and go 100 units more, consume 100 B's and now you have moved 2000 B's 1000 units, and the Camel has consumed 1000 B's.
Originally posted by sonhouseIf you move bananas around a triangular path and back to the starting point, you haven't moved them any net units. The problem is looking for a net gain in distance.
Ok, where does it say path has to be a straight line?
So instead, lets make it a triangle with one apex where you are.
The size of the leg of this equalteral is 100 units. So one trip around it and you have gone 300 units but are back home. So load up a K of B's and take off, one trip round, you lose 300 B's and have moved 700 B's 300 units. So reload, do ...[text shortened]... 100 B's and now you have moved 2000 B's 1000 units, and the Camel has consumed 1000 B's.
Originally posted by BigDoggProblemI don't see the word 'net' used in the original problem, it calls for moving the B's 1000 units, period. There is no requirment for it to be a straight line. What if the triangles are apexes where towns are located? It would be just as valid as if you wanted to deliver to a single town somewhere down the line.
If you move bananas around a triangular path and back to the starting point, you haven't moved them any net units. The problem is looking for a net gain in distance.
Originally posted by sonhouseIf you don't interpret it as 'net' distance, the problem becomes ludicrous. The camel might as well go around in a 1-unit circle for 300 units and you'd get the same thing. So much for delivering them to other towns! 🙄
I don't see the word 'net' used in the original problem, it calls for moving the B's 1000 units, period. There is no requirment for it to be a straight line. What if the triangles are apexes where towns are located? It would be just as valid as if you wanted to deliver to a single town somewhere down the line.
Originally posted by BigDoggProblemYeah but the camels are much happier knowing they became four times as efficient, it helps their job satisfaction! You just don't know the heartbreak of depressed dramaderrys, especially after they spent all that time in acting school.....
If you don't interpret it as 'net' distance, the problem becomes ludicrous. The camel might as well go around in a 1-unit circle for 300 units and you'd get the same thing. So much for delivering them to other towns! 🙄
Originally posted by sonhouseYou haven't moved ALL the bananas 1000 units, in fact only 100 of your end banana amount could have moved all 1000 units.
Ok, where does it say path has to be a straight line?
So instead, lets make it a triangle with one apex where you are.
The size of the leg of this equalteral is 100 units. So one trip around it and you have gone 300 units but are back home. So load up a K of B's and take off, one trip round, you lose 300 B's and have moved 700 B's 300 units. So reload, do ...[text shortened]... 100 B's and now you have moved 2000 B's 1000 units, and the Camel has consumed 1000 B's.