x 1 4 x 1 1 6 x 1 + 4 x 2 + 9 x 2 + 2 5 x 2 + 9 x 3 + 1 6 x 3 + 3 6 x 3 + 1 6 x 4 + 2 5 x 4 + 4 9 x 4 + 2 5 x 5 + 3 6 x 5 + 6 4 x 5 + 3 6 x 6 + 4 9 x 6 + 8 1 x 6 + 4 9 x 7 + 6 4 x 7 + 1 0 0 x 7 = = = 1 1 0 1 0 0
Given that x 1 , x 2 , … x 7 are real numbers that satisfy the system of equations above.
What is the value of 9 x 1 + 1 6 x 2 + 2 5 x 3 + 3 6 x 4 + 4 9 x 5 + 6 4 x 6 + 8 1 x 7 ?
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.
The key here is to flip your idea of what you call the variables. Instead of seeing x as the variable, consider the coefficients. For example, we can rewrite the first equation as:
( 1 ) 2 ( x 1 ) + 2 2 ( x 2 ) + . . . . + 7 2 ( x 7 ) = 1 . This is more striking if we write expand the coefficients as functions of the first term:
( 1 ) 2 ( x 1 ) + ( 1 + 1 ) 2 ( x 2 ) + ( 1 + 2 ) x 3 + . . . . . + ( 1 + 6 ) 2 ( x 7 ) = 1 .
Likewise, the other two can be rewritten with as
( 2 ) 2 ( x 1 ) + ( 2 + 1 ) 2 ( x 2 ) + ( 2 + 2 ) ( x 3 ) + . . . + ( 2 + 6 ) 2 ( x 7 ) = 1 0 ,
( 4 ) 2 ( x 1 ) + ( 4 + 1 ) 2 ( x 2 ) + ( 4 + 3 ) 2 ( x 3 ) + . . . . . + ( 4 + 6 ) 2 ( x 7 ) = 1 0 0 .
Now, let x 1 , x 2 , … x 7 be fixed, and consider the polynomial
( i ) 2 ( x 1 ) + ( i + 1 ) 2 ( x 2 ) + . . . . . . . + ( i + 6 ) 2 ( x 7 ) = f ( i ) . Because the left side is a quadratic in i (with constant coefficients), and we are given three values of the quadratic, by the identity theorem the polynomial is uniquely determined. Thus, the right side is of degree two, and we can easily find f ( i ) = 1 2 i 2 − 2 7 i + 1 6 . Thus, our general polynomial, true for any value of i, is ( i ) 2 ( x 1 ) + ( i + 1 ) 2 ( x 2 ) + . . . . . . . + ( i + 6 ) 2 ( x 7 ) = 1 2 x 2 − 2 7 x + 1 6 . The value we desire is seen to be i = 3 , so plugging this in to the right side, we get 1 2 ( 9 ) − 2 7 ( 3 ) + 1 6 = 4 3
1+3+\ldots+ 2 k − 1 = k^2 Let z be sought value. Eq3 - Eq1 yields 3\cdot 5 x 1 + 7 x 2 + … + 1 7 x 7 = 99 hence \cdot 5 x 1 + 7 x 2 + … + 1 7 x 7 =33 Since Eq2 + \cdot 5 x 1 + 7 x 2 + … + 1 7 x 7 = z we obtain 10 + 33 = z
nice solution.............. this is how I solved
(16x1- x1)/3 + 4x1= 9x1 (25x2- 4x2) + 9x2 = 16 x2 and so,
[(16x1+25x2+36x3+49x4+64x5+81x6+100x7)-(x1+4x2+9x3+16x4+25x5+36x6+49x7)]3 + 4x1+9x2+16x3+25x4+36x5+49x6+64x7 = 9x1+16x2+25x3+36x4+49x5+64x6+81x7
(100-1)/3 +10= 43
Since there are 7 variables but only 3 equations, we suspect that we can write the desired value as a sum of multiples of the given equations.
After some experimentation, we find that
( − 3 1 ) ( x 1 + 4 x + 2 + 9 x 3 + 1 6 x 4 + 2 5 x 5 + 3 6 x 6 + 4 9 x 7 ) + ( 1 ) ( 4 x 1 + 9 x 2 + 1 6 x 3 + 2 5 x 4 + 3 6 x 5 + 4 9 x 6 + 6 4 x 7 ) + ( 3 1 ) ( 1 6 x 1 + 2 5 x 2 + 3 6 x 3 + 4 9 x 4 + 6 4 x 5 + 8 1 x 6 + 1 0 0 x 7 ) = 9 x 1 + 1 6 x 2 + 2 5 x 3 + 3 6 x 4 + 4 9 x 5 + 6 4 x 6 + 8 1 x 7
The desired value is therefore ( − 3 1 ) ( 1 ) + ( 1 ) ( 1 0 ) + ( 3 1 ) ( 1 0 0 ) = 4 3 .
Some motivation for these coefficients in the linear combination can be taken from ignoring the last 4 terms and solving the resulting three-variable system of equations whose variables are the coefficients.
Let S 1 = x 1 + 4 x 2 + 9 x 3 + 1 6 x 4 + 2 5 x 5 + 3 6 x 6 + 4 9 x 7 , S 2 = 4 x 1 + 9 x 2 + 1 6 x 3 + 2 5 x 4 + 3 6 x 5 + 4 9 x 6 + 6 4 x 7 , S 3 = 9 x 1 + 1 6 x 2 + 2 5 x 3 + 3 6 x 4 + 4 9 x 5 + 5 4 x 6 + 8 1 x 7 and S 4 = 1 6 x 1 + 2 5 x 2 + 3 6 x 3 + 4 9 x 4 + 6 4 x 5 + 8 1 x 6 + 1 0 0 x 7 .
We notice that each of the coefficients of x i in S i are i 2 , ( i + 1 ) 2 , ( i + 2 ) 2 and ( i + 3 ) 2 respectively.
Solution 1: Let Now, let x 1 , x 2 , … x 7 be fixed, and consider the polynomial
f ( n ) = ( n ) 2 ( x 1 ) + ( n + 1 ) 2 ( x 2 ) + … + ( n + 6 ) 2 ( x 7 ) . Because the left side is a quadratic in n (with constant coefficients), and we are given three values of the quadratic, Hence the quadratic must be f ( n ) = 1 2 n 2 − 2 7 n + 1 6 . Thus, the answer is given by n = 3 , f ( n ) = 1 2 ( 9 ) − 2 7 ( 3 ) + 1 6 = 4 3
Solution 2: Thus, we seek a linear combination such that: a i 2 + b ( i + 1 ) 2 + c ( i + 3 ) 2 = ( i + 2 ) 2 ⇒ ( a + b + c ) i 2 + ( 2 b + 6 c ) i + b + 9 c = i 2 + 4 i + 4 . Equating coefficients, we have a + b + c = 1 , 2 b + 6 c = 4 ⇒ b + 3 c = 2 and b + 9 c = 4 . Subtracting the last two equations gives c = 3 1 and b = 1 . Substituting these values in the first equation we have a = − 3 1 .
Therefore S 3 = − 3 1 S 1 + S 2 + 3 1 S 4 = − 3 1 ⋅ 1 + 1 ⋅ 1 0 + 3 1 ⋅ 1 0 0 = 4 3 .
Problem Loading...
Note Loading...
Set Loading...
Let P ( x ) = x 1 ( x + 1 ) 2 + x 2 ( x + 2 ) 2 + ⋯ + x 7 ( x + 7 ) 2 Note that P ( x ) is a quadratic polynomial. Then the given conditions are simply P ( 0 ) = 1 , P ( 1 ) = 1 0 , and P ( 3 ) = 1 0 0 . Then by the Lagrange Interpolation Formula P ( 2 ) = 1 ⋅ ( 0 − 1 ) ( 0 − 3 ) ( 2 − 1 ) ( 2 − 3 ) + 1 0 ⋅ ( 1 − 0 ) ( 1 − 3 ) ( 2 − 0 ) ( 2 − 3 ) + 1 0 0 ⋅ ( 3 − 0 ) ( 3 − 1 ) ( 2 − 0 ) ( 2 − 1 ) = 4 3