Given that are distinct positive integers satisfying the following system of vector dot-products:
find .
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.
If we expand all the dot products and add them, we get a d + a e + a f + b d + b e + b f + c d + c e + c f = 2 2 1 . The left-hand side of this factorises!
We have ( a + b + c ) ( d + e + f ) = 2 2 1 = 1 3 ⋅ 1 7 . Now, since a , b , c , d , e , f are all positive integers, both a + b + c and d + e + f are greater than 1 ; so the only possibility is that a + b + c = 1 3 and d + e + f = 1 7 (or vice-versa), giving a + b + c + d + e + f = 3 0 .
Note we're safe to do this since the problem tells us such a solution exists. It's a harder problem to find the solution, but that isn't needed to solve the problem. However, one such solution is ( a , b , c , d , e , f ) = ( 2 , 4 , 7 , 5 , 9 , 3 ) .