pull down to refresh

I brute forced it
import numpy as np import itertools A,B,C,D,E,F,G,H,I,J = 0,1,2,3,4,5,6,7,8,9 x = np.arange(1,11) for p in itertools.permutations(x, 10): red = p[A]+p[B]+p[C]+p[D]+p[E] yellow = p[C]+p[D]+p[F]+p[G]+p[H] green = p[B]+p[C]+p[D]+p[E]+p[G]+p[H]+p[I] blue = p[D]+p[E]+p[H]+p[I]+p[J] if (red==yellow) and (red==green) and (red==blue): break p
D = 7
I think I get the logic of it but I don't have a proof.
A = G+H+I F = B+E+I J = B+C+G
That means they are each at least 6 and none of B, C, E, G, H, or I can be larger than 6, which means they make up 1-6 in some order.
Then, it must be impossible to arrange them such that any of A, F, or G are equal to seven without one of them being greater than 10.
That leaves 7 for D.
reply
Yes, 7 is correct: #731084
reply