Magic Triangle

Algebra Level 2

Using each of the integers from 1 to 7 exactly once, can we fill the squares such that the sums of the 3 squares along each of the 7 colored paths--6 lines and 1 circle--are all the same?

Yes No

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

4 solutions

Suppose this triangle could be completed successfully, and let x x be the sum of the numbers on each line. As there are a total of 7 'lines', (one of which is a circle), the sum of all 7 'line sums' is 7 x 7x . As each of the 7 boxes is included in 3 line sums, and as within each box is a distinct digit from 1 1 through 7 7 , we then require that

7 x = 3 × ( 1 + 2 + 3 + 4 + 5 + 6 + 7 ) 7 x = 3 × 28 x = 12 7x = 3 \times (1 + 2 + 3 + 4 + 5 + 6 + 7) \Longrightarrow 7x = 3 \times 28 \Longrightarrow x = 12 .

But using the digits from 1 1 through 7 7 taken three at a time, we can only achieve a sum of 12 12 in 5 ways, namely

( 1 , 5 , 6 ) , ( 1 , 4 , 7 ) , ( 2 , 3 , 7 ) , ( 2 , 4 , 6 ) (1,5,6), (1,4,7), (2,3,7), (2,4,6) and ( 3 , 4 , 5 ) (3,4,5) .

Since we require 7 different ways to achieve a sum of 12 12 , we must conclude that such a triangle cannot be completed successfully.

Nice contradiction too!

If we were allowed to put in any 7 distinct integers, do you think we can get the sum to work out?

Chung Kevin - 3 years, 10 months ago

Log in to reply

The answer is no.

Solving the system of equations (using linear algebra), one can show that the only set of real solutions is for all 7 values to be equal. Essentially, we have 7 equations and 8 unknowns (where the sum of the sides is an unknown). We need to verify that the equations are linearly independent. Then, we can conclude that the solutions (if any) are of the form k ( a 1 , a 2 , a 3 , a 4 , a 5 , a 6 , a 7 ) k (a_1, a_2, a_3, a_4, a_5, a_6, a_7) . Since ( 1 , 1 , 1 , 1 , 1 , 1 , 1 ) (1, 1, 1, 1, 1, 1, 1) is clearly a solution, thus the solutions are of the form k ( 1 , 1 , 1 , 1 , 1 , , 11 ) k(1, 1, 1, 1, 1, ,1 1) .

Calvin Lin Staff - 3 years, 10 months ago

Also, each number is 'connected' by a straight or circular path to every other number. Hence 7 and 6 are going to come in one of the sums which would then exceed the desired sum of 12.

Ujjwal Rane - 3 years, 9 months ago

Log in to reply

That was my reasoning Ujjwal

Steve Edwards - 3 years, 9 months ago
Chung Kevin
Aug 6, 2017

[When I first created this problem, I thought it was possible to do so. I was surprised when I couldn't arrange the digits.]

The sum of all 7 numbers is 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28 .
Each number appears in 3 colored lines, hence if each of the 7 colored lines have the same sum, then it would be equal to 28 × 3 7 = 12 \frac{ 28 \times 3 } { 7 } = 12 .
Now, consider where the 7 goes. The 3 lines that go through it will cover all the other 6 numbers. Pick the line which also has 6. Then, this line would have a sum of at least 7 + 6 + 1 = 14 > 12 7 + 6 + 1 = 14 > 12 .

So it is not possible for all of the colored lines to have the same sum.

Daniel Liu
Aug 28, 2017

Note that this figure has the interesting property that every point is intersected by exactly three paths, and every path intersects exactly three points. (This figure has many interesting properties; it is called the Fano Plane .)

Realize that if we take the three paths that a single point P P shares, the sum of the two numbers that are not on P P in each path have to be equal to one another. Thus, the sum of these 6 6 other numbers has to be a multiple of three. Thus, if x x is the number on P P , then 1 + 2 + 3 + 4 + 5 + 6 + 7 x 1+2+3+4+5+6+7-x has to be a multiple of three, which clearly is not satisfied for x = 2 , 3 , 5 , 6 x=2, 3, 5, 6 . Thus, there is no way to place the numbers.

Long Tran
Aug 27, 2017

Let's index the order of box from top to bottom and left to right as from 1 to 7. From segment 1-7 there are 4 odd and 3 even numbers, you can easily figure that the box 1,4,5,7 holding odd number to make sure that every paths in the graph make up the same sum. Now all the boxes in graph are in symmetric position, generally we put in 2 to box 2, 4 to box 3 and 6 to box 6. As all the paths make the same sum we have:

x + y + 2 = z + y + 6 = x + z + 4 { x = z + 4 x = y + 2 x + y + 2 = z + y + 6 = x + z + 4\\ \begin{cases} x = z + 4 \\ x = y + 2 \end{cases}

Possible ( x , y , z ) = ( 7 , 5 , 3 ) , ( 5 , 3 , 1 ) (x,y,z) = {(7,5,3), (5,3,1)} but the light blue and orange path isnt in compliance with the problem.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...