Professional Documents
Culture Documents
Math 408
Fall 2016
By
Team BJL
Brett Shaw, Josh Cutter, Lauren Martin
Intended Audience
The Scissors Congruence Problem could be catered to both middle and high
school level students. The general concepts and ideas are not difficult to understand,
however the proofs in-depth can be more challenging. If middle school teachers would
like to use or demonstrate the Scissors Congruence Problem to their class it may be
done so on a conceptual level or visual level. However many details of the proof could
be better understood by a high school level geometry class, thus for our purposes we
Abstract
Given two polygons of equal area, can you slice one (with scissors), and
parallelograms, and rectangles. Extending thinking we ask, can this be done for
irregular polygons such as castles or stars? Furthermore can this be done for any
polygon?
Assume every polygon discussed has area N. To prove this, we first proved
parallelogram could be sliced and rearranged into a rectangle. Finally, because the area
of the polygons is N, we proved every rectangle could be sliced and rearranged into an
Nx1 rectangle. Once each polygon is an Nx1 rectangle we can apply the inverse
Finally we address remaining questions, helpful tips for teachers, and curriculum
connections.
Keywords
Because every polygon can be sliced into triangles, we begin by slicing our given
polygons of equal area (area = N) into triangles. We can then prove triangles can be
sliced and rearranged into parallelograms; parallelograms can be sliced and rearranged
into rectangles; and finally the rectangles can be sliced and rearranged into one N x 1
rectangle. Doing this to both polygons results in two Nx1 rectangles, which are
congruent. We can then apply the inverse operations to obtain the other polygon from
Conjectural Inquiry
Slice and rearrange one of polygons below so that it fits into the other.
1.
Slice and rearrange one of polygons below so that it fits into the other.
2.
Slice and rearrange one of polygons below so that it fits into the other.
3.
Each set of polygons have equal area and should be fairly easy to slice and
rearrange into the other. By having the students perform the slicing and rearranging
prompts the motivation for the Scissor Congruence Problem and begins to set up our
conjecture. Once students finish slicing and rearranging these problems, have groups
present and explain their slices and rearrangements to the class. This will enable them
to put into words their thoughts behind each cut and be able better understand the
problem. To promote deeper thinking and connecting, the following questions may be
asked:
2. Could you slice the other polygon and have it work the same?
4. Given any two polygons of equal area, do you think that we could slice and
The previous problems and questions should lead students to the conjecture:
Given two polygons of equal area, we can slice and rearrange one polygon to obtain the
other.
Proof Inquiry
Before we begin our proof we will define our key terms. A polygon is a planar
figure bounded by vertices and edges that are line segments. Let us define a slice as
cutting so that the new and remaining figures are polygons. Finally lets define
rectangles.
Because every polygon can be sliced into triangles, we can then prove that every
polygon, with area N, can be sliced and rearranged into N x 1 rectangles. Once each
polygon is sliced and rearranged into an N x 1 rectangle we can perform the inverse
operations to obtain the other equal area polygon. Thus every equal area polygon can
Further Exploration
In the proof, why is it significant that we can slice and rearrange each polygon
into a N x 1 rectangle?
Why is it imperative that each polygon can be sliced into some number of
triangles?
How would this problem change if we altered our definitions of slice and
rearrange?
Which parts of this proof, if any, would apply to a similar conjecture with 3D
polyhedron?
Wrap Up
Overall, we have looked at how a polygon, with area N, can be sliced into triangles,
each of those triangles sliced and rearranged into parallelograms, those parallelograms
can be sliced and rearranged into rectangles and those rectangles sliced and
rearranged into 1 x N rectangles. From there we can apply similar changes to the other
polygon so that both are in the form of 1 x N rectangles. From this position we can apply
the inverse of the rearrangements that we made to the other to either rectangle in order
to obtain the other original polygon. Thus polygons of equal area can be sliced and
Solutions
Definitions
A polygon is a planar figure bounded by vertices and edges that are line
segments.
Let us define a slice as cutting so that the new and remaining figures are
polygons.
Other answers:
2. Yes, we hope that students can conjecture that those cuts can be applied the other
3. Students should be inclined to think that these types of area comparisons can be
made to all shapes with the same area, not just regular polygons. They probably will not
know how to generalize the concept, but it will get them thinking beyond the basic
4. Here the overall general conjecture is presented as a question and hopefully students
will assume that we can indeed go from any polygon to another with the same area.
Guide
Curricular Alignment
Below is a list of standards that this problem brings forth for students. This
problem can be catered to middle or high school students, but we chose to look more at
the high school level. The standards in blue are what we considered to be prior
knowledge and the ones in black could be introduced in the problem. We felt that there
were a lot of geometry standards that lined up with this problem and if teachers wanted
to create a long-term project throughout a unit that this problem could make that happen
and allow the teacher to build upon the problem over time. If a long term project is not
possible, this problem can be used as an end of unit project as well. The standard in
purple was one we considered to be an extension of the problem. Even though it was a
seventh grade geometry standard, ideas from this one could be brought forth to think
We were most proud of our conjectural inquiry activity, because we felt that it
was an engaging way to get the students thinking about all of the ways that the
standards come together in this problem. Writing this question helped us to see how the
proof came together and better understand the steps and how they are connected to
each other.
Prior Knowledge
6.G.A.1
Find the area of right triangles, other triangles, special quadrilaterals, and
8.G.A.1
translations.
8.G.A.2
HSG-CO.A.1
and line segment, based on the undefined notions of point, line, distance
HSG-CO.A.4
HSG-CO.A.5
Introduced
HSG-CO.B.6
predict the effect of a given rigid motion on a given figure; given two
HSG-CO.B.7
Use the definition of congruence in terms of rigid motions to show that two
HSG-CO.B.8
Explain how the criteria for triangle congruence (ASA, SAS, and SSS)
Prove theorems about lines and angles. Theorems include: vertical angles
HSG-CO.C.10
parallel to the third side and half the length; the medians of a triangle meet
at a point.
HSG-CO.C.11
Extension
7.G.A.3
The conjectural inquiry intentionally ties into our proof of the Scissor Congruence
Problem. Having the students work directly with the main components of the proof,
allows for connections to be made and for a smooth transition into the details of the
proofs. Once the students are able to see an example of each step - triangle to
conceptually apply and understand how it would work for any given polygon. They dont
realize it but they have already conceptually proven this problem. The two things that
we dont explicitly prove but are imperative to the problem are the polygonal
triangulation theorem, that every polygon can indeed be sliced into triangles, and that all
of these slices and rearrangements can be done in reverse to obtain the original shape.
These two things make sense conceptually because they are logical, but we dont
actually prove them explicitly, so they should be discussed in detail for the students
understanding.
Additional Resources
Helpful theorems
These are theorems and corollaries that we found helpful when proving
this problem.