4 numbers are given such that each of the 6 pairwise sums are distinct. If the 4 smallest sums are 7 , 9 , 1 0 and 1 4 , what is the largest possible product of these 4 numbers?
Details and assumptions
The numbers are not necessarily integers.
The the numbers were 1 , 2 , 3 , 4 , then the 6 pairwise sums are 3 = 1 + 2 , 4 = 1 + 3 , 5 = 1 + 4 , 5 = 2 + 3 , 6 = 2 + 4 , 7 = 3 + 4 .
2 numbers are distinct if they are not the same.
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.
A lot of students had problems figuring out that there were 2 cases. Students that assumed a < b < c < d and a + d < b + c were confused as to why 432 was rejected.
We get a partial ordering on the set of pairwise sums. Just knowing that a < b < c < d doesn't allow us to conclude if a + d < b + c or if b + c < a + d .
Let the 4 numbers be a , b , c and d . Since the pairwise sums are distinct, the 4 numbers are distinct. Without loss of generality, let a < b < c < d . Observe that a + b is the smallest pairwise sum, and a + c is the second smallest pairwise sum. Hence we have a + b = 7 and a + c = 9 , thus a = 2 1 6 − ( b + c ) . Likewise, d + c is the largest pairwise sum, and b + d is the second largest pairwise sum. Now we have the following cases:
Case 1: a + d = 1 0 and b + c = 1 4 . So a = 2 1 6 − 1 4 = 1 , and substituting this into the other three gives b = 6 , c = 8 and d = 9 . Thus the product is 1 × 6 × 8 × 9 = 4 3 2 .
Case 2: a + d = 1 4 and b + c = 1 0 . So a = 2 1 6 − 1 0 = 3 , and substituting this into the other three gives b = 4 , c = 6 and d = 1 1 . Thus the product is 3 × 4 × 6 × 1 1 = 7 9 2 .
Hence, the largest possible product is 7 9 2 .
I solved some numbers from 1 to 13 as in quest max no is 14 so last possibility of sum of 14 in my mind is that one so think then the 4 numbers b/w 1 and 13 and their check their sum as smallest sums are 7,9,10 and 14. Now the method 3 + 4 = 7, 4+6 =10, 3+6 = 9 , 3+11 = 14, and other largest two sums are 4+11=15 and 6+11 = 17 where 3 4 6*11=792
a < b < c < d
a + b = 6
largest a * b=12 with a = 3 and b = 4
a + c = 9 --> c = 9 - 3 = 6
b + c = 10 (correct)
a + d = 14 --> d = 14 - 3 = 11
so: a = 3 ; b = 4 ; c = 6 ; d = 11
then a * b * c * d = 792 (largest).
Suppose the 4 numbers are A, B, C, D. Since the sums are distinct, the numbers must also be distinct. For the product to be as large as possible, the four numbers need to be as close as possible. Without loss of generality, suppose A<B<C<D, we get A+B=7, A+C=9, A+D=14, B+C=10 (for A,B,C,D to be as close as possible). We then get 2(A+B+C)=26, so A+B+C=13 We get A=3, B=4, C=6, D=11, so the product is 792
Problem Loading...
Note Loading...
Set Loading...
Since the pairwise sums are distinct, no two of the numbers can be the same. Let the 4 numbers be a < b < c < d . The 6 sums will be a + b , a + c , a + d , b + c , b + d , and c + d . We can easily see that c + d and b + d are the 2 largest sums, with b + d < c + d . We can also easily see that a + b and a + c are the 2 smallest sums, with a + b < a + c . Thus a + b = 7 , a + c = 9 , so c − b = 2 and note there are 2 cases to deal with.
Case 1: a + d = 1 0 , b + c = 1 4 , With c − b = 2 , this implies that c = 8 , b = 6 . Using a + c = 9 , we get a = 1 . Using a + d = 1 0 , we get d = 9 , thus a b c d = 4 3 2 .
Case 2: b + c = 1 0 , a + d = 1 4 . With c − b = 2 , this implies that c = 6 , b = 4 . Using a + c = 9 , we get a = 3 . Using a + d = 1 4 , we get d = 1 1 , thus a b c d = 7 9 2 .
Thus, the largest possible product is 792.