USAMO 1972 #5 August 4, 2009
Posted by lumixedia in Problem-solving.Tags: contest math, geometry, olympiad math, USAMO, USAMO 1972
2 comments
USAMO 1972 #5. A given convex pentagon has the property that the area of each of the five triangles , , , , is unity. Show that every non-congruent pentagon with the above property has the same area, and that, furthermore, there are an infinite number of such non-congruent pentagons. (more…)
USAMO 1972 #4 July 26, 2009
Posted by lumixedia in Problem-solving.Tags: algebra, contest math, olympiad math, USAMO, USAMO 1972
3 comments
USAMO 1972 #4. Let denote a non-negative rational number. Determine a fixed set of integers , , , , , such that, for every choice of ,
USAMO 1972 #2, #3 July 21, 2009
Posted by lumixedia in Problem-solving.Tags: combinatorics, contest math, geometry, olympiad math, USAMO, USAMO 1972
3 comments
I think I might as well just start going through the USAMOs in chronological/numerical order.
USAMO 1972 #2. A given tetrahedron is isosceles, that is , , . Show that the faces of the tetrahedron are acute-angled triangles. (more…)
USAMO 1972 #1 July 18, 2009
Posted by lumixedia in Problem-solving.Tags: contest math, number theory, olympiad math, USAMO, USAMO 1972
9 comments
My first post was going to be an introduction to combinatorial game theory, but putting that together would have been rather more complicated than grabbing some USAMO problem and putting up my solution, so of course I chose the path of less resistance. The intro to game theory will come eventually, but in the meantime, here’s the first USAMO problem ever:
USAMO 1972 # 1. The symbols and denote the greatest common divisor and the least common multiple, respectively, of the positive integers . For example, and . Prove that
Here is, based on my first instinct when seeing this problem… (more…)