Yes, I know I skipped problem 8, but it involves strings, and I found nine easier to do More...

The sum of the squares of the first ten natural numbers is,

1² + 2² + ... + 10² = 385

The square of the sum of the first ten natural numbers is,

(1 + 2 + ... + 10)² = 55² = 3025

Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.

Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.

This problem is easy in both C# and F# More...

2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.

What is the smallest number that is evenly divisible by all of the numbers from 1 to 20?

This is a problem that can be brut forced. More...

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

Find the largest palindrome made from the product of two 3-digit numbers.

The easiest way to reverse a number is to convert the number to a string then to a character array and call reserve More...

Many of the Project Euler problems require prime number to solve, so I wrote a prime number generator in both F# and C#.  I think that my implementation in C# is more efficient More...

Problem Two is defined as

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

Find the sum of all the even-valued terms in the sequence which do not exceed four million.

More...

In order to learn F#, I decided to work through the Project Euler problem sets. More...

In traditional keyword frameworks, the object map (name mapping in TestComplete terms) is kept in a separate file than the project it self.  More...