Problems

Age
Difficulty
Found: 1301

Look at the following diagram, depicting how to get an extra cell by reshaping triangle.
image
Can you find a mistake? Certainly the triangles have different area, so we cannot obtain one from the other one by reshaping.

This problem is often called "The infinite chocolate bar". Depicted below is a way to get one more piece of chocolate from the 5×6 chocolate bar. Do you see where is it wrong?
image

Consider the following "proof" that any triangle is equilateral: Given a triangle ABC, we first prove that AB=AC. First let’s draw the bisector of the angle A. Now draw the perpendicular bisector of segment BC, denote by D the middle of BC and by O the intersection of these lines. See the diagram
image
Draw the lines OR perpendicular to AB and OQ perpendicular to AC. Draw lines OB and OC. Then the triangles, RAO and QAO are equal, since we have equal angles ORA=OQA=90°, and RAO=QAO, and the common side AO. On the other hand the triangles ROB and QOC are also equal since the angles BRO=CQO=90°, the hypotenuses BO=OC the legs RO=OQ. Thus, AR=AQ, RB=QC, and AB=AR+RB=AQ+QC=AC. Q.E.D.

As a corollary, one can show that all the triangles are equilateral, by showing that AB=BC in the same way.

Let’s prove the following statement: every graph without isolated vertices is connected.
Proof We use the induction on the number of vertices. Clearly the statement is true for graphs with 2 vertices. Now, assume we have proven the statement for graphs with up to n vertices.
Take a graph with n vertices by induction hypothesis it must be connected. Let’s add a non-isolated vertex to it. As this vertex is not isolated, it is connected to one of the other n vertices. But then the whole graph of n+1 vertices is connected!

Nick has written in some order all the numbers 1,2,...33 at the vertices of a regular 33-gon. His little sister Hannah assigned to each side of the 33-gon the number equal to the sum of the numbers at the ends of that side. It turns out that Hannah obtained 33 consecutive numbers in certain order. Can you find an arrangement of numbers as written by Nick which lead to this situation?

Is it possible to arrange the numbers 1,2,...,50 at the vertices and middles of the sides of a regular 25-gon so that the sum of the three numbers at the ends and in the middle of each side is the same for all sides?

Draw a shape that can be cut into 4 copies of the figure on the left or into 5 copies of the figure on the right (the figures can be rotated).
image

A equilateral triangle made of paper bends in a straight line so that one of the vertices falls on the opposite side as shown on the picture. Prove that the corresponding angles of the two white triangles are equal.
image

Sometimes proof of a statement requires elaborate reasoning, but sometimes it enough to provide an example when the described construction works. Often enough the problem is asking whether an event is possible, or if an object exists under certain conditions making the existence seemingly unlikely, in such cases all you need to do is to provide an example to solve the problem. Today we will see how to construct such examples.

In a lot of geometric problems the main idea is to find congruent figures. We call two polygons congruent if all their corresponding sides and angles are equal. Triangles are the easiest sort of polygons to deal with. Assume we are given two triangles ABC and A1B1C1 and we need to check whether they are congruent or not, some rules that help are:

  • If all three corresponding sides of the triangles are equal, then the triangles are congruent.

  • If, in the given triangles ABC and A1B1C1, two corresponding sides AB=A1B1, AC=A1C1 and the angles between them BAC=B1A1C1 are equal, then the triangles are congruent.

  • If the sides AB=A1B1 and pairs of the corresponding angles next to them CAB=C1A1B1 and CBA=C1B1A1 are equal, then the triangles are congruent.

At a previous geometry lesson we have derived these rules from the axioms of Euclidean geometry, so now we can just use them.