NOTES AND BACKGROUND

This problem is about possibility or impossibility. Can you or can you not make a square from the triangles? You will need to think carefully about the structure of the problem: What properties do the square and triangle have? How can you relate these? What do squares and the triangles have in common? How are they different?

For a similar challenge, see the problem Impossible Triangles?

For small squares, it is easy to check all possible configurations of pieces to check whether a solution exists. For larger squares the number of combinations of pieces gets larger extremely rapidly, and quickly reaches the point at which a check of all of the combinations is impossible, even on a supercomputer. Even if we have checked a large number of square sizes and found no solution, this does not necessarily mean that we cannot find a solution for a larger square. To find a solution, you often need to mine the depths of your cunning and ingenuity. To show that a solution does not exist you often have to use the concept of proof by contradiction .

Proving that a solution does not exist is often much easier than proving that a solution does exist. Interestingly, if a solution can be found, then it is usually very quick to check that the solution is correct, although finding the solution in the first place might be exceptionally difficult. This behaviour underlies the notion of the mysteriously titled 'P vs NP' problem, the solution of which will earn the solver $1,000,000

Ideas concerning proof are discussed in the fascinating article Proof: A Brief Historical Survey Ideas concerning complexity, P vs NP and other ways to earn a million dollars mathematically are found in the PLUS article Code-breakers, Doughnuts, and Violins .