Subcontests
(15)Time is ticking
The following analog clock has two hands that can move independently of each other.
[asy]
unitsize(2cm);
draw(unitcircle,black+linewidth(2)); for (int i = 0; i < 12; ++i) {
draw(0.9*dir(30*i)--dir(30*i));
}
for (int i = 0; i < 4; ++i) {
draw(0.85*dir(90*i)--dir(90*i),black+linewidth(2));
}
for (int i = 0; i < 12; ++i) {
label("\small" + (string) i, dir(90 - i * 30) * 0.75);
}
draw((0,0)--0.6*dir(90),black+linewidth(2),Arrow(TeXHead,2bp));
draw((0,0)--0.4*dir(90),black+linewidth(2),Arrow(TeXHead,2bp));
[/asy]
Initially, both hands point to the number 12. The clock performs a sequence of hand movements so that on each movement, one of the two hands moves clockwise to the next number on the clock while the other hand does not move.Let N be the number of sequences of 144 hand movements such that during the sequence, every possible positioning of the hands appears exactly once, and at the end of the 144 movements, the hands have returned to their initial position. Find the remainder when N is divided by 1000. Cube on a Plane
A cube-shaped container has vertices A, B, C, and D where AB and CD are parallel edges of the cube, and AC and BD are diagonals of the faces of the cube. Vertex A of the cube is set on a horizontal plane P so that the plane of the rectangle ABCD is perpendicular to P, vertex B is 2 meters above P, vertex C is 8 meters above P, and vertex D is 10 meters above P. The cube contains water whose surface is 7 meters above P. The volume of the water is nm cubic meters, where m and n are relatively prime positive integers. Find m+n.
[asy]
size(250);
defaultpen(linewidth(0.6));
pair A = origin, B = (6,3), X = rotate(40)*B, Y = rotate(70)*X, C = X+Y, Z = X+B, D = B+C, W = B+Y;
pair P1 = 0.8*C+0.2*Y, P2 = 2/3*C+1/3*X, P3 = 0.2*D+0.8*Z, P4 = 0.63*D+0.37*W;
pair E = (-20,6), F = (-6,-5), G = (18,-2), H = (9,8);
filldraw(E--F--G--H--cycle,rgb(0.98,0.98,0.2));
fill(A--Y--P1--P4--P3--Z--B--cycle,rgb(0.35,0.7,0.9));
draw(A--B--Z--X--A--Y--C--X^^C--D--Z);
draw(P1--P2--P3--P4--cycle^^D--P4);
dot("A",A,S);
dot("B",B,S);
dot("C",C,N);
dot("D",D,N);
label("P",(-13,4.5));
[/asy] Counting Subsets
Find the number of subsets of 1,2,3,...,10 that contain exactly one pair of consecutive integers. Examples of such subsets are 1,2,5 and 1,3,6,7,10. sets of subsets of sets of subsets of ...
Find the number of collections of 16 distinct subsets of {1,2,3,4,5} with the property that for any two subsets X and Y in the collection, X∩Y=∅. double integration on the AIME
Consider the L-shaped region formed by three unit squares joined at their sides, as shown below. Two points A and B are chosen independently and uniformly at random from inside this region. The probability that the midpoint of AB also lies inside this L-shaped region can be expressed as nm, where m and n are relatively prime positive integers. Find m+n.
[asy]
size(2.5cm);
draw((0,0)--(0,2)--(1,2)--(1,1)--(2,1)--(2,0)--cycle);
draw((0,1)--(1,1)--(1,0), dotted);
[/asy] *Fun* Polynomial Counting!
Find the number of cubic polynomials p(x)=x3+ax2+bx+c, where a, b, and c are integers in {−20,−19,−18,…,18,19,20}, such that there is a unique integer m=2 with p(m)=p(2). perfect square divisors of 13!
The sum of all positive integers m for which m13! is a perfect square can be written as 2a3b5c7d11e13f, where a,b,c,d,e, and f are positive integers. Find a+b+c+d+e+f. Yes, there are three cases
Call a positive integer n extra-distinct if the remainders when n is divided by 2,3,4,5, and 6 are distinct. Find the number of extra-distinct positive integers less than 1000.