0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, …
This goal of this series is to share information on a topic that is a passion of mine: mathematics. There are so many different topics in math to learn and fascinate about. My goal is to create a series of puzzles that share these math topics, and some of their history, while also allowing you to use those skills to solve for the necessary coordinates. The goal is to provide puzzles that aren’t too difficult, but can also offer a challenge.
The Fibonacci Sequence is a sequence of numbers, each of which, is the sum of the previous two numbers in the sequence such that the nth number Fn=Fn-1+Fn-2. Simply put, to find the next number in the sequence you must add the last two numbers currently in the sequence.
The sequence was noted by medieval Italian mathematician Leonardo Fibonacci in his book Liber Abaci, 1202; Book of the Abacus. Fibonacci introduced the sequence in the context of a problem involving rabbits where it calculated how many pairs of rabbits would be in an enclosed area if every month a pair reproduced a new pair and rabbit pairs could produce a pair beginning in the second month.
The sequence also explains the Golden Ratio φ or Φ which is often found in nature, such as in snail shells and sunflower heads as they spiral outward. Trees can also represent this with their branches starting at their trunk and then spirals outward as it gets higher and higher.
CACHE IS NOT AT THE POSTED COORDINATES!!
To find the required coordinates, solve the puzzle below. The coordinates needed lie within.
303, 235, 944, 677, 882, 588, 376
223, 367, 112, 703, 899, 621, 468
Please replace cache exactly as you find it for the next cacher to experience. Be cautious of muggles in the area as it can be busy at times.
Congratulations to LadyCache on the FTF!