Terms overload

Algebra Level 5

Real numbers a 1 , a 2 , , a 80090 a_1, a_2, \ldots, a_{80090} satisfy

( a 1 + a 2 + + a 80090 ) 2 + a 1 2 + a 2 2 + + a 80090 2 80090. (a_1 + a_2 + \ldots + a_{80090} )^2 + a_1 ^2 + a_2^2 + \ldots + a_{80090}^2 \leq 80090.

What is the smallest integer value of N N such that for all possible such tuples ( a 1 , . . . , a 80090 ) (a_1,...,a_{80090}) , we have a i N |a_i| \leq N for all i i ?


The answer is 284.

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.

3 solutions

Mark Hennings
Oct 14, 2013

We wish to maximise f ( x ) = x 1 f(\mathbf{x}) = x_1 subject to the relation g ( x ) = ( x 1 + x 2 + + x n ) 2 + x 1 2 + x 2 2 + + x n 2 = n g(\mathbf{x}) \; = \; (x_1 + x_2 + \cdots + x_n)^2 + x_1^2 + x_2^2 + \cdots + x_n^2 \; = \; n By Lagrange Multipliers, we need to find λ \lambda such that f λ g = 0 \nabla f - \lambda \nabla g \,=\, \mathbf{0} . For 2 i n 2 \le i \le n , the i i th component of f λ g \nabla f - \lambda \nabla g is λ [ 2 ( x 1 + x 2 + + x n ) + 2 x i ] = 0 -\lambda\big[2(x_1+x_2 +\cdots + x_n) + 2x_i\big] \; = \; 0 so we deduce that x 2 = x 3 = = x n = y x_2=x_3=\cdots=x_n = -y where x 1 = n y x_1=ny . Considering the first component of f λ g \nabla f - \lambda \nabla g would determine λ \lambda , but we are not interested in that. We have n = g ( x ) = ( x 1 + x 2 + + x n ) 2 + x 1 2 + x 2 2 + + x n 2 = y 2 + ( n y ) 2 + ( n 1 ) y 2 = n ( n + 1 ) y 2 \begin{array}{rcl} n \; = \; g(\mathbf{x}) & = & (x_1+x_2+\cdots+x_n)^2 + x_1^2 + x_2^2 + \cdots + x_n^2 \\ & = & y^2 + (ny)^2 + (n-1)y^2 \; = \; n(n+1)y^2 \end{array} and hence y = 1 n + 1 y = \frac{1}{\sqrt{n+1}} . Thus x 1 = n n + 1 x_1 = \frac{n}{\sqrt{n+1}} .

Thus it follows that x i n n + 1 |x_i| \le \frac{n}{\sqrt{n+1}} for all 1 i n 1 \le i \le n whenever g ( x ) = n g(\mathbf{x}) = n .

Now 80089 = 28 3 2 80089 = 283^2 and it is easy to show that m < m 2 + 1 m 2 + 2 < m + 1 m \; < \; \frac{m^2+1}{\sqrt{m^2+2}} \; < \; m+1 and hence the smallest integer value of N N that we want to answer the question is 80090 80091 + 1 = 284 \left\lfloor \frac{80090}{\sqrt{80091}}\right\rfloor+1 \; = \; 284 The answer is not 283 283 , but calculators will not spot this, since 80090 80091 = 283.000000022 \frac{80090}{\sqrt{80091}}=283.000000022 .

Nice solution. An alternative would be to use the RMS-AM inequality:

a 2 2 + a 3 2 + + a n 2 ( a 2 + a 3 + + a n ) 2 n 1 a_2^2 + a_3^2 + \ldots + a_n^2 \ge \frac { (a_2 + a_3 + \ldots + a_n)^2} {n-1}

Let s = a 2 + + a n s = a_2 + \ldots + a_n . This gives:

n 1 ( a 1 + + a n ) 2 + a 1 2 + + a n 2 ( a 1 + s ) 2 + a 1 2 + s 2 n 1 . \begin{aligned} n-1 &\ge (a_1 + \ldots + a_n)^2 + a_1^2 + \ldots + a_n^2 \\ &\ge (a_1 + s)^2 + a_1^2 + \frac{s^2}{n-1}.\end{aligned}

Now express this as a quadratic equation in s s - the fact that s s is real gives a discriminant condition in a 1 a_1 .

C Lim - 7 years, 8 months ago

My solution goes like this:

A certain inequality (I forgot the name) holds that:

a 1 2 a_1^2 + a 2 2 a_2^2 + ... + a 80090 2 a_{80090}^2 \geq ( a 1 + a 2 + . . . + a 80090 ) 2 80090 \frac {(a_1 + a_2 + ... + a_{80090})^2}{80090}

By Addition Property of Inequality:

a 1 2 a_1^2 + a 2 2 a_2^2 + ... + a 80090 2 a_{80090}^2 + ( a 1 + a 2 + . . . + a 80090 ) 2 (a_1 + a_2 + ... + a_{80090})^2 \geq 80091 ( a 1 + a 2 + . . . + a 80090 ) 2 80090 \frac {80091(a_1 + a_2 + ... + a_{80090})^2}{80090}

Using the given above:

