Re: Partitioning a square to a fixed sized rectangles.
- From: no.glamour@xxxxxxxxx
- Date: Wed, 4 Jun 2008 04:52:58 -0700 (PDT)
On Jun 4, 7:11 am, Tim Little <t...@xxxxxxxxxxxxxxxxxxxxxxxxxx> wrote:
On 2008-05-31, no.glam...@xxxxxxxxx <no.glam...@xxxxxxxxx> wrote:
I would appreciate it if someone can give me an hint on this one:
Prove/disprove that a 3000X3000 square can be partitioned into 5X7
rectangles (the rectangles can be mixed, either 5X7 or 7X5).
That would be pretty difficult, since the area of the rectangles is
divisible by 7, and the area of the square isn't.
- Tim
Again, mistyped the rectangles should be 5x9 (and not 7)
.
- References:
- Re: Partitioning a square to a fixed sized rectangles.
- From: Tim Little
- Re: Partitioning a square to a fixed sized rectangles.
- Prev by Date: Continuous bijection (not necessarily homeo)
- Next by Date: Re: Bounded sets in tvs
- Previous by thread: Re: Partitioning a square to a fixed sized rectangles.
- Next by thread: I have solved the St. Petersburg Paradox...
- Index(es):