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.
WLOG 0 = a 1 < a 2 < a 3 < a 4 ,since we only care about the difference between them.
Then the condition becomes that a 2 a 3 a 4 ( a 3 − a 2 ) ( a 4 − a 2 ) ( a 4 − a 3 ) is a perfect square,
and what we want to minimize becomes f = 3 a 4 + a 3 − a 2 .
It's easy to find that ( a 2 , a 3 , a 4 ) = ( 3 , 5 , 8 ) satisfies the condition and gives us f = 2 6 .
When a 4 ≥ 9 ,we have f ≥ 3 a 4 + 1 ≥ 2 8 .So we only need to check the case when a 4 = 3 , 4 , 5 , 6 , 7 , 8 .
Well,it's not hard.Just pay your patience to check one by one.
I guess that there might be a more elegant solution to this beautiful problem.So please share with us if you've found one.