Subcontests
(15)Circle in a Parallelogram
Let ABCD be a parallelogram with ∠BAD<90∘. A circle tangent to sides DA, AB, and BC intersects diagonal AC at points P and Q with AP<AQ, as shown. Suppose that AP=3, PQ=9, and QC=16. Then the area of ABCD can be expressed in the form mn, where m and n are positive integers, and n is not divisible by the square of any prime. Find m+n.[asy]
defaultpen(linewidth(0.6)+fontsize(11));
size(8cm);
pair A,B,C,D,P,Q;
A=(0,0);
label("A", A, SW);
B=(6,15);
label("B", B, NW);
C=(30,15);
label("C", C, NE);
D=(24,0);
label("D", D, SE);
P=(5.2,2.6);
label("P", (5.8,2.6), N);
Q=(18.3,9.1);
label("Q", (18.1,9.7), W);
draw(A--B--C--D--cycle);
draw(C--A);
draw(Circle((10.95,7.45), 7.45));
dot(A^^B^^C^^D^^P^^Q);
[/asy] I got money on my mind
For positive integers a, b, and c with a<b<c, consider collections of postage stamps in denominations a, b, and c cents that contain at least one stamp of each denomination. If there exists such a collection that contains sub-collections worth every whole number of cents up to 1000 cents, let f(a,b,c) be the minimum number of stamps in such a collection. Find the sum of the three least values of c such that f(a,b,c)=97 for some choice of a and b. Another Hexagon Problem?
Two externally tangent circles ω1 and ω2 have centers O1 and O2, respectively. A third circle Ω passing through O1 and O2 intersects ω1 at B and C and ω2 at A and D, as shown. Suppose that AB=2, O1O2=15, CD=16, and ABO1CDO2 is a convex hexagon. Find the area of this hexagon.
[asy]
import geometry;
size(10cm);
point O1=(0,0),O2=(15,0),B=9*dir(30);
circle w1=circle(O1,9),w2=circle(O2,6),o=circle(O1,O2,B);
point A=intersectionpoints(o,w2)[1],D=intersectionpoints(o,w2)[0],C=intersectionpoints(o,w1)[0];
filldraw(A--B--O1--C--D--O2--cycle,0.2*red+white,black);
draw(w1);
draw(w2);
draw(O1--O2,dashed);
draw(o);
dot(O1);
dot(O2);
dot(A);
dot(D);
dot(C);
dot(B);
label("ω1",8*dir(110),SW);
label("ω2",5*dir(70)+(15,0),SE);
label("O1",O1,W);
label("O2",O2,E);
label("B",B,N+1/2*E);
label("A",A,N+1/2*W);
label("C",C,S+1/4*W);
label("D",D,S+1/4*E);
label("15",midpoint(O1--O2),N);
label("16",midpoint(C--D),N);
label("2",midpoint(A--B),S);
label("Ω",o.C+(o.r-1)*dir(270));
[/asy] Get Ratioed
Let a,b,c,d,e,f,g,h,i be distinct integers from 1 to 9. The minimum possible positive value of g⋅h⋅ia⋅b⋅c−d⋅e⋅f can be written as nm, where m and n are relatively prime positive integers. Find m+n. RBBYGGYROPPO GANGNAM STYLE
Ellina has twelve blocks, two each of red (R), blue (B), yellow (Y), green (G), orange (O), and purple (P). Call an arrangement of blocks even if there is an even number of blocks between each pair of blocks of the same color. For example, the arrangement
R B B Y G G Y R O P P Ois even. Ellina arranges her blocks in a row in random order. The probability that her arrangement is even is nm, where m and n are relatively prime positive integers. Find m+n. When MAA can't decide between geo and combo
Let ℓA and ℓB be two distinct parallel lines. For positive integers m and n, distinct points A1,A2,A3,…,Am lie on ℓA, and distinct points B1,B2,B3,…,Bn lie on ℓB. Additionally, when segments AiBj are drawn for all i=1,2,3,…,m and j=1,2,3,…,n, no point strictly between ℓA and ℓB lies on more than two of the segments. Find the number of bounded regions into which this figure divides the plane when m=7 and n=5. The figure shows that there are 8 regions when m=3 and n=2.
[asy]
import geometry;
size(10cm);
draw((-2,0)--(13,0));
draw((0,4)--(10,4));
label("ℓA",(-2,0),W);
label("ℓB",(0,4),W);
point A1=(0,0),A2=(5,0),A3=(11,0),B1=(2,4),B2=(8,4),I1=extension(B1,A2,A1,B2),I2=extension(B1,A3,A1,B2),I3=extension(B1,A3,A2,B2);
draw(B1--A1--B2);
draw(B1--A2--B2);
draw(B1--A3--B2);
label("A1",A1,S);
label("A2",A2,S);
label("A3",A3,S);
label("B1",B1,N);
label("B2",B2,N);
label("1",centroid(A1,B1,I1));
label("2",centroid(B1,I1,I3));
label("3",centroid(B1,B2,I3));
label("4",centroid(A1,A2,I1));
label("5",(A2+I1+I2+I3)/4);
label("6",centroid(B2,I2,I3));
label("7",centroid(A2,A3,I2));
label("8",centroid(A3,B2,I2));
dot(A1);
dot(A2);
dot(A3);
dot(B1);
dot(B2);
[/asy] imagine not sillying this
Find the number of ordered pairs of integers (a,b) such that the sequence 3,4,5,a,b,30,40,50 is strictly increasing and no set of four (not necessarily consecutive) terms forms an arithmetic progression. The Quintessential Quadruplets
Let S be the set of all rational numbers that can be expressed as a repeating decimal in the form 0.abcd, where at least one of the digits a,b,c, or d is nonzero. Let N be the number of distinct numerators when numbers in S are written as fractions in lowest terms. For example, both 4 and 410 are counted among the distinct numerators for numbers in S because 0.3636=114 and 0.1230=3333410. Find the remainder when N is divided by 1000.
It's not like I share elements with you or anything, baka!
For any finite set X, let ∣X∣ denote the number of elements in X. Define Sn=∑∣A∩B∣, where the sum is taken over all ordered pairs (A,B) such that A and B are subsets of {1,2,3,…,n} with ∣A∣=∣B∣. For example, S2=4 because the sum is taken over the pairs of subsets (A,B)∈{(∅,∅),({1},{1}),({1},{2}),({2},{1}),({2},{2}),({1,2},{1,2})}, giving S2=0+1+0+0+1+2=4. Let S2021S2022=qp, where p and q are relatively prime positive integers. Find the remainder when p+q is divided by 1000.