Generating Fibonacci numbers in Haskell?

Question

In Haskell, how can I generate Fibonacci numbers based on the property that the nth Fibonacci number is equal to the (n-2)th Fibonacci number plus the (n-1)th Fibonacci numb

Answer 1

going by the definition, every item of the fibonacci series is the sum of the previous two terms. putting this definition in to lazy haskell gives u this!

fibo a b = a:fibo b (a+b)

now just take n items from fibo starting with 0,1

take 10 (fibo 0 1)