Project Euler – Problem 8

We had someone leave recently, and as such have been doing interviews. Whenever we start interviewing people I start thinking about algorithms again. Math and algorithms are just fun to work on, they let you explore branches of though in creative ways that UI design doesn’t. This is the seventh post in my Project Euler series.…

Project Euler – Problem 5

This is the fourth post in my Project Euler series. The fourth problem is here. Problem 5 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20? This was by far my favorite…

Project Euler – Problem 4

This is the fourth post in my Project Euler series. The third problem is here. Problem 4 A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is . Find the largest palindrome made from the product of two 3-digit numbers. I was a little disappointed at the simplicity of this…

Project Euler – Problem 3

This is the third post in my Project Euler series (if series is the right word). The second problem is here. Problem 3 The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? This problem seemed rather daunting to me at first. Upon first reading it, I…

Project Euler – Problem 2

This is the second post in my Project Euler series (if series is the right word). The first problem is here. 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,…

Project Euler – Problem 1

A while back one of my coworkers sent out a link to Scott Hanselman’s ‘Am I really a developer or just a good googler?’. As you can probably imagine from reading the title, the article proposes an interesting philosophical question that I’m sure a good many of us have considered. Am I actually a (good)…