1. The Devil is in the Details

    This story happened a while ago, but because I've been so busy I haven't really had the time to put it on (electronic) paper. While hanging out on Twitter I saw a message asking why one version of Haskell code was preferred over another. So I followed the ...

    read more

    There are comments.

  2. Project Euler: Problem 9

    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 ...

    read more

    There are comments.

  3. Project Euler: Problem 8

    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 ...
    read more

    There are comments.

  4. Project Euler: Problem 4

    If you been following me the last three times I've done this, then you really don't need any introductions.

    Problem four is as follows:

    1
    2
    3
    4
    5
    A palindromic number reads the same both ways. The largest palindrome made
    from the product of two 2-digit numbers ...
    read more

    There are comments.

« Page 2 / 2

social