In David Klarner's files (he died in 1999) I found an unfinished article for COMAP called "Box Packing: Getting Started as a Mathematical Detective" which in part discusses problems of this type, culminating in Theorem 9.2: An m x n box can be tiled with a x a and b x b bricks if and only if (I) m and n are both multiples of a; or (II) m and n are both multiples of b; or (III) one of m or n is a multiple of both a and b and the other is a linear combination of a and b. I typed it in awhile back and put it up here http://www.plambeck.org/oldhtml/mathematics/klarner/boxpacking/index.htm On Thu, Mar 1, 2012 at 6:19 AM, Kerry Mitchell <lkmitch@gmail.com> wrote:
Thank you Michael and Robert for your clear and thorough responses.
Kerry -- lkmitch@gmail.com www.kerrymitchellart.com _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- Thane Plambeck tplambeck@gmail.com http://counterwave.com/