Tag: Project Euler (5)

Blog (4)

Project Euler in Haskell #4

2012-04-20 — Article of 700 words Programming Haskell Project Euler

Problem Description

Link to Project Euler problem 4

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is \(9009=91\times99\).

Find the largest palindrome made from the product of two 3-digit numbers.

WARNING Solution ahead. Don't read more if you want to enjoy the benefits of Project Euler and you haven't already solved the problem.

Read more...

Project Euler in Haskell #2

2012-04-10 — Article of 200 words Programming Haskell Project Euler

Problem Description

Link to Project Euler problem 2

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1,2,3,5,8,13,21,34,55,89, …

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

WARNING Solution ahead. Don’t read more if you want to enjoy the benefits of Project Euler and you haven’t already solved the problem.

Read more...

Projects (1)