Today’s PMQ comes in two parts. Firstly, take a square with sides 7 units in length. You are required to tile this with smaller squares, each with whole number sides, in such a way as to use the minimum number of smaller squares. One extra condition is that the distinct tiles used must have no common factors, or put another way, the gcd of any two

*different *tiles must be equal to 1.

The diagram shows one possible tiling for a square with sides of 6 units. At one extreme, we could just use unit squares, in which case we would need 36 tiles. At the other extreme, we could use one tile with sides 5 units and 11 unit tiles, making a total of 12. Neither of these will give us the minimum number of tiles; they are just presented as examples of how to approach this problem. However, notice that the tiling in the diagram satisfies the second condition. There are three distinct tiles used - of sides 1, 2 and 3 - and their pairwise gcd equals 1. There are solutions that use tiles of sides 2 and 4 but this would give a pairwise gcd of 2.

The second step in the question is to find all the different arrangements of the minimum number of tiles. These must be unique layouts, so that tilings with rotational symmetry count as just one arrangement. If we were actually tiling a floor, each arrangement could be rotated four times to give the appearance of different layouts, but it is still just a single unique design.

To recap the questions, you are given a square with sides of 7 units. You must find the minimum number of smaller squares with integer sides that can completely cover this larger square with no overlaps and no gaps. The sides of the distinct squares used can have no pairwise common factor other than 1. Then, using these minimum number of squares, how many unique arrangements are there?

[edited for clarity on 13 April]

**You may discuss the question below, but no full answers, please, until the competition has closed!**

**You can receive these questions directly to your email box or read them in an RSS reader. Subscribe using the links on the right.**
**How to Enter**
**Send your complete solution by email to pmq14nash@giftedmaths.com. **This email address shall be removed after the competition closes to avoid spam.

**This PMQ14 competition closes on MONDAY 15 April at 23:59 GMT - one extra weekday from now on**.

**The Prize**
**The prizes for this PMQ are 3 free places in our Online Maths Club for 3 months.** The very first correct solution will receive a prize plus two others randomly selected from all the other correct answers. The email time stamp shall determine the order of entries received. All winners can have their name posted and a link to their own online profile at their favourite social network or their own blog.

**Quick Rules**
**Look at the expanded rules on our PMQ page.**
Anybody can enter our Prize Maths Quiz; adults and students.

Use the official server clock in the right column to avoid late entries.

All emails and email addresses sent to us will be deleted after the winners have been processed.

DO NOT submit your entries to the comments section at the bottom of this post.

You CAN discuss it there but you must email us to enter the competition.

We adhere to COPPA guidelines regarding children's online safety and security.

Enjoy the challenge!

**Send us your solution! You can't win if you don't participate.**
Then tell your friends!