MHB Finding Real Solutions for a System of Equations

  • Thread starter Thread starter anemone
  • Start date Start date
AI Thread Summary
The system of equations has the only solution where each variable \( a_j \) equals 1 for all \( j \) from 1 to 1997. The first equation establishes that the sum of all variables equals 1997, while the second equation relates the cubes and fourth powers of these variables. By manipulating these equations, it is shown that the terms in the derived equation can only sum to zero if each individual term is zero, leading to the conclusion that all \( a_j \) must be equal to 1. This reasoning confirms the uniqueness of the solution. The discussion highlights the elegance of the mathematical approach used to arrive at this conclusion.
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Find all solutions in real numbers to the system below:

$a_1+a_2+\cdots+a_{1997}=1997$

$a_1^3+a_2^3+\cdots+a_{1997}^3=a_1^4+a_2^4+\cdots+a_{1997}^4$
 
Mathematics news on Phys.org
[sp]The only solution is $a_j = 1$ for all $j$ ($1\leqslant j\leqslant 1997$).

Write the equations as $$\sum_{j=1}^{1997}(a_j-1) = 0, \qquad (1)$$ $$\sum_{j=1}^{1997}a_j^3(a_j-1) = 0. \qquad(2)$$ Subtract (1) from (2): $$\sum_{j=1}^{1997}(a_j^3 - 1)(a_j-1) = 0. \qquad(3)$$ In each term of that sum, the numbers $a_j^3 - 1$ and $a_j - 1$ are either both positive, both zero or both negative, depending on whether $a_j \gtrless 1$. So each term is non-negative, and the sum can only be zero if each term is zero. Therefore $a_j = 1$ for all $j$.[/sp]
 
Opalg said:
[sp]The only solution is $a_j = 1$ for all $j$ ($1\leqslant j\leqslant 1997$).

Write the equations as $$\sum_{j=1}^{1997}(a_j-1) = 0, \qquad (1)$$ $$\sum_{j=1}^{1997}a_j^3(a_j-1) = 0. \qquad(2)$$ Subtract (1) from (2): $$\sum_{j=1}^{1997}(a_j^3 - 1)(a_j-1) = 0. \qquad(3)$$ In each term of that sum, the numbers $a_j^3 - 1$ and $a_j - 1$ are either both positive, both zero or both negative, depending on whether $a_j \gtrless 1$. So each term is non-negative, and the sum can only be zero if each term is zero. Therefore $a_j = 1$ for all $j$.[/sp]

Well done Opalg and thanks for participating! Your solution is elegant and compelling!

Here is a solution that is proposed by other:

First, we let $S_n=a_1^n+a_2^n+\cdots+a_{1997}^n$.

By the power mean inequality, we have

$\left( \dfrac{S_4}{1997} \right)^{\dfrac{1}{4}}\ge \dfrac{S_1}{1997}=1$ and

$\left( \dfrac{S_4}{1997} \right)^{\dfrac{1}{4}}\ge \left(\dfrac{S_3}{1997} \right)^{\dfrac{1}{4}}=\left( \dfrac{S_4}{1997} \right)^{\dfrac{1}{3}}$

and so $\dfrac{S_4}{1997}\le 1$ as well.

Thus equality holds in the power mean inequality, which implies $a_1=a_2=\cdots=a_{1997}=1$.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...

Similar threads

Back
Top