You Only Have Their Sums

Algebra Level 4

There are n 3 n \geq 3 people sitting in a circle, and each person is thinking of a number. Every consecutive pair announces the sum of their numbers (but not the individual numbers). For example, if there are three people with numbers a , b a, b and c c in that order, the three sums announced are a + b , b + c , a + b, b + c, and c + a . c + a .

For what values of n n can an outsider deduce all of the individual numbers?

Only prime n n All n n Only n = 3 n = 3 Only odd n n

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.

1 solution

Calvin Lin Staff
Oct 31, 2016

Let the numbers that the people are thinking of be denoted as a i a_i . Each consecutive pair announces the value of a i + a i + 1 a_i + a_{i+1} .

Hence, we are given n n linear equations in n n variables, and are asked "When can we solve this system completely?". We know that n n equations is just enough to solve it in n n variables. Moreover, if equations are essentially duplicates, then the information that we obtained is not sufficient to solve uniquely.

When n n is even, we see that by taking the sum of n 2 \frac{n}{2} pairs consisting of every other pair, we can find the sum of all of the people. This information is duplicated when we take the sum of the other n 2 \frac{n}{2} pairs, so we have at least one wasted equation. This suggests that there are multiple solutions: If ( a 1 , a 2 , , a n ) ( a_1, a_2, \ldots, a_n ) is a solution to the linear system, then

( a 1 + k , a 2 k , a 3 + k , a 4 k , , a n 1 + k , a n k ) ( a_1 + k, a_2 -k, a_3 + k, a_4 - k, \ldots, a_{n-1} +k , a_n -k )

is also another solution (since each consecutive pair perfectly cancels). Hence, the solution isn't unique, so the outsider is not able to deduce all of the individual numbers.

When n n is odd, as it turns out we have exactly enough information to determine each individual number.
First, if we add up all the pairs and divide by 2, we get the sum of each individual value. Let's call this A = a i A = \sum a_i .
Second, to find the value of a j a_j , we just go round and subtract each other pair from him, namely a j + 1 + a j + 2 , a j + 3 + a j + 4 , , a j 1 + a j 2 a_{j+1} + a_{j+2} , a_{j+3} + a_{j+4} , \ldots , a_{j-1 } + a_{j-2} . We can pair up these n 1 n-1 people perfectly.
Hence, the outside can use this approach to deduce all of the individual numbers.


In linear algebra terms, we are saying that the system is not linearly independent .

We could arrive at the conclusion by studying the determinant of the matrix:

A n = ( 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 1 0 0 0 1 ) A_n = \begin{pmatrix} 1 & 1 & 0 & \ldots & 0 & 0 \\ 0 & 1 & 1 & \ldots & 0 & 0 \\ & & & \ddots & & \\ 0 & 0 & 0 & \ldots & 1 & 1 \\ 1 & 0 & 0 & \ldots & 0 & 1 \\ \end{pmatrix}

In particular, the above shows that det ( A n ) = 0 \det ( A_n) = 0 if and only if n n is even.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...