Re: Partitioning a square to a fixed sized rectangles.
- From: no.glamour@xxxxxxxxx
- Date: Sat, 31 May 2008 08:37:35 -0700 (PDT)
On May 31, 4:54 pm, Brian Chandler <imaginator...@xxxxxxxxxxxxx>
wrote:
no.glam...@xxxxxxxxx wrote:
Hello,
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).
The question is part of a graph theory course, so I think the idea is
to module it into a graph, and use any kind of its properties.
Thank you,
Eliot.
If it can be so partitioned, you'd better be able to divide the area
of the square by the area of the rectangle...
Brian Chandlerhttp://imaginatorium.org
So having the above is sufficient but not enough. Let's think about an
example in which which the square can partitioned into rectangles of
various lengths (s1xs2 and s3xs4), how that can be checked?
.
- Follow-Ups:
- Re: Partitioning a square to a fixed sized rectangles.
- From: James Waldby
- Re: Partitioning a square to a fixed sized rectangles.
- References:
- Partitioning a square to a fixed sized rectangles.
- From: no . glamour
- Re: Partitioning a square to a fixed sized rectangles.
- From: Brian Chandler
- Partitioning a square to a fixed sized rectangles.
- Prev by Date: Re: fixed point iteration in Hilbert Spaces
- Next by Date: Re: Little calculus problem.
- Previous by thread: Re: Partitioning a square to a fixed sized rectangles.
- Next by thread: Re: Partitioning a square to a fixed sized rectangles.
- Index(es):
Relevant Pages
|
|
