Re: Fibonacci sequence

https://www.geocaching.com/geocache/GC473VQ_february-28-fibonacci-challenge?guid=71987667-a502-47e2-8e61-d2325341cdcb

The Challenge For the purposes of this challenge we will start our Fibonacci sequence with 1 and 1, and work through to 89. Our part of the sequence is: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, and 89.
To complete this challenge you must find the exact number of caches on a single day for each number in the Fibonacci sequence.

So, you'll find one cache on one day, one cache on another day, and three, and five, and eight on another, and so on, all the way up to and including 89 caches in a single day.

Eleven different days of caching will result in a total of 232 caches.

Anyone interested in designed a checker for this?

Edit: Whoops, missed that this was a grandfathered cache.



Edited 2 time(s). Last edit at 06/08/2016 06:31AM by sumbloke. (view changes)

I can't see any script for an exact number of finds on a day, so it looks like a new one will be needed.

I used the below to check on getting a count of finds per day = 89 to test this and get a string of what days the user achieved that. I suppose that information could be gathered into an array for each element of the fibonacci sequence and then that array parsed to check for the date order required for this challenge

-- Modification of a script by alarobric
-- Loop through finds to determine number per day
for i,c in IPairs(finds) do
if c['visitdate'] == currentFoundDate then
findsToday = findsToday + 1
else
if findsToday > 0 then
-- Print(currentFoundDate)
-- Print('... ')
end
if findsToday <= maxNumFindsNeeded and findsToday > 0 then
days[findsToday] = days[findsToday] + 1
end
if findsToday == 89 then
thisday = thisday .. " " .. c['visitdate']
end
findsToday = 1
currentFoundDate = c['visitdate']
end
end

I've modified and tagged my script, so the checker is done:

http://project-gc.com/Challenges/GC473VQ/21410