Mike Molony

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 455 Solution

By Mike Molony ⋅ June 8, 2014 ⋅ One comment

Powers With Trailing Digits

The Parallelogram Law Proven Analytically

By Mike Molony ⋅ January 17, 2014 ⋅ 3 comments

Prove analytically that the sum of the squares of the four sides of a parallelogram is equal to the sum of the squares of the diagonals.

Facebook hiring sample test – Missing Term in an Arithmetic Progression

By Mike Molony ⋅ December 22, 2013 ⋅ 2 comments

Missing Term in an Arithmetic Progression

Panmagic (Pandiagonal) and magic square generation, testing

By Mike Molony ⋅ November 26, 2013 ⋅ One comment

Magic Squares While working on an idea for maximizing a return on a financial portfolio using magic squares, we though we would share our Python code in case someone else may have some use for it. import string def make_magic_square(n): if n < 1 or n == 2: return False if n % 2 == […]