Vrftsjtryk

I thought maybe we can start with congruent triangle and try to cut it similar to how we create a Sierpinski's Triangle? However, the number of smaller triangles we get is a power of $4$ so it does not work. Any ideas?

The decomposition is possible because $2005 = 5cdot 401$ and both $5$ and $401$ are prime of the form $4k+1$. This allow $2005$ can be written as a sum of squares.

$$2005 = 22^2 + 39^2 = 18^2+41^2$$

For any integer $n = p^2 + q^2$ that can be written as a sum of squares.
Consider a right-angled triangle $ABC$ with
$$AB = psqrt{n}, AC = qsqrt{n}quadtext{ and }quad BC = n$$
Let $D$ on $BC$ be the foot of attitude passing through $A$. It is easy to
check $triangle DBA$ and $triangle DAC$ are similar to $triangle ABC$ with

$$AB = p^2, AD = pqquadtext{ and }quad CD = q^2$$
One can split $triangle DBA$ into $p^2$ and $triangle DAC$ into $q^2$
triangles with sides $p, q$ and $sqrt{n}$.

As an example, following is a subdivision of a triangle into $13 = 2^2 + 3^2$ congruent triangles.

In the literature, this is known as a biquadratic tiling of a triangle. For more information about subdividing triangles into congruent triangles, look at answers in this MO post. In particular, the list of papers by Michael Beeson there. The construction described here is based on what I have learned from one of Michael's papers.

Since $2005$ is the sum of two squares, there exists this sort of triangle. In a contest setting, if you're trying to show $2005$ is a sum of two squares, realize that $2005=401cdot 5$. Since 401 and 5 are sums of squares, we know that their product is also a sum of squares.

Now in general if we have $n=x^2+y^2$, let our triangle be an $x$ by $y$ right triangle. Then, we can split this triangle along the altitude to the hypotenuse, which gives us two similar triangles with hypotenuses $x$ and $y$ respectively. Finally, we can decompose each of these into $x^2$ and $y^2$ similar right triangles with hypotenuses $1$, via a stretched version of the following picture.