Common Routines Archives

Project Euler 301 Solution

By Mike Molony ⋅ December 13, 2013 ⋅ Post a comment

Finding Nim positions consisting of heap sizes n, 2n and 3n for n ≤ 2³⁰ that result in a losing game.

Project Euler 231 Solution

By Mike Molony ⋅ July 15, 2014 ⋅ Post a comment

The prime factorisation of binomial coefficients

Project Euler 132 Solution

By Mike Molony ⋅ June 15, 2009 ⋅ Post a comment

Determining the first forty prime factors of a very large repunit.

Project Euler 133 Solution

By Mike Molony ⋅ June 16, 2009 ⋅ 4 comments

Investigating which primes will never divide a repunit containing 10**n digits.

Project Euler 113 Solution

By Mike Molony ⋅ June 12, 2009 ⋅ 2 comments

Count how many numbers below a googol (10**100) are not “bouncy”

Common Functions and Routines for Project Euler

By Mike Molony ⋅ May 27, 2009 ⋅ 9 comments

Common functions and helpful tools used to solve problems in Project Euler: Downloadable source: Euler.py source A set of routines used to help solve math problems. Euler.py is included as needed. The example below shows typical Python usage: from Euler import is_prime, is_perm Here is the contents of Euler.py from math import sqrt, ceil import […]