Browse by Tags

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 another problem. Problem 12 asks you to find the...

Posted 23 March 2009 01:18 PM by wwagner | 2 comment(s)

Filed under: C#, C# General, Euler

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 a while back. Problem 10 asks for the sum of all...

Posted 31 August 2008 01:05 PM by wwagner | 2 comment(s)

Filed under: LINQ, C#, .NET General, C# General, DevCenterPosts, Euler

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 and use the some LINQ code to generate my answer...

Posted 28 August 2008 02:03 PM by wwagner | 3 comment(s)

Filed under: LINQ, C#, C# General, Euler

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 to keep the personal life intact. The 7th problem...

Posted 14 August 2008 09:30 AM by wwagner | 7 comment(s)

Filed under: C#, C# General, DevCenterPosts, Euler

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 in C#. There are a couple new bits of LINQ syntax...

Posted 11 April 2008 03:24 PM by wwagner | 1 comment(s)

Filed under: LINQ, C#, C# General, Euler

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 the natural numbers from 1 through 20. You can trivially...

Posted 08 April 2008 02:13 PM by wwagner | 1 comment(s)

Filed under: C#, C# General, Euler

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. To solve this problem, we need to find the product...

Posted 06 April 2008 10:37 PM by wwagner | 6 comment(s)

Filed under: LINQ, C# General, Euler

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 some simple LINQ queries. From the outside, this...

Posted 28 March 2008 03:28 PM by wwagner | 5 comment(s)

Filed under: C# General, DevCenterPosts, Euler

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 that finds the answer: var EvenFibNumbers = (from...

Posted 27 March 2008 10:20 AM by wwagner | with no comments

Filed under: C#, C# General, DevCenterPosts, Euler

Project Euler: Problem 1

I am starting a new series. A friend recently pointed me at the Project Euler problems. You can see the project here: http://projecteuler.net/ As I finish them, I'll post an explanation of the problem and the code here. I've also posted the code...

Posted 25 March 2008 09:36 PM by wwagner | 7 comment(s)

Filed under: LINQ, C#, DevCenterPosts, Euler