Re: Partitioning a square to a fixed sized rectangles.
- From: James Waldby <no@xxxxx>
- Date: Sat, 31 May 2008 10:50:57 -0500
On Sat, 31 May 2008 08:37:35 -0700, no.glamour wrote:
On May 31, 4:54 pm, Brian Chandler <imaginator... wrote:
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). 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.
If it can be so partitioned, you'd better be able to divide the area of
the square by the area of the rectangle...
So having the above is sufficient but not enough.
No, divisibility is necessary but not sufficient.
The phrase "sufficient but not enough" is self-contradictory.
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: JEMebius
- 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
- Re: Partitioning a square to a fixed sized rectangles.
- From: no . glamour
- Partitioning a square to a fixed sized rectangles.
- Prev by Date: Re: Little calculus problem.
- Next by Date: Re: I seek free paper about Denjoy o Henstock integral paper
- 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
|
