In any triangle, the length of the longest side is less than half of the perimeter. All triangles with perimeter 57 and integer side lengths , , , such that are constructed. How many such triangles are there?
Problem 670
Pick one
Official solution
We begin by numbering the checkerboard squares from 1 to 16, as shown, so that we may refer to each of them specifically.
[[IMAGE0]]
We denote a move “up" by the letter and a move “right" by .
We will begin by determining which of the 16 squares will not be touched by the face with the circle and then proceed to show that the remaining squares will be touched by the face with the circle.
Since the cube begins on square 1 and the circle is facing out, square 1 will not be touched by the face with the circle.
Similarly, each of the squares 2, 3, 4 can only be reached by moving the cube right (the sequence of moves to reach each of these three squares is , and , respectively), and in each case the circle remains facing out.
Squares 2, 3 and 4 will not be touched by the face with the circle.
Squares 5 and 9 can only be reached by moving the cube up (the sequence of moves to reach each of these two squares is and , respectively).
In either case, the face with the circle will not touch squares 5 and 9.
Square 6 can be reached with two different sequences of moves, or .
In both cases, the face with the circle will not touch square 6.
Square 10 can be reached with three different sequences of moves, , or .
In all three cases, the face with the circle will not touch square 10.
In turns out that these eight squares () are the only squares that will not be touched by the face with the circle on any path.
The table below lists sequences of moves that demonstrate how each of the remaining eight squares will be touched by the face with the circle.
The second column lists the sequence of moves, while the third column lists the position of the face with the circle as the cube progresses through the sequence of moves.
We have used the letters for front, for back, for top, for bottom, for left, and for right to indicate the location of the face containing the circle.
Square
Sequence of Moves
Position of the Circle
7
8
11
12
13
14
15
16
Therefore, the number of different squares that will not be contacted by the face with the circle on any path is 8.