Computes fibonacci numbers for large N (<=999) efficiently. Takes about 7 seconds on my machine to compute F(999) (probably a lot less here).
Two variants of Fibonacci generator:
1) N --- > Fib(N) (as String)
N must be between 0 and 999 (both inclusive) otherwise an Exception will be thrown
2) N, booleanValue ---> String of [Fib(0), Fib(1)...Fib(N)]
N must be between 0 and 999 (both inclusive) otherwise an Exception will be thrown.
booleanValue MUST be true (for compatibility reasons) otherwise an exception will be thrown