Question 15
In the diagram below, the integers from 1 to 9 are to be filled into each circle, where each number is used exactly once, such that each number in the top row is equal to the sum of the two numbers in the two connected circles in the bottom row. For example, A = E + F and C = G + H. What is the minimum sum of all the numbers in the top row?
