The Banach-Tarski Paradox shows how to obtain two spheres, or balls, from one, and it is clear how to get any finite number of balls: just duplicate repeatedly, lifting the subsets of the new balls back to the original. After all, the joy in owning a duplicating machine is being able to use it more than once. Alternatively, one need only consider the weak system of congruences: A2j ≃ ∪ {Ai: 1 ≤ i ≤ 2n, i ≠ 2j - 1}, j = 1, …, n. By the remarks following 4.12, there is a partition of the sphere into sets Ai that satisfy this system with respect to rotations, and therefore A2j ∪ A2j-1 ∼ S2. Need we stop at just finitely many copies? What about infinitely many, even uncountably many? Using the existence of infinitely many independent rotations (σi τσ-i, i = 0, 1, 2, … where σ, τ are independent), it is not hard to see how the results of Chapter 4 on systems of congruences can be made to yield the solvability of any countably infinite weak system by a partition of S2. Hence S2 can be partitioned into countably many sets, each of which is SO3-equidecomposable (using just two pieces) with S2. But even stronger transfinite duplications are possible. One can get a continuum of spheres from one: the sphere can be partitioned into sets Bα, as many sets as there are points on the sphere (i.e., 2ℵo), such that each Bα is SO3-equidecomposable with the sphere.