Browse by Tags

Euler Problem 14: Learn to Memoize
This is going to be fun. It’s a bit of LINQ, a bit of academic Computer Science, and a bit of meteorology. Euler Problem 14 concerns a sequence referred to as hailstorm numbers. Hailstorm number...
Long time, no Euler (or YAEPS # 13)
Well, it’s been a long time since I’ve taken the time to solve and blog about one of the Euler problems.  It was time to pick this up again. Problem 13 says: Work out the first 10 digits of the sum...
Euler Problem 12
It’s been a long time since I have worked on any of the Euler problems. I simply haven’t had time. Well, it was time to spend a bit of time just exercising the math part of my mind, and solve...
Euler Problem 10
Patrick posted his solution earlier this week. I figure it was time to add mine. Also, Octavio Hernandez pointed out in the comments to problem 8 that he had discussed similar code constructs in his blog...
Euler Problem 9
I was going to wait a bit to post this, but Patrick Steele posted his solution , so I figured I should post mine. Patrick took the straight out brute force approach. I decided to think a bit differently...
Euler Problem 7
Yes, it's true that I've been very lax in working on these problems. It's been a combination of the day job, finishing all the editing tasks on "More Effective C#", and actually trying...
Project Euler problem 6
Euler Problem six asks you to find the difference between the sum of squares and the square of the sum for the natural numbers 1 through 100. I took the easy route, and made a brute force implementation...
Euler Problem 5
Well, it's time to post another solution and look at how LINQ and C# 3.0 can create elegant code for these problems. The fifth problem asks you to find the smallest number that is divisible by all...
Euler Problem 4: Finding Palindrome numbers
The fourth Euler problem asks you to find the largest palindrome number that is the product of two three digit numbers. For example, the number 919 is a palindrome: it's the same forward and backwards...
Notes on Euler Problem 3
Here are my notes on the third Project Euler problem. The problem is "What is the largest prime factor of the number 600,851,475,143?" Once again, this is a problem that is best solved creating...
Discussion on Project Euler Problem 2
The second Euler problem asks you to find the sum of all even valued terms in the Fibonacci sequence which do not exceed 4,000,000. Let's look at the solution from the outside in. Here's the query...

Search

Go

Blog Group Links

Nascar style badges