Browse by Tags

All Tags » Project Euler (RSS)
Tuesday, May 06, 2008 1:40 AM

A cool way to find out whether a number is palindromic

In this blog entry I proposed a solution to Problem 4 at Project Euler , a crucial element of the problem is to find out whether a number is a palindrome (909 is, 809 isn't), a bit out of laziness and a bit in order to reuse existing methods, I decided...
Posted by Edgar Sánchez | 4 comment(s)
Filed under: , , , ,
Saturday, May 03, 2008 1:26 AM

New version of F# just released

In its way from research language to commercial language, Don Syme just announced that, silently, on May the 1st version 1.9.4.15 of F# was released .   This new version incorporates a number of specific enhancements (F# is now basically in stabilization...
Posted by Edgar Sánchez | with no comments
Filed under: , ,
Friday, May 02, 2008 12:09 AM

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...
Posted by Edgar Sánchez | 4 comment(s)
Filed under: , , , , ,
Sunday, April 27, 2008 9:56 PM

The square of the sum vs. the sum of the squares

The sixth Project Euler problem poses an exercise that, to me, offers no major hurdles: What is the difference between the sum of the squares and the square of the sums [of a sequence of natural numbers]? The functional C# solution is fairly easy to write...
Posted by Edgar Sánchez | 1 comment(s)
Filed under: , , ,
Thursday, April 24, 2008 1:22 AM

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...
Posted by Edgar Sánchez | 3 comment(s)
Filed under: , , , ,
Tuesday, April 22, 2008 2:41 AM

Nested sequences and palindrome numbers

Problem 4 of Project Euler poses and impractical albeit intriguing problem: given all three digit numbers (100, 101, 102, ..., 998, 999), find the largest product of 2 of those numbers, where the product is a palindrome . For example, 580.085 is the product...
Posted by Edgar Sánchez | 4 comment(s)
Filed under: , , ,
More Posts