We place the numbers in this pyramid so that each small triangle contains one number. The condition is that the sum of the numbers in the three medium triangles (each consisiting of four small tiangles) should be the same. Let be this sum.
If the minimum value of is , and the maximum is , then find the value of .
One possible solution, where :
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.
We get ( a + b + c + d ) + ( b + e + f + g ) + ( d + g + h + i ) = 3 N = 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + b + d + g = 4 5 + b + d + g .
So b + d + g = 3 ( N − 1 5 ) .
Since b , d , g are different digits, 6 ≤ b + d + g ≤ 2 4 , 2 ≤ N − 1 5 ≤ 8 , 1 7 ≤ N ≤ 2 3 .
So the minimum of N is 1 7 , and here is a possible numbering:
So the maximum of N is 2 3 , and here is a possible numbering: We get from these that y − x = 2 3 − 1 7 = 6 .