Difference between revisions of "1990 APMO Problems"
(more problems!) |
m (→See also) |
||
Line 40: | Line 40: | ||
[[1990 APMO Problems/Problem 5|Solution]] | [[1990 APMO Problems/Problem 5|Solution]] | ||
− | == See | + | == See Also == |
* [[Asian Pacific Mathematics Olympiad]] | * [[Asian Pacific Mathematics Olympiad]] | ||
* [[APMO Problems and Solutions]] | * [[APMO Problems and Solutions]] | ||
* [[Mathematics competition resources]] | * [[Mathematics competition resources]] |
Revision as of 08:43, 30 May 2012
Problem 1
Given triangle , let , , be the midpoints of , , respective and let be the centroid of the triangle. For each value of , how many non-similar triangles are there in which is a cyclic quadrilateral?
Problem 2
Let be positive real numbers, and let be the sum of the products of taken at a time. Show that
for
Problem 3
Consider all the triangles which have a fixed base and whose altitude from is a constant . For which triangles is the product of its altitudes a minimum?
Problem 4
A set of persons is divided into non-intersecting subsets in such a way that
1. No one in a subset knows all the others in the subset,
2. Among any three persons in a subset, there are always at least two who do now know each other, and
3. For any two persons in a subset who do now know each other, there is exactly one person in the same subset knowing both of them.
(a) Prove that within each subset, every person has the same number of acquaintances.
(b) Determine the maximum possible number of subsets.
Note: It is understood that if a person knows person , then person will know person ; an acquaintance is someone who is known. Every person is assumed to know one's self.
Problem 5
Show that for every integer , there exists a convex hexagon which can be dissected into exactly congruent triangles.