(i dont remember exactly if it was 8032038 or some other number, so correct me on this)
(i posted this at 12:29) lol
?
and 
in the plane and a subset 
of the plane, which are announced to Bob. Next, Bob marks infinitely many points in the plane, designating each a city. He may not place two cities within distance at most one unit of each other, and no three cities he places may be collinear. Finally, roads are constructed between the cities as follows: for each pair 
of cities, they are connected with a road along the line segment 
if and only if the following condition holds:
distinct from 
and 
,
such[/center]
is directly similar to either 
or 
.
is directly similar to 
if there exists a sequence of rotations, translations, and dilations sending 
to 
,
to 
,
to 
.
Y by cheese1000, Diehard, Quadratic64, mathman523, lucylai, Tan, AkshajK, droid347, megarnie, parmenides51, Adventure10, Mango247
The title says it all: four 2013-14 WOOTers, all in the Northeastern USA area, namely codyj, djmathman, yugrey, and myself have decided to write a Mock AIME in prep for the AIME I coming up next month. You must signup in this thread to participate, since submissions will be via form and to keep identification security, we will send you passwords before the contest is released.
I will be running the tournament, grading submissions, etc. I thought of this yesterday so we aren't done writing problems, but we expect them to be released next week. Please copy the signup list already existent and add your name.
Note: We may do a Mock AIME II depending on the interest in this one.
I will be running the tournament, grading submissions, etc. I thought of this yesterday so we aren't done writing problems, but we expect them to be released next week. Please copy the signup list already existent and add your name.
Note: We may do a Mock AIME II depending on the interest in this one.
This post has been edited 6 times. Last edited by ahaanomegas, Mar 7, 2014, 3:10 AM
![[asy]
unitsize(1 cm);
real x, y;
real[] hist;
x = 0.6;
y = 0.1;
hist[1] = 16;
hist[2] = 20;
hist[3] = 11;
hist[4] = 10;
hist[5] = 12;
hist[6] = 14;
hist[7] = 4;
hist[8] = 13;
hist[9] = 8;
hist[10] = 7;
hist[11] = 6;
hist[12] = 5;
hist[13] = 5;
hist[14] = 7;
hist[15] = 4;
draw((x,0)--(16*x,0));
for(int i = 1; i <= 15; ++i) {
draw((i*x,0)--(i*x,hist[i]*y)--((i + 1)*x,hist[i]*y)--((i + 1)*x,0));
label(string(i),((i + 0.5)*x,-3*y),fontsize(10));
label(string(hist[i]),((i + 0.5)*x,(hist[i] + 3)*y),fontsize(10));
}[/asy]](http://latex.artofproblemsolving.com/2/a/2/2a2de093b97a5d584dc2d7e3b8cdbcca3bb870c4.png)
countingkg and AkshajK with a score of 12.
mssmath with a score of 10.
