Dreamshire

Showing what's behind the curtain

// archives

Project Euler Solutions

RSS feed for this section

This category contains 150 posts

By Mike Molony ⋅ March 30, 2009 ⋅ Post a comment

Count how many n-digit positive integers exist which are also an nth power.

By Mike Molony ⋅ January 23, 2011 ⋅ Post a comment

Find the continued fractions for N ≤ 10000 have an odd period.

By Mike Molony ⋅ April 10, 2009 ⋅ Post a comment

Find the sum of digits in the numerator of the 100th convergent of the continued fraction for e.

By Mike Molony ⋅ January 22, 2011 ⋅ 6 comments

Investigate the Diophantine equation x² − Dy² = 1.

By Mike Molony ⋅ April 9, 2009 ⋅ Post a comment

Find the maximum total from top to bottom in a large triangle of numbers using an efficient algorithm.

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

Find the maximum 16-digit string for a “magic” 5-gon ring.

By Mike Molony ⋅ April 4, 2009 ⋅ One comment

Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum.

By Mike Molony ⋅ April 13, 2009 ⋅ 12 comments

Investigate values of n for which φ(n) is a permutation of n.

By Mike Molony ⋅ January 20, 2011 ⋅ Post a comment

Listing reduced proper fractions in ascending order of size.

By Mike Molony ⋅ January 20, 2011 ⋅ 3 comments

How many elements would be contained in the set of reduced proper fractions for d ≤ 1,000,000?

If you don't build your dream, someone will hire you to build theirs.