Big Fibonacci Number by henkma

m@main=readLn>>=print.(!!1).f>>m
f n|n<2=[n,1]|a:b:_<-f$div n 2=[2*a*b-a^2|even n]++[mod(x*a+b^2)$10^9|x<-[a,2*b]]

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)

download

return to the top page