nfirvine.comwiki

Index

Filed in: Euler.Index · Modified on : Wed, 06 Feb 08

Project Euler is a series of mathematical problems that are meant to be solved programmatically (which in my case implies Python).

I'll post my solutions here. I've created some additional guidelines for myself when doing these challenges:

  • Solutions must be in Python (of course).
  • Solutions can take no longer than 1 minute to run, but should run as quickly as possible.
  • Solutions should be as short as possible. One-liners (line count excludes imports and a final print for the answer) for bonus points.

That being said, generally, the programs are not optimized for speed or length of code unless I feel like it.

Problems

4Find the largest palindrome made from the product of two 3-digit numbers
5What is the smallest number divisible by each of the numbers 1 to 20?
6What is the difference between the sum of the squares and the square of the sums?
7?
8Find the greatest product of five consecutive digits in the 1000-digit number.

Powered by PmWiki