Michael Molony's Python Blog

By Mike Molony ⋅ August 29, 2009 ⋅ 11 comments

Source code in PHP for calculating combination possibilities given the last number in a combination for Master combination locks.

By Mike Molony ⋅ June 15, 2009 ⋅ 2 comments

Investigating minimal repunits that divide by n.

Finding square sums that are palindromic.

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 ⋅ June 4, 2009 ⋅ 210 comments

Recover your combination to your new or old Master Lock combination lock in a few easy steps.

By Mike Molony ⋅ May 27, 2009 ⋅ One comment

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

Dreamshire