Difference between revisions of "1990 IMO Problems/Problem 6"
Line 21: | Line 21: | ||
We first commit to placing <math>1^2</math> and <math>2^2</math> on opposite sides, <math>3^2</math> and <math>4^2</math> on opposite sides, etc. Since <math>2^2-1^2=3</math>, <math>4^2-3^2=7</math>, <math>6^2-5^2=11</math>, etc., this means the desired conclusion is equivalent to<cmath> 0 = \sum_{n=0}^{994} c_n \omega^n </cmath>being true for some permutation <math>(c_0, \dots, c_{994})</math> of <math>(3, 7, 11, \dots, 3981)</math>. | We first commit to placing <math>1^2</math> and <math>2^2</math> on opposite sides, <math>3^2</math> and <math>4^2</math> on opposite sides, etc. Since <math>2^2-1^2=3</math>, <math>4^2-3^2=7</math>, <math>6^2-5^2=11</math>, etc., this means the desired conclusion is equivalent to<cmath> 0 = \sum_{n=0}^{994} c_n \omega^n </cmath>being true for some permutation <math>(c_0, \dots, c_{994})</math> of <math>(3, 7, 11, \dots, 3981)</math>. | ||
− | Define <math>z = 3 \omega^0 + 7 \omega^{199} + 11\omega^{398} + 15 \omega^{597} + 19 \omega^{796}</math>. Then notice that | + | Define <math>z = 3 \omega^0 + 7 \omega^{199} + 11\omega^{398} + 15 \omega^{597} + 19 \omega^{796}</math>. Then notice that <cmath> |
This solution was posted and copyrighted by v_Enhance. The original thread for this problem can be found here: [https://aops.com/community/p17584021] | This solution was posted and copyrighted by v_Enhance. The original thread for this problem can be found here: [https://aops.com/community/p17584021] | ||
== See Also == {{IMO box|year=1990|num-b=5|after=Last Question}} | == See Also == {{IMO box|year=1990|num-b=5|after=Last Question}} |
Latest revision as of 13:54, 30 January 2021
Contents
[hide]Problem
Prove that there exists a convex with the following two properties:
(a) All angles are equal.
(b) The lengths of the
sides are the numbers
in some order.
Solution 1
Let and
.
Then the problem is equivalent to that there exists a way to assign
such that
.
Note that
, then if we can find a sequence
such that
and
, the problem will be solved.
Note that
, then
can be written as a sum from two elements in sets
and
.
If we assign the elements in
in the way that
, then clearly
Similarly, we could assign elements in
in that way (
) to
.
Then we make
according to the previous steps. Let
(mod 5),
(mod 199), and
, then each
will be some
and
And we are done.
This solution was posted and copyrighted by YCHU. The original thread for this problem can be found here: [1]
Solution 2
Throughout this solution, denotes a primitive
th root of unity.
We first commit to placing and
on opposite sides,
and
on opposite sides, etc. Since
,
,
, etc., this means the desired conclusion is equivalent to
being true for some permutation
of
.
Define . Then notice that
and so summing yields the desired conclusion, as the left-hand side becomes
and the right-hand side is the desired expression.
This solution was posted and copyrighted by v_Enhance. The original thread for this problem can be found here: [2]
See Also
1990 IMO (Problems) • Resources | ||
Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Question |
All IMO Problems and Solutions |