Project Euler Solutions

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

Finding composite values, n, for which n−1 is divisible by the length of the smallest repunits that divide it.

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

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

By Mike Molony ⋅ June 16, 2009 ⋅ 4 comments

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

By Mike Molony ⋅ June 12, 2009 ⋅ 2 comments

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

By Mike Molony ⋅ June 11, 2009 ⋅ One comment

Investigating the density of “bouncy” numbers.

By Mike Molony ⋅ May 27, 2009 ⋅ One comment

Determining the number of solutions of the equation x² − y² − z² = n.

By Mike Molony ⋅ June 4, 2009 ⋅ 3 comments

Find Fibonacci numbers for which the first and last nine digits are pandigital.

Investigate the game of chance involving colored discs.

By Mike Molony ⋅ May 17, 2009 ⋅ One comment

Find the sum of all the natural numbers that are multiples of 3 or 5 using the inclusion-exclusion principal.

By Mike Molony ⋅ May 17, 2009 ⋅ 2 comments

Find the sum of all the even-valued terms in the Fibonacci sequence which do not exceed 4 million.

Dreamshire