Difference between revisions of "1965 IMO Problems/Problem 4"
m |
|||
(4 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
+ | |||
Find all sets of four real numbers <math>x_1</math>, <math>x_2</math>, <math>x_3</math>, <math>x_4</math> such that the sum of any one and the product of the other three is equal to <math>2</math>. | Find all sets of four real numbers <math>x_1</math>, <math>x_2</math>, <math>x_3</math>, <math>x_4</math> such that the sum of any one and the product of the other three is equal to <math>2</math>. | ||
− | == Solution == | + | |
+ | == Solution == | ||
+ | |||
Let <math>P = x_1x_2x_3x_4</math> be the product of the four real numbers. | Let <math>P = x_1x_2x_3x_4</math> be the product of the four real numbers. | ||
Then, for <math>i = 1,2,3,4</math> we have: <math>x_i + \prod_{j \neq i}x_j = 2</math>. | Then, for <math>i = 1,2,3,4</math> we have: <math>x_i + \prod_{j \neq i}x_j = 2</math>. | ||
− | |||
Multiplying by <math>x_i</math> yields: | Multiplying by <math>x_i</math> yields: | ||
Line 15: | Line 17: | ||
So assume that <math>t \neq 0</math>. WLOG, let at least two of <math>x_i</math> equal <math>1+t</math>, and <math>x_1 \ge x_2 \ge x_3 \ge x_4</math> OR <math>x_1 \le x_2 \le x_3 \le x_4</math>. | So assume that <math>t \neq 0</math>. WLOG, let at least two of <math>x_i</math> equal <math>1+t</math>, and <math>x_1 \ge x_2 \ge x_3 \ge x_4</math> OR <math>x_1 \le x_2 \le x_3 \le x_4</math>. | ||
− | |||
Case I: <math>x_1 = x_2 = x_3 = x_4 = 1+t</math> | Case I: <math>x_1 = x_2 = x_3 = x_4 = 1+t</math> | ||
Line 24: | Line 25: | ||
Which has no non-zero solutions for <math>t</math>. | Which has no non-zero solutions for <math>t</math>. | ||
− | |||
Case II: <math>x_1 = x_2 = x_3 = 1+t</math> AND <math>x_4 = 1-t</math> | Case II: <math>x_1 = x_2 = x_3 = 1+t</math> AND <math>x_4 = 1-t</math> | ||
Line 37: | Line 37: | ||
So, we have <math>t = -2</math> as the only non-zero solution, and thus, <math>(x_1,x_2,x_3,x_4) = (-1,-1,-1,3)</math> and all permutations are solutions. | So, we have <math>t = -2</math> as the only non-zero solution, and thus, <math>(x_1,x_2,x_3,x_4) = (-1,-1,-1,3)</math> and all permutations are solutions. | ||
− | |||
Case III: <math>x_1 = x_2 = 1+t</math> AND <math>x_3 = x_4 = 1-t</math> | Case III: <math>x_1 = x_2 = 1+t</math> AND <math>x_3 = x_4 = 1-t</math> | ||
Line 51: | Line 50: | ||
Thus, there are no non-zero solutions for <math>t</math> in this case. | Thus, there are no non-zero solutions for <math>t</math> in this case. | ||
+ | Therefore, the solutions are: <math>(1,1,1,1)</math>; <math>(3,-1,-1,-1)</math>; <math>(-1,3,-1,-1)</math>; <math>(-1,-1,3,-1)</math>; <math>(-1,-1,-1,3)</math>. | ||
+ | |||
+ | |||
+ | == Solution 2 == | ||
+ | |||
+ | We have to solve the system of equations | ||
+ | |||
+ | <math>x_1 + x_2x_3x_4 = 2\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ (1) \\ | ||
+ | x_2 + x_1x_3x_4 = 2\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ (2) \\ | ||
+ | x_3 + x_1x_2x_4 = 2\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ (3) \\ | ||
+ | x_4 + x_1x_2x_3 = 2\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ (4)</math> | ||
+ | |||
+ | Subtract (2) from (1) and factor. We get | ||
+ | |||
+ | <math>(x_1 - x_2)(1 - x_3x_4) = 0</math>, | ||
+ | |||
+ | which implies <math>x_1 - x_2 = 0</math> or <math>1 - x_3x_4 = 0</math>. | ||
+ | |||
+ | Similarly, subtracting (3) and then (4) from (1) and factoring, we get | ||
+ | |||
+ | <math>(x_1 - x_3)(1 - x_2x_4) = 0 \\ | ||
+ | (x_1 - x_4)(1 - x_2x_3) = 0</math> | ||
+ | |||
+ | They imply <math>x_1 - x_3 = 0</math> or <math>1 - x_2x_4 = 0</math>, and <math>x_1 - x_4 = 0</math> or | ||
+ | <math>1 - x_2x_3 = 0</math>. | ||
+ | |||
+ | We will consider four possibilities: | ||
+ | |||
+ | 1. <math>x_2 = x_1, x_3 = x_1, x_4 = x_1</math> | ||
+ | |||
+ | 2. <math>x_2 = x_1, x_3 = x_1</math> and <math>x_2x_3 = 1</math> | ||
+ | |||
+ | 3. <math>x_2 = x_1</math> and <math>x_2x_3 = 1, x_2x_4 = 1</math> | ||
+ | |||
+ | 4. <math>x_2x_3 = 1, x_2x_4 = 1, x_3x_4 = 1</math> | ||
+ | |||
+ | Note that in fact, there are four more possibilities, but they just | ||
+ | correspond to permutations in <math>x_1, x_2, x_3, x_4</math> of cases 2. and 3., | ||
+ | so there is no harm in not dealing with them explicitly. | ||
+ | |||
+ | Case 1. Plug <math>x_2, x_3, x_4</math> in equation (1). We get | ||
+ | <math>x_1 + x_1^3 = 2</math>. This is an equation of degree <math>3</math> whose only real | ||
+ | root is <math>x_1 = 1</math>. We get the solution <math>x_1 = x_2 = x_3 = x_4 = 1</math>. | ||
+ | |||
+ | Case 2. Plug <math>x_2, x_3</math> into <math>x_2x_3 = 1</math>, and get <math>x_1^2 = 1</math>. | ||
+ | We get <math>x_1 = 1</math> or <math>x_1 = -1</math>. The first solution, <math>x_1 = 1</math>, | ||
+ | yields <math>x_2 = x_3 = 1</math>, and using (4), <math>x_4 = 1</math>. The second | ||
+ | solution, <math>x_1 = -1</math>, yields <math>x_2 = x_3 = -1</math>, and using (4), | ||
+ | <math>x_4 = 3</math>. We get the solution <math>x_1 = x_2 = x_3 = -1, x_4 = 3.</math> | ||
+ | Because of the permutations of <math>x_1, x_2, x_3, x_4</math>, we also get | ||
+ | the solutions <math>(-1, -1, 3, -1), (-1, 3, -1, -1), (3, -1, -1, -1)</math>. | ||
+ | |||
+ | Case 3. Plug in <math>x_2x_3, x_2x_4</math> in (4) and (3), and get | ||
+ | <math>x_4 + x_1 = 2</math> and <math>x_3 + x_1 = 2</math>. Now plug <math>x_2, x_3, x_4</math> | ||
+ | in (1), and get <math>x_1 + x_1(2 - x_1)^2 = 2</math>. This equation becomes | ||
+ | <math>(x_1 - 1)^2(x_1 - 2) = 0</math>. <math>x_1 = 1</math> yields <math>(1, 1, 1, 1)</math> which | ||
+ | we already know, and <math>x_1 = 2</math> yields <math>(2, 2, 0, 0)</math> (or some other | ||
+ | values, depending on where we plug <math>x_1 = 2</math>), which do not give a | ||
+ | possible solution. | ||
+ | |||
+ | Case 4. plugging <math>x_2x_3, x_2x_4, x_3x_4</math> into (4), (3), (2), we | ||
+ | get <math>x_4 + x_1 = 2, x_3 + x_1 = 2, x_2 + x_1 = 2</math>. Plugging | ||
+ | <math>x_2, x_3, x_4</math> into (1), we get <math>x_1 + (2 - x_1)^3 = 2</math>. The | ||
+ | solutions of this equation are <math>1, 2, 3</math>. Note that <math>x_1 = 1</math> | ||
+ | and <math>x_1 = 3</math> yield solutions we already know, and <math>x_1 = 2</math> | ||
+ | is impossible. | ||
+ | |||
+ | Thus, the five solutions to the problem are <math>(1, 1, 1, 1), | ||
+ | (3, -1, -1, -1), (-1, 3, -1, -1), (-1, -1, 3, -1), (-1, -1, -1, 3)</math>. | ||
+ | |||
+ | [Solution by pf02, November 2024] | ||
− | |||
== See Also == | == See Also == | ||
{{IMO box|year=1965|num-b=3|num-a=5}} | {{IMO box|year=1965|num-b=3|num-a=5}} |
Latest revision as of 18:00, 10 November 2024
Contents
Problem
Find all sets of four real numbers , , , such that the sum of any one and the product of the other three is equal to .
Solution
Let be the product of the four real numbers.
Then, for we have: .
Multiplying by yields:
where .
If , then we have which is a solution.
So assume that . WLOG, let at least two of equal , and OR .
Case I:
Then we have:
Which has no non-zero solutions for .
Case II: AND
Then we have:
AND
So, we have as the only non-zero solution, and thus, and all permutations are solutions.
Case III: AND
Then we have:
AND
Thus, there are no non-zero solutions for in this case.
Therefore, the solutions are: ; ; ; ; .
Solution 2
We have to solve the system of equations
Subtract (2) from (1) and factor. We get
,
which implies or .
Similarly, subtracting (3) and then (4) from (1) and factoring, we get
They imply or , and or .
We will consider four possibilities:
1.
2. and
3. and
4.
Note that in fact, there are four more possibilities, but they just correspond to permutations in of cases 2. and 3., so there is no harm in not dealing with them explicitly.
Case 1. Plug in equation (1). We get . This is an equation of degree whose only real root is . We get the solution .
Case 2. Plug into , and get . We get or . The first solution, , yields , and using (4), . The second solution, , yields , and using (4), . We get the solution Because of the permutations of , we also get the solutions .
Case 3. Plug in in (4) and (3), and get and . Now plug in (1), and get . This equation becomes . yields which we already know, and yields (or some other values, depending on where we plug ), which do not give a possible solution.
Case 4. plugging into (4), (3), (2), we get . Plugging into (1), we get . The solutions of this equation are . Note that and yield solutions we already know, and is impossible.
Thus, the five solutions to the problem are .
[Solution by pf02, November 2024]
See Also
1965 IMO (Problems) • Resources | ||
Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 5 |
All IMO Problems and Solutions |