Difference between revisions of "1982 USAMO Problems"
(Created page with "==Problem 1== A graph has <math>1982</math> points. Given any four points, there is at least one joined to the other three. What is the smallest number of points which are joined...")
Revision as of 01:44, 28 August 2011
A graph has points. Given any four points, there is at least one joined to the other three. What is the smallest number of points which are joined to points?
Show that if are positive integers such that for all real with sum , then or .
is a point inside the equilateral triangle . is a point inside . Show that
Show that there is a positive integer such that, for every positive integer , is composite.
is the center of a sphere . Points are inside , is perpendicular to and , and there are two spheres through , and which touch . Show that the sum of their radii equals the radius of .