From: Michael Walter <michael.walter@...>
Date: 2005-03-17T10:40:46+09:00
Subject: Re: Fibonacci Benchmark Correction

Hello Jabari,

On Wed, 16 Mar 2005 22:34:50 +0900, jzakiya@mail.com <jzakiya@mail.com> wrote:
> Each program should calculate the Fibonacci function using the same
> na�ve recursive-algorithm
> 
> F(x)
>   x = 0     = 1
>   x = 1     = 1
>   otherwise = F(x-2) + F(x-1)
> 
> Calculate F(N). Correct output N = 32 is:
> 
> 3524578

Nowhere in this text F(x) is defined as the x-th Fibonacci number. [*]

I'm sure the author would be glad to add a small note stating that
"F(x) is the (x+1)-th Fibonacci number", though. Did you notice that
the choice of defining F(x) to be the (x+1)-th Fibonacci number is
similar to choosing a[n] to be the (n+1)-th element of the array a?

Hope that helps,
Michael

[*] Note that I'm talking about Fibonacci numbers.