For those who enjoy spending time solving algorithmical problems, here's one:

Quote Originally Posted by dontrememberauthor
Given a square having side a positive integer (n > 0, n belongs to N*), find the smallest number of squares having also positive integer side, in which can be devided.
Examples:
- n = 2, 4 squares of side 1;
- n = 3, 6 squares (1 of side 2 + 5 of side 1);
- n = 5, 8 squares (1 of side 3 + 3 of side 2 + 4 of side 1)...
I'm curious who's the first to find the solution for n = 13!

If you care to write the implementation of your algorithm, try as input n = 9973.

Have fun!