Difference between revisions of "1999 AIME Problems"
m |
m |
||
| Line 5: | Line 5: | ||
== Problem 2 == | == Problem 2 == | ||
| + | Consider the parallelogram with vertices <math>\displaystyle (10,45),</math> <math>\displaystyle (10,114),</math> <math>\displaystyle (28,153),</math> and <math>\displaystyle (28,84).</math> A line through the origin cuts this figure into two congruent polygons. The slope of the line is <math>\displaystyle m/n,</math> where <math>\displaystyle m_{}</math> and <math>\displaystyle n_{}</math> are relatively prime positive integers. Find <math>\displaystyle m+n.</math> | ||
[[1999 AIME Problems/Problem 2|Solution]] | [[1999 AIME Problems/Problem 2|Solution]] | ||
Revision as of 00:41, 22 January 2007
Contents
Problem 1
Find the smallest prime that is the fifth term of an increasing arithmetic sequence, all four preceding terms also being prime.
Problem 2
Consider the parallelogram with vertices 
and 
A line through the origin cuts this figure into two congruent polygons. The slope of the line is 
where 
and 
are relatively prime positive integers. Find 
Problem 3
Problem 4
Problem 5
Problem 6
Problem 7
There is a set of 1000 switches, each of which has four positions, called 
, and 
. When the position of any switch changes, it is only from 
to 
, from to 
, from to , or from to . Initially each switch is in position . The switches are labeled with the 1000 different integers 
, where 
, and 
take on the values 
. At step i of a 1000-step process, the 
-th switch is advanced one step, and so are all the other switches whose labels divide the label on the -th switch. After step 1000 has been completed, how many switches will be in position ?
