Difference between revisions of "1978 USAMO Problems"
Mrdavid445 (talk | contribs) (→Problem 4) |
|||
(8 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
+ | Problems from the '''1978 [[United States of America Mathematical Olympiad | USAMO]]'''. | ||
+ | |||
==Problem 1== | ==Problem 1== | ||
+ | Given that <math>a,b,c,d,e</math> are real numbers such that | ||
+ | |||
+ | <math>a+b+c+d+e=8</math>, | ||
+ | |||
+ | <math>a^2+b^2+c^2+d^2+e^2=16</math>. | ||
+ | |||
+ | Determine the maximum value of <math>e</math>. | ||
− | + | [[1978 USAMO Problems/Problem 1 | Solution]] | |
− | |||
==Problem 2== | ==Problem 2== | ||
− | + | <math>ABCD</math> and <math>A'B'C'D'</math> are square maps of the same region, drawn to different scales and superimposed as shown in the figure. Prove that there is only one point <math>O</math> on the small map that lies directly over point <math>O'</math> of the large map such that <math>O</math> and <math>O'</math> each represent the same place of the country. Also, give a Euclidean construction (straight edge and compass) for <math>O</math>. | |
− | + | ||
− | map | + | <asy> |
− | + | defaultpen(linewidth(0.7)+fontsize(10)); | |
+ | real theta = -100, r = 0.3; pair D2 = (0.3,0.76); | ||
+ | string[] lbl = {'A', 'B', 'C', 'D'}; draw(unitsquare); draw(shift(D2)*rotate(theta)*scale(r)*unitsquare); | ||
+ | for(int i = 0; i < lbl.length; ++i) { | ||
+ | pair Q = dir(135-90*i), P = (.5,.5)+Q/2^.5; | ||
+ | label("$"+lbl[i]+"'$", P, Q); | ||
+ | label("$"+lbl[i]+"$",D2+rotate(theta)*(r*P), rotate(theta)*Q); | ||
+ | }</asy> | ||
+ | |||
+ | [[1978 USAMO Problems/Problem 2 | Solution]] | ||
==Problem 3== | ==Problem 3== | ||
− | + | An integer <math>n</math> will be called ''good'' if we can write | |
− | + | ||
+ | <math>n=a_1+a_2+\cdots+a_k</math>, | ||
+ | |||
+ | where <math>a_1,a_2, \ldots, a_k</math> are positive integers (not necessarily distinct) satisfying | ||
+ | |||
+ | <math>\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_k}=1</math>. | ||
+ | |||
+ | Given the information that the integers 33 through 73 are good, prove that every integer <math>\ge 33</math> is good. | ||
+ | |||
+ | [[1978 USAMO Problems/Problem 3 | Solution]] | ||
==Problem 4== | ==Problem 4== | ||
− | + | (a) Prove that if the six dihedral (i.e. angles between pairs of faces) of a given tetrahedron are congruent, then the tetrahedron is regular. | |
+ | |||
+ | (b) Is a tetrahedron necessarily regular if five dihedral angles are congruent? | ||
+ | |||
+ | [[1978 USAMO Problems/Problem 4 | Solution]] | ||
==Problem 5== | ==Problem 5== | ||
+ | Nine mathematicians meet at an international conference and discover that among any three of them, at least two speak a common language. If each of the mathematicians speak at most three languages, prove that there are at least three of the mathematicians who can speak the same language. | ||
+ | |||
+ | [[1978 USAMO Problems/Problem 5 | Solution]] | ||
+ | |||
+ | == See Also == | ||
+ | {{USAMO box|year=1978|before=[[1977 USAMO]]|after=[[1979 USAMO]]}} | ||
+ | {{MAA Notice}} |
Latest revision as of 18:06, 3 July 2013
Problems from the 1978 USAMO.
Problem 1
Given that are real numbers such that
,
.
Determine the maximum value of .
Problem 2
and are square maps of the same region, drawn to different scales and superimposed as shown in the figure. Prove that there is only one point on the small map that lies directly over point of the large map such that and each represent the same place of the country. Also, give a Euclidean construction (straight edge and compass) for .
Problem 3
An integer will be called good if we can write
,
where are positive integers (not necessarily distinct) satisfying
.
Given the information that the integers 33 through 73 are good, prove that every integer is good.
Problem 4
(a) Prove that if the six dihedral (i.e. angles between pairs of faces) of a given tetrahedron are congruent, then the tetrahedron is regular.
(b) Is a tetrahedron necessarily regular if five dihedral angles are congruent?
Problem 5
Nine mathematicians meet at an international conference and discover that among any three of them, at least two speak a common language. If each of the mathematicians speak at most three languages, prove that there are at least three of the mathematicians who can speak the same language.
See Also
1978 USAMO (Problems • Resources) | ||
Preceded by 1977 USAMO |
Followed by 1979 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.