Welcome to my solutions for Project Euler. The solutions are hosted on GitHub. This directory of solutions is generated by a Python script. It scans through the aforementioned git repository and compiles it all into the posts you see below. If you want, you can take a look at this script’s source code.

eulerlib.prime_numbers.prime_wheel_fact_gen()[source] A generator function that yields prime numbers using the wheel factorized Sieve of Eratosthenes. Note. This function is based on the erat3 function which can be found here.

As of 27 April 2021, Project Euler has more than 1,000,000 users who have solved at least one problem, in over 100 different programming languages….Project Euler.

Euler produced more than any other mathematician in history. Mr. Stipp points out that, in terms of mathematical results, the 18th century yielded a “rich harvest” of “low hanging fruit” and thereafter “the bar was raised on rigor.” But all things considered, Euler was no ordinary genius.

Many Python solutions depend on my shared math library module: eulerlib.py. Many Haskell solutions depend on my shared math library module: EulerLib.hs. Some solution code contains a detailed mathematical proof of correctness. For every problem that I solved, I have a Java solution for it (and possibly code in other languages as well).

A more efficient implementation in Python is as follows: x = 1 y = 1 z = 0 result = 0 while z < 4000000: z = (x+y) if z%2 == 0: result = result + z #next iteration x = y y = z print result Share Improve this answer Follow edited May 12 ’14 at 19:14