Problem 42: Coded triangle numbers. Rewrote the original python code and wrote a new Haskell code.

## Sunday, February 23, 2014

## Saturday, January 04, 2014

## Wednesday, January 01, 2014

### redoing a problem: 41

Problem 41: Pandigital Prime. Brute force with Haskell in half a second. You can skip all permutations other than 4 and 7 digits because all of them can be divisible by 3.

## Sunday, December 22, 2013

### redoing a problem: 40

Problem 40: Champernowne's constant. Now I understood infinite list and foldr/foldl in Haskell.

## Tuesday, December 17, 2013

### redoing a problem: 39

Problem 39: Integer right triangles. Simple brute force in Haskell. 20 seconds.

## Monday, December 16, 2013

## Sunday, December 15, 2013

### redoing a problem: 37

Problem 37: Truncatable primes. I am still struggling with Haskell. 15 seconds in Haskell.

## Sunday, November 24, 2013

### redoing problems: 34, 35

Problem 34: Digit factorials. Done with Haskell.

Problem 35: Circular primes. One minutes with compiled Haskell. Too slow.

## Monday, November 04, 2013

### redoing a problem: Problem 32

Problem 32: Pandigital Products. Much better than my original code in Python. Both in Python and Haskell.

Subscribe to:
Posts (Atom)