Four-Piece Minimum Dissection of an Equilateral Triangle to a Square

•

 13 min video

•

 5 min read

YouTube video ID: EgnAN0ZUl08

Source: YouTube video by Numberphile — Watch original video

PDF

The problem of dissecting an equilateral triangle into pieces that can be rearranged to form a square has a classic solution involving four pieces. This solution, which uses pieces that inherently contain right angles, allows for the perfect formation of a square. However, for 120 years, the question of whether this could be achieved with fewer pieces (three or two) remained unsolved.

The Minimum Number of Pieces

Recent research has definitively proven that the answer is no: the transformation cannot be done with fewer than four pieces. This establishes the four-piece solution as the minimum possible, making it a hard proof due to the complexity of demonstrating the absolute minimum.

Historical Context: Henry Dudeney's Puzzle

The problem was originally posed in 1902 by Henry Dudeney, a renowned English puzzle setter. In his weekly column, Dudeney challenged readers with "dissection puzzles," where a shape is cut and its pieces rearranged to form another. He noted that while many such puzzles had been explored, the simple case of an equilateral triangle to a square had not. He anticipated it would be a difficult problem, asking for the fewest number of pieces required.

Most readers submitted solutions requiring five pieces. These solutions often employed standard techniques:

  1. Cutting the triangle in half: This transforms the equilateral triangle into a rectangle.
  2. Transforming a rectangle into a square:
    • Assume the rectangle has an area of one. The target square will also have an area of one, making it a 1x1 square.
    • Measure a width of one along the top from the top right corner and cut from that point to the bottom right corner.
    • Measure another width of one along the bottom from the bottom left corner and make a vertical cut from that point.
    • Slide the cut pieces to fill the gap, forming a 1x1 square.

This five-piece method was a common approach, demonstrating how any polygon can be transformed into any other polygon of the same area. This general method involves:

  1. Dividing the initial polygon into triangles.
  2. Transforming each triangle into a rectangle of width one.
  3. Stacking these rectangles to form a large rectangle of width one, with an area equal to the original polygon.
  4. Performing the reverse process to transform this intermediate rectangle into the target polygon.

Charles Macelroy's Four-Piece Solution

One reader, Charles Macelroy, a clockmaker, submitted a solution using only four pieces. This solution was unique because it did not rely on the standard techniques of the time, featuring "strange measurements" that were not obvious. Macelroy won a prize of half a guinea (approximately £50 in modern value) for his ingenuity. It remains unclear whether Dudeney already knew of a four-piece solution when he posed the puzzle or if Macelroy's discovery was entirely novel.

Why Two Pieces Are Impossible

It's relatively easy to dismiss the possibility of a two-piece solution. If an equilateral triangle is cut into two pieces, at least one piece must contain an entire edge of the original triangle. This edge is longer than any possible diagonal within the target square, meaning such a piece could never fit inside the square.

The Three-Piece Challenge and Recent Proof

The question of a three-piece solution remained open until recently. Researchers Kamata and Uihara from the USA and Japan tackled this complex problem. The difficulty lies in the infinite number of ways a triangle can be cut into three pieces, considering variations in cut length and angle.

Their approach involved:

  1. Categorizing possibilities: They categorized the infinite ways to cut a triangle into three pieces into five distinct types.
  2. Categorizing square dissections: Similarly, they categorized the ways a square could be formed from pieces, identifying 44 types.
  3. Defining pieces: Each piece's shape was defined by a sequence of edge lengths and angles.
  4. Searching for a match: They sought a match between the triangle pieces and the square pieces, using clever mathematical results specific to triangles and squares to simplify the comparison.

Ultimately, they found no match, proving that a three-piece solution is impossible. This confirms that the four-piece solution is indeed the minimum.

Caveats and Open Questions

The proof by Kamata and Uihara comes with a couple of caveats:

  • Straight cuts only: The proof assumes straight-line cuts, even if they are zigzaggy, but excludes curvy cuts.
  • No flipping: The proof assumes pieces cannot be flipped over.

The authors believe their theorems can be extended to exclude flipping and curvy cuts as well, but this has not yet been formally proven. This leaves open the possibility of a three-piece solution if curvy cuts or flipping are allowed.

Uniqueness of the Four-Piece Solution

The four-piece solution discovered by Charles Macelroy is the only known solution. It is also special because it does not require flipping the pieces. Furthermore, it can be demonstrated as a hinged dissection: the pieces can rotate around a common hinge to transform directly from the square to the triangle and vice-versa. Henry Dudeney himself was so impressed by this property that he created a physical model of the puzzle using wood and brass hinges.

The question of whether this specific four-piece solution is unique (i.e., if there are other distinct four-piece solutions) remains an open problem, though it seems more "chasable" than the minimum piece count. Verifying a solution is relatively easy once found, but discovering new ones is exceptionally difficult.

  Takeaways

  • Recent research by Kamata and Uihara proved that a dissection of an equilateral triangle into a square cannot be achieved with fewer than four pieces, confirming the classic four‑piece solution as optimal.
  • The proof examined all possible three‑piece cuts by categorizing triangle and square dissections into a finite set of types and showed no matching configuration exists.
  • Two‑piece dissections are impossible because any cut would leave a piece containing a full triangle edge longer than any square diagonal, preventing it from fitting inside the square.
  • The historic four‑piece solution by Charles Macelroy is unique in that it uses straight cuts, requires no flipping, and can be realized as a hinged dissection rotating between the triangle and square.
  • The current proof assumes only straight cuts and no flipping, leaving open the theoretical possibility of a three‑piece solution if curved cuts or piece flipping were permitted.

Frequently Asked Questions

Why are two-piece solutions impossible for the triangle-to-square dissection?

A two‑piece cut must leave at least one piece that contains an entire side of the equilateral triangle. That side is longer than any diagonal of a square with the same area, so the piece cannot be placed inside the square, making a two‑piece solution impossible.

How did Kamata and Uihara demonstrate that a three-piece dissection is impossible?

They enumerated every way a triangle can be cut into three pieces by grouping the infinite possibilities into five cut‑type families, and similarly classified 44 square‑assembly types. By describing each piece with edge‑length and angle sequences, they algorithmically searched for a matching set and found none, proving a three‑piece solution cannot exist.

Who is Numberphile on YouTube?

Numberphile is a YouTube channel that publishes videos on a range of topics. Browse more summaries from this channel below.

Does this page include the full transcript of the video?

Yes, the full transcript for this video is available on this page. Click 'Show transcript' in the sidebar to read it.

of whether this could be achieved with fewer pieces (three or two) remained unsolved. ## The Minimum Number of Pieces Recent research has definitively proven that the

is no: the transformation cannot be done with fewer than four pieces. This establishes the four-piece solution as the minimum possible, making it a hard proof due to the complexity of demonstrating the absolute minimum.

Helpful resources related to this video

If you want to practice or explore the concepts discussed in the video, these commonly used tools may help.

Links may be affiliate links. We only include resources that are genuinely relevant to the topic.

Full transcript is not shown on this page

This page focuses on the summary and original notes. For full verification, refer to the original YouTube video.

PDF