SIGN UP / MEMBER LOGIN
Counting
Printer Version
Spy on this Cache
Picture clues below!
2 people or teams spying on this cache! 
|
|
SIGN UP / MEMBER LOGIN |
|
|
N 59° 24.753' E 018° 12.924' |
|
|
Vaxholm, Stockholms län Sweden Near By Caches
Hidden On: 17 Jan 2005
Difficulty:
Comments:
|
We have not implemented maps outside of the U.S.A. ... YET! |
| Additional maps for this cache available at: |
|
|
The coordinates above are NOT the coordinates of the first container, but they will get you to within a few hundred meters from there.
To get the real coordinates to the first container you have to solve the following problem: Problem 1 Imagine that you have a piece of wood shaped as a tetrahedron (a pyramid with a triangular base). You are going to paint this tetrahedron. Every side of the tetrahedron should be painted in one color, and different sides may have the same color, or different colors. Two paintings of the tetrahedron are said to be "the same" if it is possible to rotate the tetrahedron so it looks exactly the same with both paintings. If that is not possible the paintings are said to be "different". For example, if one painting is to paint the front left side red and all other sides green, and another painting is to paint the base red and all other sides green, those paintings are "the same" because you can rotate the the tetrahedron so that the left front side becomes the base (see figure 1).  Let m be the number of "different" ways to paint the tetrahedron with the colors red, yellow, green, blue, and white. Let n be the number of "different" ways to paint the tetrahedron with the colors red, yellow, green, blue, white, and black. All colors don't have to be used for all paintings, for example, painting all sides green is a valid painting. The first container, a small green micro cache container roughly the same size as a film canister, can be found at the coordinates N (59.41255 - m/100000) E (18.21540 + n/100000). Note that these coordinates are in decimal degrees, not the DD MM.MMM format. The first container contains a note with two numbers K and L which you need in order to solve the next problem: Problem 2 You have a string which you are going to cut into pieces that are 1 or 2 cm long. In how many ways can you do this? The answer obviously depends on how long the string is. For a string that is 3 cm long you can do it in 3 different ways (see figure 2).  Let a be the number of ways to cut a K cm long string into 1 or 2 cm pieces. Let b be the number of ways to cut a L cm long string into 1 or 2 cm pieces. The final cache, a transparent plastic box, can be found at the coordinates N (59.41105 - a/100000) E (18.21540 - b/10000). These coordinates are also in decimal degrees. The original content of the cache is:
|
| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
| N | O | P | Q | R | S | T | U | V | W | X | Y | Z | A | B | C | D | E | F | G | H | I | J | K | L | M |
| ! | " | # | $ | % | & | ' | ( | ) | * | + | , | - | . | / | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | : | ; | < | = | > | ? |
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | : | ; | < | = | > | ? | @ | ! | " | # | $ | % | & | ' | ( | ) | * | + | , | - | . | / |
|
Clues:
decode
|
|
|
|
Pictures: |
Add a Log Entry
CACHE LOGS - May contain hints(spoilers)! decode | |
|
25 Mar 2007 by
larsl
(Finds: 0 Score: 0)
(Hidden: 9 Score: 46)
Open Log: Unrestricted This cache will be retired in two weeks from now, so if you haven't found it yet, this is the last chance!
| |
|
18 Nov 2006 by
larsl
(Finds: 0 Score: 0)
(Hidden: 9 Score: 46)
Open Log: Non-commercial use only Bumping the difficulty to 4.
|
