// you’re reading...
1 Star2 Stars3 Stars4 Stars5 Stars (3 votes, average: 5.00 out of 5)
Loading ... Loading ...

Project Euler Solutions

Project Euler 173 Solution

Project Euler 173 Solution

Project Euler 173: Using up to one million tiles find many different "hollow" square laminae can be formed.

Problem Description

We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry. For example, using exactly thirty-two square tiles we can form two different square laminae:

Project Euler 173 Solution

With one-hundred tiles, and not necessarily using all of the tiles at one time, it is possible to form forty-one different square laminae.

Using up to one million tiles how many different square laminae can be formed?


Ran a brute force for the first 10,000 tiles and found the series. So the next step is to form a generating function to calculate the answer, but, alas, this is unlikely to ever happen.

Project Euler 173 Solution

Runs < 0.001 seconds in Python 2.7.
Use this link to get the Project Euler 173 Solution Python 2.7 source.


Slowly swipe from either end beginning with the white vertical bar to get an idea of the starting or ending digits. For less drama, just double click the answer area. The distance between the two bars will give you an idea of the magnitude. Touch devices can tap and hold the center of the box between the two bars and choose define to reveal the answer.


Project Euler 173 Solution last updated July 31, 2014


No comments yet.

Post a comment