Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ ¹ ² ³ °
 

You are not logged in. #1 20060831 12:03:45
Treasure MapHere's a cute little thing I noticed. Maybe someone will get the nice geometric significance once they solve it: #2 20060902 00:12:31
Re: Treasure MapSo there are N villages or 14 villages?? or there are n villages, an unknown number of villages? igloo myrtilles fourmis #3 20060902 04:46:23
Re: Treasure Mapn villages, where n can be any strictly positive integer. I wouldn't call it an unknown in this problem. The problem is asking for a proof that no matter how many villages there are and no matter what order you go towards them in (following the map's instructions but possibly interchanging B, C, etc.), if you follow the map's instructions then you will still be lead to the same place. #4 20060902 04:58:50
Re: Treasure MapI know it has to do with finding the center of mass of a polygon, but I just can't figure out how to get that in mathimatical terms. "In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..." #5 20060902 05:01:37
Re: Treasure MapHow about this: "In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..." 