# Tarski's Adaptation of Wojtowicz's Argument on Optimal Dissection of a Unit Square

Tarski's Adaptation of Wojtowicz's Argument on Optimal Dissection of a Unit Square

This Demonstration shows a reconstruction of a theorem of Tarski. An optimal dissection uses the smallest number of pieces. The theorem states that the number of pieces in an optimal dissection of a unit square into a rectangle of dimensions and has an upper bound , where denotes the ceiling of , that is, the smallest integer greater than or equal to .

x>1

1/x

2+-1

2

x

⌈x⌉

x

x

In the case , this gives a six-piece dissection.

x=3.5