Browse by Tags

Related Posts

  • Recursive lambdas and sequence aggregations

    The fifth problem at Project Euler proposes this nostalgic primary school exercise: find the smallest quantity that is evenly divisible by some numbers, the least common multiple of 1, 2, 3, ..., 20 to be precise. To begin with, let's remember the old arithmetic formula:   Where gcd is the greatest...
    Posted to .NET at 9.400 ft above sea level (Weblog) by Edgar Sánchez on 04-24-2008, 12:00 AM
    Filed under: C#, Functional Programming, Math, C# 3.0, Project Euler
  • Which is the ten thousand first prime?

    Prime numbers have a good deal of practical applications (for example in cryptography) but let's face it, even if they would have none, they would still be the favorite toy of mathematicians . In Problem 7 of Project Euler , we are asked to find the 10001st element of the famous list, my approach was...
    Posted to .NET at 9.400 ft above sea level (Weblog) by Edgar Sánchez on 05-02-2008, 12:00 AM
    Filed under: C#, Functional Programming, LINQ, Math, C# 3.0, Project Euler
Page 1 of 1 (2 items)
Microsoft Communities