Question: Getting these error while trying to integrate `SKMaps` framework 

```
Undefined symbols for architecture x86_64:

  "CRouteTestManager::calculateRoute(NGRouteInput const&, std::__1::shared_ptr<CRoute>&)", referenced from:

      PoiTrackerTest::createRoute() in SKMaps(PoiTrackerTest.o)

  "_gpTestRoutesManager", referenced from:

      PoiTrackerTest::createRoute() in SKMaps(PoiTrackerTest.o)
      createNavigationObject(int) in SKMaps(NavigationTest.o)

ld: symbol(s) not found for architecture x86_64
clang: error: linker command failed with exit code 1 (use -v to see invocation)

```

Please help me resolve this error.

```
Environment :
Xcode 6.3.1, Mac OSX 10.10.3
Deployment Target iOS7.0

```

Supports Swift.

i was following this guide : <http://developer.skobbler.com/getting-started/ios>

and also added CoreMotion.framework as there were also linking errors related to that framework.

Answer: 
The Fibonacci sequence operates as the following:

1 1 2 3 5 8 13 21 34 etc....

So it comes down to the formula of F(n) = F(n-2) + F(n-1). You are missing code to increment days.

Try this:

```
days = 1;
next = 0;
first = 0;
second = 1;

while(next < 10000000) {
    next = first + second;
    first = second;
    second = next;
    printf("The day %d has %d spores\n", days, next);
    days++;
}

```

That should generate a proper Fibonacci number sequence. If not, I'll correct it.

EDIT: I also noticed that your printf statement is not inside the while loop. Furthermore, notice how I setup the variables before I entered the loop so as to not require an if statement inside the loop. It's more of a performance issue as the less stuff there is to do inside the loop, the faster it will execute.
For a fast algorithm, you can use this to bypass (and probably surprise whoever gave you this problem) the recursive formula once and for all.

```
F(n) = (pow((1 + sqrt(5))/2, n) - pow((1 - sqrt(5)) / 2, n)) / sqrt(5)

```

For proof, see
<http://www.artofproblemsolving.com/wiki/index.php/Binet%27s_Formula>

Basically given a limit on F(n), just rearrange the formula to find n. Or just try some values, since this formula gives much faster answers.