On Jun 7, 10:20 pm, OwlHoot <ravensd...@[EMAIL PROTECTED]
> wrote:
>
> If you're talking about tiling a square of integer side n with smaller
> squares of sides 1, 2, .. m with no gaps then obviously a necessary
> condition is that 1^2 + 2^2 + .. + m^2 = n^2.
Oops - I just read your problem statement more carefully, and it isn't
that old chestnut but 1^2, 2^2, 2^2, 3^2, 3^2, 3^2, ... so to start
with you need 1^3 + 2^3 + .. + m^3 = n^2. Hmmm ..
Cheers
John R Ramsden
|
