1. # Project Euler: Problem 16

Published: Thu 25 October 2012

In blog.

I'm not dead yet! I've just been insanely busy the last month or two with changing jobs and preparing my first programming presentation for BayPiggies and Silicon Valley Code Camp (which is a post for the near future). Both of these have kept me away from my blog ...

2. # Project Euler: Problem 14

Published: Wed 25 July 2012

In blog.

 ```1 2 3 4 5 6 7 8 9``` ```The following iterative sequence is defined for the set of positive integers: n → n/2 (n is even) n → 3n + 1 (n is odd).  Using the rule above and starting with 13, we generate the following sequence: 13 → 40 → 20 → 10 ...```

3. # Project Euler: Problem 13

Published: Tue 22 May 2012

In blog.

Problem thirteen from Project Euler is one of those problems that's so simple, I don't understand why it's in the double digits section. The problem reads:

 ```1 2``` ```Work out the first ten digits of the sum of the following one-hundred 50-digit numbers. ```

It then proceeds to ...

4. # Project Euler: Problem 12

Published: Mon 05 March 2012

In blog.

It’s time once again for a favorite blog theme, The Project Euler post. This time around I am answering problem twelve. The website states the problem as:

 ```1 2 3 4 5``` ```The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number ...```

5. # Project Euler: Problem 10

Published: Wed 06 July 2011

In blog.

Thank you for your patience as you all (I'm sure) anxiously await my next posting.

Not only has it been a really long time since I posted something technical, it's also been a really long time since I posted a Project Euler solution. On that note, let's ...

6. # Project Euler: Problem 9

Published: Thu 06 January 2011

In blog.

Happy New Year Ladies(?) and Geeks

Trying to get the year off to a good start, I'm posting up my solution for the ninth Project Euler problem. I'm not going to spend a lot of time talking about it, because the solution is a pretty easy one. Here ...

7. # Project Euler: Problem 8

Published: Wed 03 November 2010

In blog.

The website has problem eight stated as such,

 ``` 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22``` ```Find the greatest product of five consecutive digits in the 1000-digit number. 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 ...```

8. # Project Euler: Problem 7

Here is the seventh installment of this series. And just to keep things interesting I'm going to do something different this time around. I still performed the solutions for Haskell, Java, and Perl (if you want to view them check out my github repo), but instead of posting the ...

9. # Project Euler: Problem 6

Published: Tue 24 August 2010

In blog.

After a nice vacation, the obsession continues.

 ``` 1 2 3 4 5 6 7 8 9 10 11 12``` ```The sum of the squares of the first ten natural numbers is,` 12 + 22 + ... + 102 = 385 The square of the sum of the first ten natural numbers is, (1 + 2 + ... + 10 ...```