80090 \geq a 1 2 a_1^2 + a 2 2 a_2^2 + ... + a 80090 2 a_{80090}^2 + ( a 1 + a 2 + . . . + a 80090 ) 2 (a_1 + a_2 + ... + a_{80090})^2 \geq 80091 ( a 1 + a 2 + . . . + a 80090 ) 2 80090 \frac {80091(a_1 + a_2 + ... + a_{80090})^2}{80090}

By Squeezing Method:

80090 \geq 80091 ( a 1 + a 2 + . . . + a 80090 ) 2 80090 \frac {80091(a_1 + a_2 + ... + a_{80090})^2}{80090}

By Multiplication Property of Inequality ( 80090 > 0 80090 > 0 and 80091 > 0 80091 > 0 so there is nothing to worry about the inequality symbol) :

8009 0 2 80091 \frac {80090^2}{80091} \geq ( a 1 + a 2 + . . . + a 80090 ) 2 (a_1 + a_2 + ... + a_{80090})^2

Taking the square root of both sides:

284 \geq a 1 + a 2 + . . . + a 80090 a_1 + a_2 + ... + a_{80090}

Therefore any a i a_i is always less than 284

Rindell Mabunga - 7 years, 7 months ago

Log in to reply

This is my solution. The calculator only displayed 283 when i took the square root of both sides of the inequality that's why I arrived to a wrong answer. Thanks

Rindell Mabunga - 7 years, 7 months ago

a's are reals, not necessarily positive!? I use the easily proven fact that a1 is maximized when a2 through a80090 are identical negative numbers (each = -t ), so that a1^2+ 80089t^2+ (a1-80089t)^2<=80090. In this quadratic form, a1 is maxed when a1=80090t. Plug in and solve for a1 -> a1<284.

Yezi Joy - 7 years, 7 months ago

Oh I think it is the Cauchy–Schwarz inequality :)

Happy Melodies - 7 years, 7 months ago

Almost did this correctly, it was that nasty calculator rounded the value down to 283

Rindell Mabunga - 7 years, 7 months ago
C Lim
Oct 13, 2013

This follows from two claims:

Step 1 : If

( a 1 + a 2 + + a 80090 ) 2 + a 1 2 + a 2 2 + + a 80090 2 80090 ( ) , (a_1 + a_2 + \ldots + a_{80090})^2 + a_1^2 + a_2^2 + \ldots + a_{80090}^2 \le 80090 (*),

then a i 283.9 |a_i| \le 283.9 for all i i .

Proof : If a i > 283.9 |a_i| > 283.9 , then a i 2 > 80090 a_i^2 > 80090 so the inequality (*) does not hold. (QED)

Step 2 : There exist real numbers a 1 , , a 80090 a_1, \ldots, a_{80090} such that (*) holds and a 1 = 283 a_1 = 283 .

Proof : Indeed, let a 1 = 283 a_1 = 283 and a 2 = a 3 = = a 80090 = 1 283 a_2 = a_3 = \ldots = a_{80090} = -\frac 1 {283} . Then the expression in (*) is exactly 80090. (QED)

I too went by this method but I wasn't sure about it.

Dinesh Chavan - 7 years, 8 months ago

My apologies, I just realised that my solution only proves that N < 282 N<282 is not viable.

It takes more effort to prove that a i 283 |a_i| \le 283 for all i i . Will think more about it. :(

C Lim - 7 years, 8 months ago

I'm starting to think the solution is wrong. Correct me if I'm wrong, but:

  • a 1 = 283 + 1 0 8 a_1 = 283 + 10^{-8} , and a 2 = a 3 = = a 80090 = 0.003533500 a_2 = a_3 = \ldots = a_{80090} = -0.003533500

seem to satisfy the inequality, with a 1 > 283 |a_1| > 283 ? That would mean N = 283 N=283 fails.

C Lim - 7 years, 8 months ago

Log in to reply

See my post.

Mark Hennings - 7 years, 8 months ago
Darryl Yeo
Oct 14, 2013

We need to find the largest a i a_{i} ever possible to find the smallest N. We can accomplish this by making all but one a i a_{i} 0. This simplifies the inequality to a 2 80090 a^{2}≤80090 .

From this we know that the highest possible a a is 80090 283.0018 \sqrt{80090} ≈ 283.0018 . The integer immediately above is 284.

N must be 284 .

If all but one are zero, the inequality becomes 2 a 2 80090 2a^2 \le 80090 , giving a 200.11 |a| \le 200.11 .

Mark Hennings - 7 years, 8 months ago

Log in to reply

I see... you're right. How did my answer work, then? Was that a coincidence?

Darryl Yeo - 7 years, 8 months ago

Log in to reply

Yes. If you look at my answer, you see that the upper bound of 80090 80091 \frac{80090}{\sqrt{80091}} is less than 80090 \sqrt{80090} , but not (quite!) enough to take the integer answer down to 283 283 .

Mark Hennings - 7 years, 8 months ago

Since the inequality works with very very small a i, the largest a i, a k satisfies 284>a k>283

Cuong Doan - 7 years, 8 months ago

Log in to reply

@Cuong Doan There is tension in the inequality though. If you use very small negative a i a_i , then the sum can still be very large. You need to justify that statement.

Calvin Lin Staff - 7 years, 7 months ago

I see... you're right. How did my answer work, then? Was that a coincidence?

@Darryl Y,

You're off to a good start, but you need to consider this question: if one of the a's is about 283, what do you want the other a's to be (given that you want the expression in parentheses to be about 0)?

Peter Byers - 7 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...