Subcontests
(15)Dam David, back at it again with the late geo II
David found four sticks of different lengths that can be used to form three non-congruent convex cyclic quadrilaterals, A, B, C, which can each be inscribed in a circle with radius 1. Let φA denote the measure of the acute angle made by the diagonals of quadrilateral A, and define φB and φC similarly. Suppose that sinφA=32, sinφB=53, and sinφC=76. All three quadrilaterals have the same area K, which can be written in the form nm, where m and n are relatively prime positive integers. Find m+n. Inequality FE
Find the number of functions f from {0,1,2,3,4,5,6} to the integers such that f(0)=0,f(6)=12, and
∣x−y∣≤∣f(x)−f(y)∣≤3∣x−y∣for all x and y in {0,1,2,3,4,5,6}. The bash she tells you not to worry about
The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point A. At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a counterclockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path AJABCHCHIJA, which has 10 steps. Let n be the number of paths with 15 steps that begin and end at point A. Find the remainder when n is divided by 1000.[asy]
unitsize(32);
draw(unitcircle);
draw(scale(2) * unitcircle);
for(int d = 90; d < 360 + 90; d += 72){
draw(2 * dir(d) -- dir(d));
}real s = 4;
dot(1 * dir( 90), linewidth(s));
dot(1 * dir(162), linewidth(s));
dot(1 * dir(234), linewidth(s));
dot(1 * dir(306), linewidth(s));
dot(1 * dir(378), linewidth(s));
dot(2 * dir(378), linewidth(s));
dot(2 * dir(306), linewidth(s));
dot(2 * dir(234), linewidth(s));
dot(2 * dir(162), linewidth(s));
dot(2 * dir( 90), linewidth(s));defaultpen(fontsize(10pt));
real r = 0.05;
label("A", (1-r) * dir( 90), -dir( 90));
label("B", (1-r) * dir(162), -dir(162));
label("C", (1-r) * dir(234), -dir(234));
label("D", (1-r) * dir(306), -dir(306));
label("E", (1-r) * dir(378), -dir(378));
label("F", (2+r) * dir(378), dir(378));
label("G", (2+r) * dir(306), dir(306));
label("H", (2+r) * dir(234), dir(234));
label("I", (2+r) * dir(162), dir(162));
label("J", (2+r) * dir( 90), dir( 90));
[/asy] It is the Very Model of A Modern Major Function Nest
Find the number of functions f(x) from {1,2,3,4,5} to {1,2,3,4,5} that satisfy f(f(x))=f(f(f(x))) for all x in {1,2,3,4,5}. 102 Combo
For every subset T of U={1,2,3,…,18}, let s(T) be the sum of the elements of T, with s(∅) defined to be 0. If T is chosen at random among all subsets of U, the probability that s(T) is divisible by 3 is nm, where m and n are relatively prime positive integers. Find m. Dynamic Programming by Hand Again
A frog is positioned at the origin in the coordinate plane. From the point (x,y), the frog can jump to any of the points (x+1,y),(x+2,y),(x,y+1), or (x,y+2). Find the number of distinct sequences of jumps in which the frog begins at (0,0) and ends at (4,4). Rational Geometry
Triangle ABC has sides AB=9,BC=53, and AC=12. Points A=P0,P1,P2,…,P2450=B are on segment AB with Pk between Pk−1 and Pk+1 for k=1,2,…,2449, and points A=Q0,Q1,Q2,…,Q2450=C for k=1,2,…,2449. Furthermore, each segment PkQk,k=1,2,…,2449, is parallel to BC. The segments cut the triangle into 2450 regions, consisting of 2449 trapezoids and 1 triangle. Each of the 2450 regions have the same area. Find the number of segments PkQk,k=1,2,…,2450, that have rational length. Projective Fun
The incircle of ω of △ABC is tangent to BC at X. Let Y=X be the other intersection of AX with ω. Points P and Q lie on AB and AC, respectively, so that PQ is tangent to ω at Y. Assume that AP=3,PB=4,AC=8, and AQ=nm, where m and n are relatively prime positive integers. Find m+n. Subtract from 720 You Must
Find the number of permutations of 1,2,3,4,5,6 such that for each k with 1≤k≤5, at least one of the first k terms of the permutation is greater than k. Subset Formation
Find the number of four-element subsets of {1,2,3,4,…,20} with the property that two distinct elements of a subset have a sum of 16, and two distinct elements of a subset have a sum of 24. For example, {3,5,13,19} and {6,10,20,18} are two such subsets. Homothety vs. Shoelace
Octagon ABCDEFGH with side lengths AB=CD=EF=GH=10 and BC=DE=FG=HA=11 is formed by removing four 6−8−10 triangles from the corners of a 23×27 rectangle with side AH on a short side of the rectangle, as shown. Let J be the midpoint of HA, and partition the octagon into 7 triangles by drawing segments JB, JC, JD, JE, JF, and JG. Find the area of the convex polygon whose vertices are the centroids of these 7 triangles.[asy]
unitsize(6);
pair P = (0, 0), Q = (0, 23), R = (27, 23), SS = (27, 0);
pair A = (0, 6), B = (8, 0), C = (19, 0), D = (27, 6), EE = (27, 17), F = (19, 23), G = (8, 23), J = (0, 23/2), H = (0, 17);
draw(P--Q--R--SS--cycle);
draw(J--B);
draw(J--C);
draw(J--D);
draw(J--EE);
draw(J--F);
draw(J--G);
draw(A--B);
draw(H--G);
real dark = 0.6;
filldraw(A--B--P--cycle, gray(dark));
filldraw(H--G--Q--cycle, gray(dark));
filldraw(F--EE--R--cycle, gray(dark));
filldraw(D--C--SS--cycle, gray(dark));
dot(A);
dot(B);
dot(C);
dot(D);
dot(EE);
dot(F);
dot(G);
dot(H);
dot(J);
dot(H);
defaultpen(fontsize(10pt));
real r = 1.3;
label("A", A, W*r);
label("B", B, S*r);
label("C", C, S*r);
label("D", D, E*r);
label("E", EE, E*r);
label("F", F, N*r);
label("G", G, N*r);
label("H", H, W*r);
label("J", J, W*r);
[/asy]