Difference between revisions of "1984 USAMO Problems"
m |
m (→Problem 4) |
||
(One intermediate revision by the same user not shown) | |||
Line 16: | Line 16: | ||
==Problem 3== | ==Problem 3== | ||
− | <math>P, A, B, C | + | <math>P</math>, <math>A</math>, <math>B</math>, <math>C</math>, and <math>D</math> are five distinct points in space such that <math>\angle APB = \angle BPC = \angle CPD = \angle DPA = \theta</math>, where <math>\theta</math> is a given acute angle. Determine the greatest and least values of <math>\angle APC + \angle BPD</math>. |
[[1984 USAMO Problems/Problem 3 | Solution]] | [[1984 USAMO Problems/Problem 3 | Solution]] | ||
==Problem 4== | ==Problem 4== | ||
− | A | + | A difficult mathematical competition consisted of a Part I and a Part II with a combined total of <math>28</math> problems. Each contestant solved <math>7</math> problems altogether. For each pair of problems, there were exactly two contestants who solved both of them. Prove that there was a contestant who, in Part I, solved either no problems or at least four problems. |
[[1984 USAMO Problems/Problem 4 | Solution]] | [[1984 USAMO Problems/Problem 4 | Solution]] |
Latest revision as of 11:33, 18 July 2016
Problems from the 1984 USAMO.
Problem 1
The product of two of the four roots of the quartic equation is . Determine the value of .
Problem 2
The geometric mean of any set of non-negative numbers is the -th root of their product.
For which positive integers is there a finite set of distinct positive integers such that the geometric mean of any subset of is an integer?
Is there an infinite set of distinct positive integers such that the geometric mean of any finite subset of is an integer?
Problem 3
, , , , and are five distinct points in space such that , where is a given acute angle. Determine the greatest and least values of .
Problem 4
A difficult mathematical competition consisted of a Part I and a Part II with a combined total of problems. Each contestant solved problems altogether. For each pair of problems, there were exactly two contestants who solved both of them. Prove that there was a contestant who, in Part I, solved either no problems or at least four problems.
Problem 5
is a polynomial of degree such that
Determine .
See Also
1984 USAMO (Problems • Resources) | ||
Preceded by 1983 USAMO |
Followed by 1985 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.