Browse by Tags

All Tags » Project Euler » .NET (RSS)
Sorry, but there are no more tags available to filter with.

Project Euler #14

I had so much fun doing #13 I thought I'd tackle #14 as well. This problem wasn't too bad.  I started by defining some extension methods on long: 1: static class Extensions 2: { 3: public static long NextInSequence( this long number) 4: { 5: if ...
Posted by PSteele | with no comments
Filed under: ,

Project Euler #13

It's been a while since I did one of the Project Euler problems.  And since a lot of my work recently has been fixing bugs and working on some design documents, I was itching to do some "real" coding.  So it's on to problem #13 . Work...
Posted by PSteele | 3 comment(s)
Filed under: ,

Project Eurler #12

I see that Bill did Euler #11 earlier this week so I thought I'd tackle #12 . The first thing I wanted to do was write a routine to generate a triangle number. As we've seen throughout this series , LINQ can come in very handy: static int TriangleOf(...
Posted by PSteele | 3 comment(s)
Filed under: ,

Euler 10

After tackling number 9 yesterday , I thought I'd do #10 real quick since it seemend pretty easy. Calculate the sum of all the primes below two million. The code for the algorithm was a simple 2 lines: var range = GeneratePrimes().TakeWhile(x => x...
Posted by PSteele | with no comments
Filed under: ,

Project Euler #9

So I decided to start looking into the Project Euler problems. A number of fellow SRT employees have been tackling these over the past few months and after recently reading Bill's solutions for problems #7 and #8 I decided to look at #9 . Find the only...
Posted by PSteele | 4 comment(s)
Filed under: ,
More Posts