Hello,

I have this exercise :

Define a function
fibTable :: Integer -> String
which produces a table of Fibonacci numbers. For instance, the effect of putStr
(fibTable 6) should be
n       fib n
0        0
1        1
2        1
3        2
4        3
5        5
6        8



1) Can somone give me any pointers how to calculate the fibb numbers with list comprehension.
    I know that the fib numbers are  (n -1) + n

2) Can someone give me any pointers how to write the outcome of every run

Roelof


_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners