/ Published in: Prolog
URL: http://13tazer31.wordpress.com/2011/02/06/project-euler-problem-2/
Expand |
Embed | Plain Text
fibonacci(_,Current,End,0) :- Current > End. fibonacci(Previous, Current, End, Total) :- divisible(Current, 2), Next is Current + Previous, fibonacci(Current, Next, End, Sum), Total is Sum + Current, !. fibonacci(Previous, Current, End, Total) :- Next is Current + Previous, fibonacci(Current, Next, End, Total). divisible(Number, 0) :- write('Error: division by 0'). divisible(Number, Divisor) :- Number mod Divisor =:= 0.
You need to login to post a comment.
