Showing what's behind the curtain

Finding Nim positions consisting of heap sizes n, 2n and 3n for n ≤ 2^{30} that result in a losing game.

The prime factorisation of binomial coefficients

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

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

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

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 […]

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

Find the smallest number divisible by each of the numbers 1 to 20.

Find the 10001st prime.

Calculate the sum of all the primes below two million.