Minimizing the Number of Tiles in a Tiled Rectangle

Mathematics – History and Overview

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This paper has been withdrawn by the author because it is very old version and contains some errors. Its new version is accept

Scientific paper

In this paper, we prove that if a finite number of rectangles, every of which
has at least one integer side, perfectly tile a big rectangle then there exists
a strategy which reduces the number of these tiles (rectangles) without
violating the condition on the borders of the tiles. Consequently this strategy
leads to yet another solution to the famous rectangle tiling theorem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Minimizing the Number of Tiles in a Tiled Rectangle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimizing the Number of Tiles in a Tiled Rectangle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing the Number of Tiles in a Tiled Rectangle will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-317395

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.