Difference between revisions of "1989 USAMO Problems"
(create) |
m |
||
(5 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
+ | Problems from the '''1989 [[USAMO]].''' | ||
+ | |||
==Problem 1== | ==Problem 1== | ||
For each positive integer <math>n</math>, let | For each positive integer <math>n</math>, let | ||
Line 8: | Line 10: | ||
<math>U_n = \frac{T_1}{2} + \frac{T_2}{3} + \frac{T_3}{4} + \cdots + \frac{T_n}{n+1}</math>. | <math>U_n = \frac{T_1}{2} + \frac{T_2}{3} + \frac{T_3}{4} + \cdots + \frac{T_n}{n+1}</math>. | ||
</div> | </div> | ||
− | Find, with proof, integers <math>0 < a,\ b,\ c,\ d < 1000000</math> such that <math> | + | Find, with proof, integers <math>0 < a,\ b,\ c,\ d < 1000000</math> such that <math>T_{1988} = a S_{1989} - b</math> and <math>U_{1988} = c S_{1989} - d</math>. |
[[1989 USAMO Problems/Problem 1 | Solution]] | [[1989 USAMO Problems/Problem 1 | Solution]] | ||
Line 22: | Line 24: | ||
[[1989 USAMO Problems/Problem 3 | Solution]] | [[1989 USAMO Problems/Problem 3 | Solution]] | ||
==Problem 4== | ==Problem 4== | ||
+ | Let <math>ABC</math> be an acute-angled triangle whose side lengths satisfy the inequalities <math>AB < AC < BC</math>. If point <math>I</math> is the center of the inscribed circle of triangle <math>ABC</math> and point <math>O</math> is the center of the circumscribed circle, prove that line <math>IO</math> intersects segments <math>AB</math> and <math>BC</math>. | ||
+ | [[1989 USAMO Problems/Problem 4 | Solution]] | ||
− | |||
==Problem 5== | ==Problem 5== | ||
+ | Let <math>u</math> and <math>v</math> be real numbers such that | ||
+ | |||
+ | <math> | ||
+ | (u + u^2 + u^3 + \cdots + u^8) + 10u^9 = (v + v^2 + v^3 + \cdots + v^{10}) + 10v^{11} = 8. | ||
+ | </math> | ||
+ | Determine, with proof, which of the two numbers, <math>u</math> or <math>v</math>, is larger. | ||
[[1989 USAMO Problems/Problem 5 | Solution]] | [[1989 USAMO Problems/Problem 5 | Solution]] | ||
− | == See | + | == See Also == |
− | + | {{USAMO box|year=1989|before=[[1988 USAMO]]|after=[[1990 USAMO]]}} | |
+ | {{MAA Notice}} |
Latest revision as of 17:52, 18 July 2016
Problems from the 1989 USAMO.
Problem 1
For each positive integer , let
.
Find, with proof, integers such that and .
Problem 2
The 20 members of a local tennis club have scheduled exactly 14 two-person games among themselves, with each member playing in at least one game. Prove that within this schedule there must be a set of 6 games with 12 distinct players.
Problem 3
Let be a polynomial in the complex variable , with real coefficients . Suppose that . Prove that there exist real numbers and such that and .
Problem 4
Let be an acute-angled triangle whose side lengths satisfy the inequalities . If point is the center of the inscribed circle of triangle and point is the center of the circumscribed circle, prove that line intersects segments and .
Problem 5
Let and be real numbers such that
Determine, with proof, which of the two numbers, or , is larger.
See Also
1989 USAMO (Problems • Resources) | ||
Preceded by 1988 USAMO |
Followed by 1990 USAMO | |
1 • 2 • 3 • 4 • 5 | ||
All USAMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.