More Sums

A list of six positive integers p , q , r , s , t , u p,q,r,s,t,u satisfies p < q < r < s < t < u p<q<r<s<t<u .

There are exactly 15 15 pairs of numbers that can be formed by choosing two different numbers from this list. The sums of these pairs of numbers are:

25 , 30 , 38 , 41 , 49 , 52 , 54 , 63 , 68 , 76 , 79 , 90 , 95 , 103 , 117 25,30,38,41,49,52,54,63,68,76,79,90,95,103,117 .

Which sum equals to r + s ? r+s ?

63 52 54 68 76

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.

2 solutions

Áron Bán-Szabó
Jun 26, 2017

By adding up the 15 15 numbers, we added up each letter five times, so p + q + r + s + t + u = 25 + 30 + 38 + 41 + 49 + 52 + 54 + 63 + 68 + 76 + 79 + 90 + 95 + 103 + 117 5 = 196 p+q+r+s+t+u=\frac{25+30+38+41+49+52+54+63+68+76+79+90+95+103+117}{5}=196 . Since 25 25 is the least and 117 117 is the largest, 25 = p + q 25=p+q and 117 = t + u 117=t+u .

So r + s = p + q + r + s + t + u ( p + q ) ( t + u ) = 196 25 117 = 54 r+s=p+q+r+s+t+u-(p+q)-(t+u)=196-25-117=\boxed{54}


Now we will see what numbers can be p , q , r , s , t , u p, q, r, s, t, u be. We can notice that p + q = 25 , p + r = 30 , t + u = 117 , s + u = 103 p+q=25, p+r=30, t+u=117, s+u=103 . So r = q + 5 r=q+5 and t = s + 14 t=s+14 . It is easy to see that q + r q+r is is 38 , 41 , 49 o r 52 38, 41, 49 or 52 . Since q + r = 2 q + 5 q+r=2q+5 , q + r q+r can't be 38 38 or 52 52 , because they are positive integers, so 2 q + 5 = 41 2q+5=41 or 49 49 , 2 q = 36 2q=36 or 44 44 , q = 18 q=18 or 22 22 , r = 23 r=23 or 27 27 . Similarly we get: s + t s+t is 95 , 90 , 79 95, 90, 79 or 76 76 , but s + t = 2 s + 14 s+t=2s+14 , so s + t = 2 s + 14 = 90 s+t=2s+14=90 or 76 76 , s = 38 s=38 or 31 31 , t = 52 t=52 or 45 45 . We know q q and t t , so we know that p = 7 p=7 or 3 3 , u = 65 u=65 or 72 72 .

Finally we have:

About p p , q q and r r : { p = 7 , q = 18 , r = 23 p = 3 , q = 22 , r = 27 \large \begin{cases} p=7, q=18, r=23 \\ p=3, q=22, r=27\end{cases}

About s , t s, t and u u : { s = 31 , t = 45 , u = 72 s = 38 , t = 52 , u = 65 \large \begin{cases} s=31, t=45, u=72 \\ s=38, t=52, u=65\end{cases}

Since r + s = 54 r+s=54 , the only possible solution is:

p = 7 < q = 18 < r = 23 < s = 31 < t = 45 < u = 72 p=7<q=18<r=23<s=31<t=45<u=72

Note : In the beginning we proved that if there exist six positive integers that satisfy the given condition, then r + s = 54 r+s=54 . But it isn't enough!!! We have to give an example, because if there isn't exist six positive integers like this, then the answer is not 54. Be careful!

For completeness, does there exist 6 integers that satisfy the given condition?

Calvin Lin Staff - 3 years, 11 months ago

Log in to reply

I edited my solution. There I proved that there is only one possible solution for the numbers.

Áron Bán-Szabó - 3 years, 11 months ago

Yes, it is absolutely correct. Thank you for the solution.

Hana Wehbi - 3 years, 11 months ago
Hana Wehbi
Jun 27, 2017

If we take each letter and add it to the others we are going to have 5 5 sums. Take for example p p and add it to every other letter, we will obtain: p + q , p + r , p + s , p + t , p + u p+q, p+r, p+s, p+t, p+u . Similarly, the same method can be applied to the other letters.

Adding all these sums, we get:

5 p + 5 q + 5 r + 5 t + 5 u + 5 s = 5 ( p + q + r + s + t + u ) = 25 + 30 + 38 + 41 + . . . + 103 + 117 = 980 5p+5q+5r+5t+5u +5s = 5( p+q+r+s+t+u ) = 25 + 30 + 38 + 41 + ... + 103+ 117 = 980

Thus, p + q + r + s + t + u = 980 5 = 196 p+q+r+s+t+u = \frac{980}{5} = 196 .

Since p + q p+q is the smallest sum, implies p + q = 25 p+q= 25 , and t + u t+u is the greatest sum, then t + u = 117 t+u = 117 .

Now, p + q + r + s + t + u = ( p + q ) + ( r + s ) + ( t + u ) = 25 + ( r + s ) + 117 = 196 ( r + s ) = 54 p+q+r+s+t+u = (p+q) + (r+s) + (t+ u) = 25 + (r+s) + 117 = 196 \implies (r+s)= 54

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...