Formal Book

29 Tiling rectangles

Theorem 29.1 First proof

Whenever a rectangle is tiled by rectangles all of which have at least one side of integer length, then the tiled rectangle has at least one side of integer length.

Proof ▶

TODO

Theorem 29.2 Second proof

Whenever a rectangle is tiled by rectangles all of which have at least one side of integer length, then the tiled rectangle has at least one side of integer length.

Proof ▶

TODO

Theorem 29.3 Third proof

Whenever a rectangle is tiled by rectangles all of which have at least one side of integer length, then the tiled rectangle has at least one side of integer length.

Proof ▶

TODO