Arrange integers 1- 15 in a triangle such that the upper row consists of 5 integers, all other rows represent each the absolute values of the differences between the adjacent members of the row above so that the 5th row contains one number only.
A bad example:
4 7 15 10 2
3 12 5 8
9 7 * oops! Can't use 3 again.
Just wanted to explain the build-up..
Better luck to the solvers!
(In reply to
re: computer solution by Jer)
I'm looking into why higher order triangles, even 6, are taking so long.
Must be related to the fact that Perm(15,5) is only 360360, while Perm(21,6) = 39070080.
Meanwhile:
For starters some lower order triangles:
6 1 10 8
5 9 2
4 7
3
6 10 1 8
4 9 7
5 2
3
8 1 10 6
7 9 4
2 5
3
8 3 10 9
5 7 1
2 6
4
8 10 1 6
2 9 5
7 4
3
8 10 3 9
2 7 6
5 1
4
9 3 10 8
6 7 2
1 5
4
9 10 3 8
1 7 5
6 2
4
--------------
1 6 4
5 2
3
2 6 5
4 1
3
4 1 6
3 5
2
4 6 1
2 5
3
5 2 6
3 4
1
5 6 2
1 4
3
6 1 4
5 3
2
6 2 5
4 3
1
Edited on February 3, 2016, 10:07 pm
|
|
Posted by Charlie
on 2016-02-03 22:02:24 |
re(2): computer solution
