ProjectEuler

SPOJ 2906. GCD2 with F#

15 Dec 2012 2 min read Algorithm

Problem Definition Frank explained its friend Felman the algorithm of Euclides to calculate the GCD of two numbers. Then Felman implements it algorithm int gcd(int a, int b) { if (b==0) return

Euler Problem 002 with F#

05 Dec 2012 Functional Programming

Problem Statement 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued