Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!sei.cmu.edu!fs7.ece.cmu.edu!o.gp.cs.cmu.edu!andrew.cmu.edu!nc0i+
From: nc0i+@andrew.cmu.edu (Neil J. Calkin)
Newsgroups: comp.theory
Subject: Re: Partitioning squares into unequal squares
Message-ID: <UcEd1M600VoS5Pnmsv@andrew.cmu.edu>
Date: 28 May 91 17:16:08 GMT
References: <9105242046.AA15308@athos.cs.ua.edu>
Organization: Mathematics, Carnegie Mellon, Pittsburgh, PA
Lines: 7
In-Reply-To: <9105242046.AA15308@athos.cs.ua.edu>

Whoops: mistake in my earlier posting:
the smallest decomposition of an integer
sided square into distinct integer squares
is of a 112x112 square, into 21 incongruent
squares.

Neil Calkin, Department of Mathematics, Carnegie Mellon University.