Katie arithmetic mean

Algebra Level pending

Katie has a list of real numbers such that the sum of the numbers on her list is equal to the sum of the squares of the numbers on her list. Compute the largest possible value of the arithmetic mean of her numbers.


The answer is 1.

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

Chris Lewis
Jul 13, 2020

Let the numbers on Katie's list be x 1 , , x n x_1,\cdots,x_n . We wish to maximise x = 1 n x i \overline{x}=\frac{1}{n} \sum x_i subject to the condition x i 2 x i = 0 \sum x_i^2 - x_i=0 .

Solution 1: Lagrange multipliers

For a fixed positive integer n n , let F ( x 1 , , x n , L ) = 1 n x i + L n x i 2 x i F(x_1,\cdots,x_n,L) = \frac{1}{n} \sum x_i + \frac{L}{n}\sum x_i^2 - x_i

The maximum of x \overline{x} subject to the constraint is achieved when each of the partial derivatives of F F is zero. For each i i , we have F x i = 1 n + L n ( 2 x i 1 ) = 0 \frac{\partial F}{\partial x_i} = \frac{1}{n} + \frac{L}{n}(2x_i-1)=0

The trick here is to note that this means (for an extremum) all of the x i x_i must be equal - in fact, x i = x x_i=\overline{x} for each i i . Hence x 2 x = 0 \overline{x}^2-\overline{x}=0 , so x = 0 \overline{x}=0 or x = 1 \overline{x}=\boxed{1} .


Solution 2: Geometry

The condition can be rewritten as ( x i 1 2 ) 2 = n 4 \sum \left(x_i - \frac12 \right)^2=\frac{n}{4} . This is the equation of an n n dimensional sphere, S c S_c centred at ( 1 2 , 1 2 , , 1 2 ) (\frac12,\frac12,\cdots,\frac12) with radius n 4 \sqrt{\frac{n}{4}} .

Due to the condition, maximising the arithmetic mean of the values is the same as maximising x i 2 = r 2 \sum x_i^2=r^2 . This is also an n n dimensional sphere, S S , centred at O O .

The point ( x 1 , , x n ) (x_1,\cdots,x_n) lies on both spheres. In order to maximise r r , the spheres must be tangent to each other ( S c S_c is inside S S ). The point of tangency must lie on the line joining their centres; hence again we find all the x i x_i are equal, and the rest of the derivation is as in solution 1.

The list may contain the following numbers : ( 0 , 0 , 0 , . . . . ) , ( 0 , 1 ) , ( 0 , 0 , 1 ) , . . . ( 0 , 0 , 0 , . . . . , 1 ) , ( 1 , 1 ) , ( 0 , 1 , 1 ) , . . . . (0,0,0,....),(0,1),(0,0,1),...(0,0,0,....,1),(1,1),(0,1,1),.... . Of these, the list ( 1 , 1 ) (1,1) has the largest mean, which is 1 \boxed 1 .

How do you know that at most 2 of the elements in this list can be 1 and the others are 0?

Pi Han Goh - 11 months ago

Log in to reply

Yes, I am also confused. And BTW, can we apply AM GM here? Or something related?

Mahdi Raza - 11 months ago

Log in to reply

No. The numbers are not necessarily positive.

Pi Han Goh - 11 months ago

Log in to reply

@Pi Han Goh Right! What if assume cases and in the first case the numbers are real. But that would also be vague again. Thanks! P.S. This made we wonder whether for two negative numbers, the AM GM flips the inequality:

x + y 2 x y \dfrac{x+y}{2} \leq \sqrt{xy}

Mahdi Raza - 11 months ago

Log in to reply

@Mahdi Raza let x = -X, y = -Y, you got two positive numbers.

Pi Han Goh - 11 months ago

Log in to reply

@Pi Han Goh @Mahdi Raza - I think the key is to split the problem into two parts. First, show that for a maximum, all the numbers on the list need to be the same. Second, use that to simplify and solve the original question.

I've posted a couple of ways to do the first part (which is the interesting bit), but I'm sure you could find others. AM-GM is a good intuition because it leads directly to the conclusion that all the numbers are equal, but as per your discussion with @Pi Han Goh , you'll need to find positive numbers somewhere.

Chris Lewis - 11 months ago

Log in to reply

@Chris Lewis Beautiful solution!

Pi Han Goh - 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...