problem stringlengths 10 5.15k | answer dict |
|---|---|
Let $A_1 A_2 A_3 A_4 A_5 A_6 A_7 A_8$ be a regular octagon. Let $M_1$, $M_3$, $M_5$, and $M_7$ be the midpoints of sides $\overline{A_1 A_2}$, $\overline{A_3 A_4}$, $\overline{A_5 A_6}$, and $\overline{A_7 A_8}$, respectively. For $i = 1, 3, 5, 7$, ray $R_i$ is constructed from $M_i$ towards the interior of the octagon such that $R_1 \perp R_3$, $R_3 \perp R_5$, $R_5 \perp R_7$, and $R_7 \perp R_1$. Pairs of rays $R_1$ and $R_3$, $R_3$ and $R_5$, $R_5$ and $R_7$, and $R_7$ and $R_1$ meet at $B_1$, $B_3$, $B_5$, $B_7$ respectively. If $B_1 B_3 = A_1 A_2$, then $\cos 2 \angle A_3 M_3 B_1$ can be written in the form $m - \sqrt{n}$, where $m$ and $n$ are positive integers. Find $m + n$.
Diagram
[asy] size(250); pair A,B,C,D,E,F,G,H,M,N,O,O2,P,W,X,Y,Z; A=(-76.537,184.776); B=(76.537,184.776); C=(184.776,76.537); D=(184.776,-76.537); E=(76.537,-184.776); F=(-76.537,-184.776); G=(-184.776,-76.537); H=(-184.776,76.537); M=(A+B)/2; N=(C+D)/2; O=(E+F)/2; O2=(A+E)/2; P=(G+H)/2; W=(100,-41.421); X=(-41.421,-100); Y=(-100,41.421); Z=(41.421,100); draw(A--B--C--D--E--F--G--H--A); label("$A_1$",A,dir(112.5)); label("$A_2$",B,dir(67.5)); label("$\textcolor{blue}{A_3}$",C,dir(22.5)); label("$A_4$",D,dir(337.5)); label("$A_5$",E,dir(292.5)); label("$A_6$",F,dir(247.5)); label("$A_7$",G,dir(202.5)); label("$A_8$",H,dir(152.5)); label("$M_1$",M,dir(90)); label("$\textcolor{blue}{M_3}$",N,dir(0)); label("$M_5$",O,dir(270)); label("$M_7$",P,dir(180)); label("$O$",O2,dir(152.5)); draw(M--W,red); draw(N--X,red); draw(O--Y,red); draw(P--Z,red); draw(O2--(W+X)/2,red); draw(O2--N,red); label("$\textcolor{blue}{B_1}$",W,dir(292.5)); label("$B_2$",(W+X)/2,dir(292.5)); label("$B_3$",X,dir(202.5)); label("$B_5$",Y,dir(112.5)); label("$B_7$",Z,dir(22.5)); [/asy] All distances are to scale. | {
"answer": "37",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Define an ordered quadruple of integers $(a, b, c, d)$ as interesting if $1 \le a<b<c<d \le 10$, and $a+d>b+c$. How many interesting ordered quadruples are there? | {
"answer": "80",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Ed has five identical green marbles, and a large supply of identical red marbles. He arranges the green marbles and some of the red ones in a row and finds that the number of marbles whose right hand neighbor is the same color as themselves is equal to the number of marbles whose right hand neighbor is the other color. An example of such an arrangement is GGRRRGGRG. Let $m$ be the maximum number of red marbles for which such an arrangement is possible, and let $N$ be the number of ways he can arrange the $m+5$ marbles to satisfy the requirement. Find the remainder when $N$ is divided by $1000$. | {
"answer": "3",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $z_1,z_2,z_3,\dots,z_{12}$ be the 12 zeroes of the polynomial $z^{12}-2^{36}$. For each $j$, let $w_j$ be one of $z_j$ or $i z_j$. Then the maximum possible value of the real part of $\sum_{j=1}^{12} w_j$ can be written as $m+\sqrt{n}$ where $m$ and $n$ are positive integers. Find $m+n$. | {
"answer": "784",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $x_1, x_2, ... , x_6$ be non-negative real numbers such that $x_1 +x_2 +x_3 +x_4 +x_5 +x_6 =1$, and $x_1 x_3 x_5 +x_2 x_4 x_6 \ge {\frac{1}{540}}$. Let $p$ and $q$ be positive relatively prime integers such that $\frac{p}{q}$ is the maximum possible value of $x_1 x_2 x_3 + x_2 x_3 x_4 +x_3 x_4 x_5 +x_4 x_5 x_6 +x_5 x_6 x_1 +x_6 x_1 x_2$. Find $p+q$. | {
"answer": "559",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
There are $N$ permutations $(a_{1}, a_{2}, ... , a_{30})$ of $1, 2, \ldots, 30$ such that for $m \in \left\{{2, 3, 5}\right\}$, $m$ divides $a_{n+m} - a_{n}$ for all integers $n$ with $1 \leq n < n+m \leq 30$. Find the remainder when $N$ is divided by $1000$. | {
"answer": "440",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the number of positive integers with three not necessarily distinct digits, $abc$, with $a \neq 0$ and $c \neq 0$ such that both $abc$ and $cba$ are multiples of $4$. | {
"answer": "40",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Nine people sit down for dinner where there are three choices of meals. Three people order the beef meal, three order the chicken meal, and three order the fish meal. The waiter serves the nine meals in random order. Find the number of ways in which the waiter could serve the meal types to the nine people so that exactly one person receives the type of meal ordered by that person. | {
"answer": "216",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Butch and Sundance need to get out of Dodge. To travel as quickly as possible, each alternates walking and riding their only horse, Sparky, as follows. Butch begins by walking while Sundance rides. When Sundance reaches the first of the hitching posts that are conveniently located at one-mile intervals along their route, he ties Sparky to the post and begins walking. When Butch reaches Sparky, he rides until he passes Sundance, then leaves Sparky at the next hitching post and resumes walking, and they continue in this manner. Sparky, Butch, and Sundance walk at $6,$ $4,$ and $2.5$ miles per hour, respectively. The first time Butch and Sundance meet at a milepost, they are $n$ miles from Dodge, and they have been traveling for $t$ minutes. Find $n + t$. | {
"answer": "279",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
At each of the sixteen circles in the network below stands a student. A total of $3360$ coins are distributed among the sixteen students. All at once, all students give away all their coins by passing an equal number of coins to each of their neighbors in the network. After the trade, all students have the same number of coins as they started with. Find the number of coins the student standing at the center circle had originally.
[asy] import cse5; unitsize(6mm); defaultpen(linewidth(.8pt)); dotfactor = 8; pathpen=black; pair A = (0,0); pair B = 2*dir(54), C = 2*dir(126), D = 2*dir(198), E = 2*dir(270), F = 2*dir(342); pair G = 3.6*dir(18), H = 3.6*dir(90), I = 3.6*dir(162), J = 3.6*dir(234), K = 3.6*dir(306); pair M = 6.4*dir(54), N = 6.4*dir(126), O = 6.4*dir(198), P = 6.4*dir(270), L = 6.4*dir(342); pair[] dotted = {A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P}; D(A--B--H--M); D(A--C--H--N); D(A--F--G--L); D(A--E--K--P); D(A--D--J--O); D(B--G--M); D(F--K--L); D(E--J--P); D(O--I--D); D(C--I--N); D(L--M--N--O--P--L); dot(dotted); [/asy] | {
"answer": "280",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Cube $ABCDEFGH,$ labeled as shown below, has edge length $1$ and is cut by a plane passing through vertex $D$ and the midpoints $M$ and $N$ of $\overline{AB}$ and $\overline{CG}$ respectively. The plane divides the cube into two solids. The volume of the larger of the two solids can be written in the form $\tfrac{p}{q},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$
[asy]import cse5; unitsize(10mm); pathpen=black; dotfactor=3; pair A = (0,0), B = (3.8,0), C = (5.876,1.564), D = (2.076,1.564), E = (0,3.8), F = (3.8,3.8), G = (5.876,5.364), H = (2.076,5.364), M = (1.9,0), N = (5.876,3.465); pair[] dotted = {A,B,C,D,E,F,G,H,M,N}; D(A--B--C--G--H--E--A); D(E--F--B); D(F--G); pathpen=dashed; D(A--D--H); D(D--C); dot(dotted); label("$A$",A,SW); label("$B$",B,S); label("$C$",C,SE); label("$D$",D,NW); label("$E$",E,W); label("$F$",F,SE); label("$G$",G,NE); label("$H$",H,NW); label("$M$",M,S); label("$N$",N,NE); [/asy] | {
"answer": "89",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $\mathcal{S}$ be the set of all perfect squares whose rightmost three digits in base $10$ are $256$. Let $\mathcal{T}$ be the set of all numbers of the form $\frac{x-256}{1000}$, where $x$ is in $\mathcal{S}$. In other words, $\mathcal{T}$ is the set of numbers that result when the last three digits of each number in $\mathcal{S}$ are truncated. Find the remainder when the tenth smallest element of $\mathcal{T}$ is divided by $1000$. | {
"answer": "170",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A frog begins at $P_0 = (0,0)$ and makes a sequence of jumps according to the following rule: from $P_n = (x_n, y_n),$ the frog jumps to $P_{n+1},$ which may be any of the points $(x_n + 7, y_n + 2),$ $(x_n + 2, y_n + 7),$ $(x_n - 5, y_n - 10),$ or $(x_n - 10, y_n - 5).$ There are $M$ points $(x, y)$ with $|x| + |y| \le 100$ that can be reached by a sequence of such jumps. Find the remainder when $M$ is divided by $1000.$ | {
"answer": "373",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $\triangle ABC$ be a right triangle with right angle at $C.$ Let $D$ and $E$ be points on $\overline{AB}$ with $D$ between $A$ and $E$ such that $\overline{CD}$ and $\overline{CE}$ trisect $\angle C.$ If $\frac{DE}{BE} = \frac{8}{15},$ then $\tan B$ can be written as $\frac{m \sqrt{p}}{n},$ where $m$ and $n$ are relatively prime positive integers, and $p$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | {
"answer": "18",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Three concentric circles have radii $3,$ $4,$ and $5.$ An equilateral triangle with one vertex on each circle has side length $s.$ The largest possible area of the triangle can be written as $a + \tfrac{b}{c} \sqrt{d},$ where $a,$ $b,$ $c,$ and $d$ are positive integers, $b$ and $c$ are relatively prime, and $d$ is not divisible by the square of any prime. Find $a+b+c+d.$ | {
"answer": "41",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
There are $n$ mathematicians seated around a circular table with $n$ seats numbered $1,$ $2,$ $3,$ $...,$ $n$ in clockwise order. After a break they again sit around the table. The mathematicians note that there is a positive integer $a$ such that
($1$) for each $k,$ the mathematician who was seated in seat $k$ before the break is seated in seat $ka$ after the break (where seat $i + n$ is seat $i$);
($2$) for every pair of mathematicians, the number of mathematicians sitting between them after the break, counting in both the clockwise and the counterclockwise directions, is different from either of the number of mathematicians sitting between them before the break.
Find the number of possible values of $n$ with $1 < n < 1000.$ | {
"answer": "332",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Ana, Bob, and Cao bike at constant rates of $8.6$ meters per second, $6.2$ meters per second, and $5$ meters per second, respectively. They all begin biking at the same time from the northeast corner of a rectangular field whose longer side runs due west. Ana starts biking along the edge of the field, initially heading west, Bob starts biking along the edge of the field, initially heading south, and Cao bikes in a straight line across the field to a point $D$ on the south edge of the field. Cao arrives at point $D$ at the same time that Ana and Bob arrive at $D$ for the first time. The ratio of the field's length to the field's width to the distance from point $D$ to the southeast corner of the field can be represented as $p : q : r$, where $p$, $q$, and $r$ are positive integers with $p$ and $q$ relatively prime. Find $p+q+r$. | {
"answer": "61",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $S$ be the increasing sequence of positive integers whose binary representation has exactly $8$ ones. Let $N$ be the 1000th number in $S$. Find the remainder when $N$ is divided by $1000$. | {
"answer": "32",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The complex numbers $z$ and $w$ satisfy the system \[z + \frac{20i}w = 5+i\] \[w+\frac{12i}z = -4+10i\] Find the smallest possible value of $\vert zw\vert^2$. | {
"answer": "40",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For a positive integer $p$, define the positive integer $n$ to be $p$-safe if $n$ differs in absolute value by more than $2$ from all multiples of $p$. For example, the set of $10$-safe numbers is $\{ 3, 4, 5, 6, 7, 13, 14, 15, 16, 17, 23, \ldots\}$. Find the number of positive integers less than or equal to $10,000$ which are simultaneously $7$-safe, $11$-safe, and $13$-safe. | {
"answer": "958",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Equilateral $\triangle ABC$ has side length $\sqrt{111}$. There are four distinct triangles $AD_1E_1$, $AD_1E_2$, $AD_2E_3$, and $AD_2E_4$, each congruent to $\triangle ABC$, with $BD_1 = BD_2 = \sqrt{11}$. Find $\sum_{k=1}^4(CE_k)^2$. | {
"answer": "677",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In a group of nine people each person shakes hands with exactly two of the other people from the group. Let $N$ be the number of ways this handshaking can occur. Consider two handshaking arrangements different if and only if at least two people who shake hands under one arrangement do not shake hands under the other arrangement. Find the remainder when $N$ is divided by $1000$. | {
"answer": "16",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Triangle $ABC$ is inscribed in circle $\omega$ with $AB=5$, $BC=7$, and $AC=3$. The bisector of angle $A$ meets side $\overline{BC}$ at $D$ and circle $\omega$ at a second point $E$. Let $\gamma$ be the circle with diameter $\overline{DE}$. Circles $\omega$ and $\gamma$ meet at $E$ and a second point $F$. Then $AF^2 = \frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | {
"answer": "919",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $ABCD$ be a square, and let $E$ and $F$ be points on $\overline{AB}$ and $\overline{BC},$ respectively. The line through $E$ parallel to $\overline{BC}$ and the line through $F$ parallel to $\overline{AB}$ divide $ABCD$ into two squares and two nonsquare rectangles. The sum of the areas of the two squares is $\frac{9}{10}$ of the area of square $ABCD.$ Find $\frac{AE}{EB} + \frac{EB}{AE}.$ | {
"answer": "18",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The real root of the equation $8x^3 - 3x^2 - 3x - 1 = 0$ can be written in the form $\frac{\sqrt[3]a + \sqrt[3]b + 1}{c}$, where $a$, $b$, and $c$ are positive integers. Find $a+b+c$. | {
"answer": "98",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Melinda has three empty boxes and $12$ textbooks, three of which are mathematics textbooks. One box will hold any three of her textbooks, one will hold any four of her textbooks, and one will hold any five of her textbooks. If Melinda packs her textbooks into these boxes in random order, the probability that all three mathematics textbooks end up in the same box can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | {
"answer": "47",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
There are nonzero integers $a$, $b$, $r$, and $s$ such that the complex number $r+si$ is a zero of the polynomial $P(x)={x}^{3}-a{x}^{2}+bx-65$. For each possible combination of $a$ and $b$, let ${p}_{a,b}$ be the sum of the zeros of $P(x)$. Find the sum of the ${p}_{a,b}$'s for all possible combinations of $a$ and $b$. | {
"answer": "80",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Ms. Math's kindergarten class has $16$ registered students. The classroom has a very large number, $N$, of play blocks which satisfies the conditions:
(a) If $16$, $15$, or $14$ students are present in the class, then in each case all the blocks can be distributed in equal numbers to each student, and
(b) There are three integers $0 < x < y < z < 14$ such that when $x$, $y$, or $z$ students are present and the blocks are distributed in equal numbers to each student, there are exactly three blocks left over.
Find the sum of the distinct prime divisors of the least possible value of $N$ satisfying the above conditions. | {
"answer": "148",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $\bigtriangleup PQR$ be a triangle with $\angle P = 75^\circ$ and $\angle Q = 60^\circ$. A regular hexagon $ABCDEF$ with side length 1 is drawn inside $\triangle PQR$ so that side $\overline{AB}$ lies on $\overline{PQ}$, side $\overline{CD}$ lies on $\overline{QR}$, and one of the remaining vertices lies on $\overline{RP}$. There are positive integers $a, b, c,$ and $d$ such that the area of $\triangle PQR$ can be expressed in the form $\frac{a+b\sqrt{c}}{d}$, where $a$ and $d$ are relatively prime, and c is not divisible by the square of any prime. Find $a+b+c+d$. | {
"answer": "21",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Triangle $AB_0C_0$ has side lengths $AB_0 = 12$, $B_0C_0 = 17$, and $C_0A = 25$. For each positive integer $n$, points $B_n$ and $C_n$ are located on $\overline{AB_{n-1}}$ and $\overline{AC_{n-1}}$, respectively, creating three similar triangles $\triangle AB_nC_n \sim \triangle B_{n-1}C_nC_{n-1} \sim \triangle AB_{n-1}C_{n-1}$. The area of the union of all triangles $B_{n-1}C_nB_n$ for $n\geq1$ can be expressed as $\tfrac pq$, where $p$ and $q$ are relatively prime positive integers. Find $q$. | {
"answer": "961",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For $\pi \le \theta < 2\pi$, let
\begin{align*} P &= \frac12\cos\theta - \frac14\sin 2\theta - \frac18\cos 3\theta + \frac{1}{16}\sin 4\theta + \frac{1}{32} \cos 5\theta - \frac{1}{64} \sin 6\theta - \frac{1}{128} \cos 7\theta + \cdots \end{align*}
and
\begin{align*} Q &= 1 - \frac12\sin\theta -\frac14\cos 2\theta + \frac18 \sin 3\theta + \frac{1}{16}\cos 4\theta - \frac{1}{32}\sin 5\theta - \frac{1}{64}\cos 6\theta +\frac{1}{128}\sin 7\theta + \cdots \end{align*}
so that $\frac{P}{Q} = \frac{2\sqrt2}{7}$. Then $\sin\theta = -\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | {
"answer": "36",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $N$ be the number of ordered triples $(A,B,C)$ of integers satisfying the conditions (a) $0\le A<B<C\le99$, (b) there exist integers $a$, $b$, and $c$, and prime $p$ where $0\le b<a<c<p$, (c) $p$ divides $A-a$, $B-b$, and $C-c$, and (d) each ordered triple $(A,B,C)$ and each ordered triple $(b,a,c)$ form arithmetic sequences. Find $N$. | {
"answer": "272",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the least positive integer $N$ such that the set of $1000$ consecutive integers beginning with $1000\cdot N$ contains no square of an integer. | {
"answer": "282",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A hexagon that is inscribed in a circle has side lengths $22$, $22$, $20$, $22$, $22$, and $20$ in that order. The radius of the circle can be written as $p+\sqrt{q}$, where $p$ and $q$ are positive integers. Find $p+q$. | {
"answer": "272",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A $7\times 1$ board is completely covered by $m\times 1$ tiles without overlap; each tile may cover any number of consecutive squares, and each tile lies completely on the board. Each tile is either red, blue, or green. Let $N$ be the number of tilings of the $7\times 1$ board in which all three colors are used at least once. For example, a $1\times 1$ red tile followed by a $2\times 1$ green tile, a $1\times 1$ green tile, a $2\times 1$ blue tile, and a $1\times 1$ green tile is a valid tiling. Note that if the $2\times 1$ blue tile is replaced by two $1\times 1$ blue tiles, this results in a different tiling. Find the remainder when $N$ is divided by $1000$. | {
"answer": "106",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Given a circle of radius $\sqrt{13}$, let $A$ be a point at a distance $4 + \sqrt{13}$ from the center $O$ of the circle. Let $B$ be the point on the circle nearest to point $A$. A line passing through the point $A$ intersects the circle at points $K$ and $L$. The maximum possible area for $\triangle BKL$ can be written in the form $\frac{a - b\sqrt{c}}{d}$, where $a$, $b$, $c$, and $d$ are positive integers, $a$ and $d$ are relatively prime, and $c$ is not divisible by the square of any prime. Find $a+b+c+d$. | {
"answer": "146",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $A = \{1, 2, 3, 4, 5, 6, 7\}$, and let $N$ be the number of functions $f$ from set $A$ to set $A$ such that $f(f(x))$ is a constant function. Find the remainder when $N$ is divided by $1000$. | {
"answer": "399",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $S$ be the set of all polynomials of the form $z^3 + az^2 + bz + c$, where $a$, $b$, and $c$ are integers. Find the number of polynomials in $S$ such that each of its roots $z$ satisfies either $|z| = 20$ or $|z| = 13$. | {
"answer": "540",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In $\triangle ABC$, $AC = BC$, and point $D$ is on $\overline{BC}$ so that $CD = 3\cdot BD$. Let $E$ be the midpoint of $\overline{AD}$. Given that $CE = \sqrt{7}$ and $BE = 3$, the area of $\triangle ABC$ can be expressed in the form $m\sqrt{n}$, where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m+n$. | {
"answer": "10",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For positive integers $n$ and $k$, let $f(n, k)$ be the remainder when $n$ is divided by $k$, and for $n > 1$ let $F(n) = \max_{\substack{1\le k\le \frac{n}{2}}} f(n, k)$. Find the remainder when $\sum\limits_{n=20}^{100} F(n)$ is divided by $1000$. | {
"answer": "512",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $A,B,C$ be angles of an acute triangle with \begin{align*} \cos^2 A + \cos^2 B + 2 \sin A \sin B \cos C &= \frac{15}{8} \text{ and} \\ \cos^2 B + \cos^2 C + 2 \sin B \sin C \cos A &= \frac{14}{9} \end{align*} There are positive integers $p$, $q$, $r$, and $s$ for which \[\cos^2 C + \cos^2 A + 2 \sin C \sin A \cos B = \frac{p-q\sqrt{r}}{s},\] where $p+q$ and $s$ are relatively prime and $r$ is not divisible by the square of any prime. Find $p+q+r+s$. | {
"answer": "222",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The 8 eyelets for the lace of a sneaker all lie on a rectangle, four equally spaced on each of the longer sides. The rectangle has a width of 50 mm and a length of 80 mm. There is one eyelet at each vertex of the rectangle. The lace itself must pass between the vertex eyelets along a width side of the rectangle and then crisscross between successive eyelets until it reaches the two eyelets at the other width side of the rectangle as shown. After passing through these final eyelets, each of the ends of the lace must extend at least 200 mm farther to allow a knot to be tied. Find the minimum length of the lace in millimeters.
[asy] size(200); defaultpen(linewidth(0.7)); path laceL=(-20,-30)..tension 0.75 ..(-90,-135)..(-102,-147)..(-152,-150)..tension 2 ..(-155,-140)..(-135,-40)..(-50,-4)..tension 0.8 ..origin; path laceR=reflect((75,0),(75,-240))*laceL; draw(origin--(0,-240)--(150,-240)--(150,0)--cycle,gray); for(int i=0;i<=3;i=i+1) { path circ1=circle((0,-80*i),5),circ2=circle((150,-80*i),5); unfill(circ1); draw(circ1); unfill(circ2); draw(circ2); } draw(laceL--(150,-80)--(0,-160)--(150,-240)--(0,-240)--(150,-160)--(0,-80)--(150,0)^^laceR,linewidth(1));[/asy] | {
"answer": "790",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let the set $S = \{P_1, P_2, \dots, P_{12}\}$ consist of the twelve vertices of a regular $12$-gon. A subset $Q$ of $S$ is called "communal" if there is a circle such that all points of $Q$ are inside the circle, and all points of $S$ not in $Q$ are outside of the circle. How many communal subsets are there? (Note that the empty set is a communal subset.) | {
"answer": "134",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $x_1<x_2<x_3$ be the three real roots of the equation $\sqrt{2014}x^3-4029x^2+2=0$. Find $x_2(x_1+x_3)$. | {
"answer": "2",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A disk with radius $1$ is externally tangent to a disk with radius $5$. Let $A$ be the point where the disks are tangent, $C$ be the center of the smaller disk, and $E$ be the center of the larger disk. While the larger disk remains fixed, the smaller disk is allowed to roll along the outside of the larger disk until the smaller disk has turned through an angle of $360^\circ$. That is, if the center of the smaller disk has moved to the point $D$, and the point on the smaller disk that began at $A$ has now moved to point $B$, then $\overline{AC}$ is parallel to $\overline{BD}$. Then $\sin^2(\angle BEA)=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | {
"answer": "58",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A token starts at the point $(0,0)$ of an $xy$-coordinate grid and then makes a sequence of six moves. Each move is 1 unit in a direction parallel to one of the coordinate axes. Each move is selected randomly from the four possible directions and independently of the other moves. The probability the token ends at a point on the graph of $|y|=|x|$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | {
"answer": "391",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $A=\{1,2,3,4\}$, and $f$ and $g$ be randomly chosen (not necessarily distinct) functions from $A$ to $A$. The probability that the range of $f$ and the range of $g$ are disjoint is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m$. | {
"answer": "453",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
On square $ABCD$, points $E,F,G$, and $H$ lie on sides $\overline{AB},\overline{BC},\overline{CD},$ and $\overline{DA},$ respectively, so that $\overline{EG} \perp \overline{FH}$ and $EG=FH = 34$. Segments $\overline{EG}$ and $\overline{FH}$ intersect at a point $P$, and the areas of the quadrilaterals $AEPH, BFPE, CGPF,$ and $DHPG$ are in the ratio $269:275:405:411.$ Find the area of square $ABCD$.
[asy] pair A = (0,sqrt(850)); pair B = (0,0); pair C = (sqrt(850),0); pair D = (sqrt(850),sqrt(850)); draw(A--B--C--D--cycle); dotfactor = 3; dot("$A$",A,dir(135)); dot("$B$",B,dir(215)); dot("$C$",C,dir(305)); dot("$D$",D,dir(45)); pair H = ((2sqrt(850)-sqrt(306))/6,sqrt(850)); pair F = ((2sqrt(850)+sqrt(306)+7)/6,0); dot("$H$",H,dir(90)); dot("$F$",F,dir(270)); draw(H--F); pair E = (0,(sqrt(850)-6)/2); pair G = (sqrt(850),(sqrt(850)+sqrt(100))/2); dot("$E$",E,dir(180)); dot("$G$",G,dir(0)); draw(E--G); pair P = extension(H,F,E,G); dot("$P$",P,dir(60)); label("$w$", intersectionpoint( A--P, E--H )); label("$x$", intersectionpoint( B--P, E--F )); label("$y$", intersectionpoint( C--P, G--F )); label("$z$", intersectionpoint( D--P, G--H ));[/asy] | {
"answer": "850",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $m$ be the largest real solution to the equation
$\frac{3}{x-3}+\frac{5}{x-5}+\frac{17}{x-17}+\frac{19}{x-19}=x^2-11x-4$
There are positive integers $a$, $b$, and $c$ such that $m=a+\sqrt{b+\sqrt{c}}$. Find $a+b+c$. | {
"answer": "263",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In $\triangle ABC$, $AB = 3$, $BC = 4$, and $CA = 5$. Circle $\omega$ intersects $\overline{AB}$ at $E$ and $B$, $\overline{BC}$ at $B$ and $D$, and $\overline{AC}$ at $F$ and $G$. Given that $EF=DF$ and $\frac{DG}{EG} = \frac{3}{4}$, length $DE=\frac{a\sqrt{b}}{c}$, where $a$ and $c$ are relatively prime positive integers, and $b$ is a positive integer not divisible by the square of any prime. Find $a+b+c$. | {
"answer": "41",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Arnold is studying the prevalence of three health risk factors, denoted by A, B, and C, within a population of men. For each of the three factors, the probability that a randomly selected man in the population has only this risk factor (and none of the others) is 0.1. For any two of the three factors, the probability that a randomly selected man has exactly these two risk factors (but not the third) is 0.14. The probability that a randomly selected man has all three risk factors, given that he has A and B is $\frac{1}{3}$. The probability that a man has none of the three risk factors given that he does not have risk factor A is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. | {
"answer": "76",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A rectangle has sides of length $a$ and 36. A hinge is installed at each vertex of the rectangle, and at the midpoint of each side of length 36. The sides of length $a$ can be pressed toward each other keeping those two sides parallel so the rectangle becomes a convex hexagon as shown. When the figure is a hexagon with the sides of length $a$ parallel and separated by a distance of 24, the hexagon has the same area as the original rectangle. Find $a^2$.
[asy] pair A,B,C,D,E,F,R,S,T,X,Y,Z; dotfactor = 2; unitsize(.1cm); A = (0,0); B = (0,18); C = (0,36); // don't look here D = (12*2.236, 36); E = (12*2.236, 18); F = (12*2.236, 0); draw(A--B--C--D--E--F--cycle); dot(" ",A,NW); dot(" ",B,NW); dot(" ",C,NW); dot(" ",D,NW); dot(" ",E,NW); dot(" ",F,NW); //don't look here R = (12*2.236 +22,0); S = (12*2.236 + 22 - 13.4164,12); T = (12*2.236 + 22,24); X = (12*4.472+ 22,24); Y = (12*4.472+ 22 + 13.4164,12); Z = (12*4.472+ 22,0); draw(R--S--T--X--Y--Z--cycle); dot(" ",R,NW); dot(" ",S,NW); dot(" ",T,NW); dot(" ",X,NW); dot(" ",Y,NW); dot(" ",Z,NW); // sqrt180 = 13.4164 // sqrt5 = 2.236[/asy] | {
"answer": "720",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The repeating decimals $0.abab\overline{ab}$ and $0.abcabc\overline{abc}$ satisfy
\[0.abab\overline{ab}+0.abcabc\overline{abc}=\frac{33}{37},\]
where $a$, $b$, and $c$ are (not necessarily distinct) digits. Find the three digit number $abc$. | {
"answer": "447",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $f(x)=(x^2+3x+2)^{\cos(\pi x)}$. Find the sum of all positive integers $n$ for which \[\left |\sum_{k=1}^n\log_{10}f(k)\right|=1.\] | {
"answer": "21",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Circle $C$ with radius 2 has diameter $\overline{AB}$. Circle D is internally tangent to circle $C$ at $A$. Circle $E$ is internally tangent to circle $C$, externally tangent to circle $D$, and tangent to $\overline{AB}$. The radius of circle $D$ is three times the radius of circle $E$, and can be written in the form $\sqrt{m}-n$, where $m$ and $n$ are positive integers. Find $m+n$. | {
"answer": "254",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Ten chairs are arranged in a circle. Find the number of subsets of this set of chairs that contain at least three adjacent chairs. | {
"answer": "581",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In $\triangle RED$, $\measuredangle DRE=75^{\circ}$ and $\measuredangle RED=45^{\circ}$. $RD=1$. Let $M$ be the midpoint of segment $\overline{RD}$. Point $C$ lies on side $\overline{ED}$ such that $\overline{RC}\perp\overline{EM}$. Extend segment $\overline{DE}$ through $E$ to point $A$ such that $CA=AR$. Then $AE=\frac{a-\sqrt{b}}{c}$, where $a$ and $c$ are relatively prime positive integers, and $b$ is a positive integer. Find $a+b+c$. | {
"answer": "56",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Suppose that the angles of $\triangle ABC$ satisfy $\cos(3A)+\cos(3B)+\cos(3C)=1.$ Two sides of the triangle have lengths 10 and 13. There is a positive integer $m$ so that the maximum possible length for the remaining side of $\triangle ABC$ is $\sqrt{m}.$ Find $m.$ | {
"answer": "399",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Ten adults enter a room, remove their shoes, and toss their shoes into a pile. Later, a child randomly pairs each left shoe with a right shoe without regard to which shoes belong together. The probability that for every positive integer $k<5$, no collection of $k$ pairs made by the child contains the shoes from exactly $k$ of the adults is $\frac{m}{n}$, where m and n are relatively prime positive integers. Find $m+n.$ | {
"answer": "28",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In $\triangle{ABC}, AB=10, \angle{A}=30^\circ$ , and $\angle{C=45^\circ}$. Let $H, D,$ and $M$ be points on the line $BC$ such that $AH\perp{BC}$, $\angle{BAD}=\angle{CAD}$, and $BM=CM$. Point $N$ is the midpoint of the segment $HM$, and point $P$ is on ray $AD$ such that $PN\perp{BC}$. Then $AP^2=\dfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Diagram
[asy] unitsize(20); pair A = MP("A",(-5sqrt(3),0)), B = MP("B",(0,5),N), C = MP("C",(5,0)), M = D(MP("M",0.5(B+C),NE)), D = MP("D",IP(L(A,incenter(A,B,C),0,2),B--C),N), H = MP("H",foot(A,B,C),N), N = MP("N",0.5(H+M),NE), P = MP("P",IP(A--D,L(N,N-(1,1),0,10))); D(A--B--C--cycle); D(B--H--A,blue+dashed); D(A--D); D(P--N); markscalefactor = 0.05; D(rightanglemark(A,H,B)); D(rightanglemark(P,N,D)); MP("10",0.5(A+B)-(-0.1,0.1),NW); [/asy] | {
"answer": "77",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For any integer $k\geq 1$, let $p(k)$ be the smallest prime which does not divide $k.$ Define the integer function $X(k)$ to be the product of all primes less than $p(k)$ if $p(k)>2$, and $X(k)=1$ if $p(k)=2.$ Let $\{x_n\}$ be the sequence defined by $x_0=1$, and $x_{n+1}X(x_n)=x_np(x_n)$ for $n\geq 0.$ Find the smallest positive integer $t$ such that $x_t=2090.$ | {
"answer": "149",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In a drawer Sandy has $5$ pairs of socks, each pair a different color. On Monday Sandy selects two individual socks at random from the $10$ socks in the drawer. On Tuesday Sandy selects $2$ of the remaining $8$ socks at random and on Wednesday two of the remaining $6$ socks at random. The probability that Wednesday is the first day Sandy selects matching socks is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, Find $m+n$. | {
"answer": "341",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Point $A,B,C,D,$ and $E$ are equally spaced on a minor arc of a circle. Points $E,F,G,H,I$ and $A$ are equally spaced on a minor arc of a second circle with center $C$ as shown in the figure below. The angle $\angle ABD$ exceeds $\angle AHG$ by $12^\circ$. Find the degree measure of $\angle BAG$.
[asy] pair A,B,C,D,E,F,G,H,I,O; O=(0,0); C=dir(90); B=dir(70); A=dir(50); D=dir(110); E=dir(130); draw(arc(O,1,50,130)); real x=2*sin(20*pi/180); F=x*dir(228)+C; G=x*dir(256)+C; H=x*dir(284)+C; I=x*dir(312)+C; draw(arc(C,x,200,340)); label("$A$",A,dir(0)); label("$B$",B,dir(75)); label("$C$",C,dir(90)); label("$D$",D,dir(105)); label("$E$",E,dir(180)); label("$F$",F,dir(225)); label("$G$",G,dir(260)); label("$H$",H,dir(280)); label("$I$",I,dir(315)); [/asy] | {
"answer": "58",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In the diagram below, $ABCD$ is a square. Point $E$ is the midpoint of $\overline{AD}$. Points $F$ and $G$ lie on $\overline{CE}$, and $H$ and $J$ lie on $\overline{AB}$ and $\overline{BC}$, respectively, so that $FGHJ$ is a square. Points $K$ and $L$ lie on $\overline{GH}$, and $M$ and $N$ lie on $\overline{AD}$ and $\overline{AB}$, respectively, so that $KLMN$ is a square. The area of $KLMN$ is 99. Find the area of $FGHJ$.
[asy] pair A,B,C,D,E,F,G,H,J,K,L,M,N; B=(0,0); real m=7*sqrt(55)/5; J=(m,0); C=(7*m/2,0); A=(0,7*m/2); D=(7*m/2,7*m/2); E=(A+D)/2; H=(0,2m); N=(0,2m+3*sqrt(55)/2); G=foot(H,E,C); F=foot(J,E,C); draw(A--B--C--D--cycle); draw(C--E); draw(G--H--J--F); pair X=foot(N,E,C); M=extension(N,X,A,D); K=foot(N,H,G); L=foot(M,H,G); draw(K--N--M--L); label("$A$",A,NW); label("$B$",B,SW); label("$C$",C,SE); label("$D$",D,NE); label("$E$",E,dir(90)); label("$F$",F,NE); label("$G$",G,NE); label("$H$",H,W); label("$J$",J,S); label("$K$",K,SE); label("$L$",L,SE); label("$M$",M,dir(90)); label("$N$",N,dir(180)); [/asy] | {
"answer": "539",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For positive integer $n$, let $s(n)$ denote the sum of the digits of $n$. Find the smallest positive integer satisfying $s(n) = s(n+864) = 20$. | {
"answer": "695",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $S$ be the set of all ordered triple of integers $(a_1,a_2,a_3)$ with $1 \le a_1,a_2,a_3 \le 10$. Each ordered triple in $S$ generates a sequence according to the rule $a_n=a_{n-1}\cdot | a_{n-2}-a_{n-3} |$ for all $n\ge 4$. Find the number of such sequences for which $a_n=0$ for some $n$. | {
"answer": "494",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $f(x)$ be a third-degree polynomial with real coefficients satisfying \[|f(1)|=|f(2)|=|f(3)|=|f(5)|=|f(6)|=|f(7)|=12.\] Find $|f(0)|$. | {
"answer": "72",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Triangle $ABC$ has positive integer side lengths with $AB=AC$. Let $I$ be the intersection of the bisectors of $\angle B$ and $\angle C$. Suppose $BI=8$. Find the smallest possible perimeter of $\triangle ABC$. | {
"answer": "108",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Consider all 1000-element subsets of the set $\{1, 2, 3, ... , 2015\}$. From each such subset choose the least element. The arithmetic mean of all of these least elements is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p + q$.
Hint
Use the Hockey Stick Identity in the form
\[\binom{a}{a} + \binom{a+1}{a} + \binom{a+2}{a} + \dots + \binom{b}{a} = \binom{b+1}{a+1}.\]
(This is best proven by a combinatorial argument that coincidentally pertains to the problem: count two ways the number of subsets of the first $(b + 1)$ numbers with $(a + 1)$ elements whose least element is $i$, for $1 \le i \le b - a$.) | {
"answer": "431",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
With all angles measured in degrees, the product $\prod_{k=1}^{45} \csc^2(2k-1)^\circ=m^n$, where $m$ and $n$ are integers greater than 1. Find $m+n$. | {
"answer": "91",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For each integer $n \ge 2$, let $A(n)$ be the area of the region in the coordinate plane defined by the inequalities $1\le x \le n$ and $0\le y \le x \left\lfloor \sqrt x \right\rfloor$, where $\left\lfloor \sqrt x \right\rfloor$ is the greatest integer not exceeding $\sqrt x$. Find the number of values of $n$ with $2\le n \le 1000$ for which $A(n)$ is an integer. | {
"answer": "483",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A block of wood has the shape of a right circular cylinder with radius $6$ and height $8$, and its entire surface has been painted blue. Points $A$ and $B$ are chosen on the edge of one of the circular faces of the cylinder so that $\overarc{AB}$ on that face measures $120^\text{o}$. The block is then sliced in half along the plane that passes through point $A$, point $B$, and the center of the cylinder, revealing a flat, unpainted face on each half. The area of one of these unpainted faces is $a\cdot\pi + b\sqrt{c}$, where $a$, $b$, and $c$ are integers and $c$ is not divisible by the square of any prime. Find $a+b+c$.
[asy] import three; import solids; size(8cm); currentprojection=orthographic(-1,-5,3); picture lpic, rpic; size(lpic,5cm); draw(lpic,surface(revolution((0,0,0),(-3,3*sqrt(3),0)..(0,6,4)..(3,3*sqrt(3),8),Z,0,120)),gray(0.7),nolight); draw(lpic,surface(revolution((0,0,0),(-3*sqrt(3),-3,8)..(-6,0,4)..(-3*sqrt(3),3,0),Z,0,90)),gray(0.7),nolight); draw(lpic,surface((3,3*sqrt(3),8)..(-6,0,8)..(3,-3*sqrt(3),8)--cycle),gray(0.7),nolight); draw(lpic,(3,-3*sqrt(3),8)..(-6,0,8)..(3,3*sqrt(3),8)); draw(lpic,(-3,3*sqrt(3),0)--(-3,-3*sqrt(3),0),dashed); draw(lpic,(3,3*sqrt(3),8)..(0,6,4)..(-3,3*sqrt(3),0)--(-3,3*sqrt(3),0)..(-3*sqrt(3),3,0)..(-6,0,0),dashed); draw(lpic,(3,3*sqrt(3),8)--(3,-3*sqrt(3),8)..(0,-6,4)..(-3,-3*sqrt(3),0)--(-3,-3*sqrt(3),0)..(-3*sqrt(3),-3,0)..(-6,0,0)); draw(lpic,(6*cos(atan(-1/5)+3.14159),6*sin(atan(-1/5)+3.14159),0)--(6*cos(atan(-1/5)+3.14159),6*sin(atan(-1/5)+3.14159),8)); size(rpic,5cm); draw(rpic,surface(revolution((0,0,0),(3,3*sqrt(3),8)..(0,6,4)..(-3,3*sqrt(3),0),Z,230,360)),gray(0.7),nolight); draw(rpic,surface((-3,3*sqrt(3),0)..(6,0,0)..(-3,-3*sqrt(3),0)--cycle),gray(0.7),nolight); draw(rpic,surface((-3,3*sqrt(3),0)..(0,6,4)..(3,3*sqrt(3),8)--(3,3*sqrt(3),8)--(3,-3*sqrt(3),8)--(3,-3*sqrt(3),8)..(0,-6,4)..(-3,-3*sqrt(3),0)--cycle),white,nolight); draw(rpic,(-3,-3*sqrt(3),0)..(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),0)..(6,0,0)); draw(rpic,(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),0)..(6,0,0)..(-3,3*sqrt(3),0),dashed); draw(rpic,(3,3*sqrt(3),8)--(3,-3*sqrt(3),8)); draw(rpic,(-3,3*sqrt(3),0)..(0,6,4)..(3,3*sqrt(3),8)--(3,3*sqrt(3),8)..(3*sqrt(3),3,8)..(6,0,8)); draw(rpic,(-3,3*sqrt(3),0)--(-3,-3*sqrt(3),0)..(0,-6,4)..(3,-3*sqrt(3),8)--(3,-3*sqrt(3),8)..(3*sqrt(3),-3,8)..(6,0,8)); draw(rpic,(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),0)--(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),8)); label(rpic,"$A$",(-3,3*sqrt(3),0),W); label(rpic,"$B$",(-3,-3*sqrt(3),0),W); add(lpic.fit(),(0,0)); add(rpic.fit(),(1,0)); [/asy]
Credit to Royalreter1 and chezbgone2 for the diagram | {
"answer": "53",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $m$ be the least positive integer divisible by $17$ whose digits sum to $17$. Find $m$. | {
"answer": "476",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A cylindrical barrel with radius $4$ feet and height $10$ feet is full of water. A solid cube with side length $8$ feet is set into the barrel so that the diagonal of the cube is vertical. The volume of water thus displaced is $v$ cubic feet. Find $v^2$.
[asy] import three; import solids; size(5cm); currentprojection=orthographic(1,-1/6,1/6); draw(surface(revolution((0,0,0),(-2,-2*sqrt(3),0)--(-2,-2*sqrt(3),-10),Z,0,360)),white,nolight); triple A =(8*sqrt(6)/3,0,8*sqrt(3)/3), B = (-4*sqrt(6)/3,4*sqrt(2),8*sqrt(3)/3), C = (-4*sqrt(6)/3,-4*sqrt(2),8*sqrt(3)/3), X = (0,0,-2*sqrt(2)); draw(X--X+A--X+A+B--X+A+B+C); draw(X--X+B--X+A+B); draw(X--X+C--X+A+C--X+A+B+C); draw(X+A--X+A+C); draw(X+C--X+C+B--X+A+B+C,linetype("2 4")); draw(X+B--X+C+B,linetype("2 4")); draw(surface(revolution((0,0,0),(-2,-2*sqrt(3),0)--(-2,-2*sqrt(3),-10),Z,0,240)),white,nolight); draw((-2,-2*sqrt(3),0)..(4,0,0)..(-2,2*sqrt(3),0)); draw((-4*cos(atan(5)),-4*sin(atan(5)),0)--(-4*cos(atan(5)),-4*sin(atan(5)),-10)..(4,0,-10)..(4*cos(atan(5)),4*sin(atan(5)),-10)--(4*cos(atan(5)),4*sin(atan(5)),0)); draw((-2,-2*sqrt(3),0)..(-4,0,0)..(-2,2*sqrt(3),0),linetype("2 4")); [/asy] | {
"answer": "384",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Call a permutation $a_1, a_2, \ldots, a_n$ of the integers $1, 2, \ldots, n$ quasi-increasing if $a_k \leq a_{k+1} + 2$ for each $1 \leq k \leq n-1$. For example, 53421 and 14253 are quasi-increasing permutations of the integers $1, 2, 3, 4, 5$, but 45123 is not. Find the number of quasi-increasing permutations of the integers $1, 2, \ldots, 7$. | {
"answer": "486",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The circumcircle of acute $\triangle ABC$ has center $O$. The line passing through point $O$ perpendicular to $\overline{OB}$ intersects lines $AB$ and $BC$ and $P$ and $Q$, respectively. Also $AB=5$, $BC=4$, $BQ=4.5$, and $BP=\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Diagram
[asy] unitsize(30); draw(Circle((0,0),3)); pair A,B,C,O, Q, P, M, N; A=(2.5, -sqrt(11/4)); B=(-2.5, -sqrt(11/4)); C=(-1.96, 2.28); Q=(-1.89, 2.81); P=(1.13, -1.68); O=origin; M=foot(O,C,B); N=foot(O,A,B); draw(A--B--C--cycle); label("$A$",A,SE); label("$B$",B,SW); label("$C$",C,NW); label("$Q$",Q,NW); dot(O); label("$O$",O,NE); label("$M$",M,W); label("$N$",N,S); label("$P$",P,S); draw(B--O); draw(C--Q); draw(Q--O); draw(O--C); draw(O--A); draw(O--P); draw(O--M, dashed); draw(O--N, dashed); draw(rightanglemark((-2.5, -sqrt(11/4)),(0,0),(-1.89, 2.81),5)); draw(rightanglemark(O,N,B,5)); draw(rightanglemark(B,O,P,5)); draw(rightanglemark(O,M,C,5)); [/asy] | {
"answer": "23",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Define the sequence $a_1, a_2, a_3, \ldots$ by $a_n = \sum\limits_{k=1}^n \sin{k}$, where $k$ represents radian measure. Find the index of the 100th term for which $a_n < 0$. | {
"answer": "628",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $x$ and $y$ be real numbers satisfying $x^4y^5+y^4x^5=810$ and $x^3y^6+y^3x^6=945$. Evaluate $2x^3+(xy)^3+2y^3$. | {
"answer": "89",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Circles $\mathcal{P}$ and $\mathcal{Q}$ have radii $1$ and $4$, respectively, and are externally tangent at point $A$. Point $B$ is on $\mathcal{P}$ and point $C$ is on $\mathcal{Q}$ so that line $BC$ is a common external tangent of the two circles. A line $\ell$ through $A$ intersects $\mathcal{P}$ again at $D$ and intersects $\mathcal{Q}$ again at $E$. Points $B$ and $C$ lie on the same side of $\ell$, and the areas of $\triangle DBA$ and $\triangle ACE$ are equal. This common area is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
[asy] import cse5; pathpen=black; pointpen=black; size(6cm); pair E = IP(L((-.2476,1.9689),(0.8,1.6),-3,5.5),CR((4,4),4)), D = (-.2476,1.9689); filldraw(D--(0.8,1.6)--(0,0)--cycle,gray(0.7)); filldraw(E--(0.8,1.6)--(4,0)--cycle,gray(0.7)); D(CR((0,1),1)); D(CR((4,4),4,150,390)); D(L(MP("D",D(D),N),MP("A",D((0.8,1.6)),NE),1,5.5)); D((-1.2,0)--MP("B",D((0,0)),S)--MP("C",D((4,0)),S)--(8,0)); D(MP("E",E,N)); [/asy]
Hint
$[ABC] = \frac{1}{2}ab \text{sin} C$ is your friend for a quick solve. If you know about homotheties, go ahead, but you'll still need to do quite a bit of computation. If you're completely lost and you have a lot of time left in your mocking of this AIME, go ahead and use analytic geometry. | {
"answer": "129",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A regular icosahedron is a $20$-faced solid where each face is an equilateral triangle and five triangles meet at every vertex. The regular icosahedron shown below has one vertex at the top, one vertex at the bottom, an upper pentagon of five vertices all adjacent to the top vertex and all in the same horizontal plane, and a lower pentagon of five vertices all adjacent to the bottom vertex and all in another horizontal plane. Find the number of paths from the top vertex to the bottom vertex such that each part of a path goes downward or horizontally along an edge of the icosahedron, and no vertex is repeated.
[asy] size(3cm); pair A=(0.05,0),B=(-.9,-0.6),C=(0,-0.45),D=(.9,-0.6),E=(.55,-0.85),F=(-0.55,-0.85),G=B-(0,1.1),H=F-(0,0.6),I=E-(0,0.6),J=D-(0,1.1),K=C-(0,1.4),L=C+K-A; draw(A--B--F--E--D--A--E--A--F--A^^B--G--F--K--G--L--J--K--E--J--D--J--L--K); draw(B--C--D--C--A--C--H--I--C--H--G^^H--L--I--J^^I--D^^H--B,dashed); dot(A^^B^^C^^D^^E^^F^^G^^H^^I^^J^^K^^L); [/asy] | {
"answer": "810",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In $\triangle ABC$ let $I$ be the center of the inscribed circle, and let the bisector of $\angle ACB$ intersect $AB$ at $L$. The line through $C$ and $L$ intersects the circumscribed circle of $\triangle ABC$ at the two points $C$ and $D$. If $LI=2$ and $LD=3$, then $IC=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | {
"answer": "13",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For integers $a$ and $b$ consider the complex number \[\frac{\sqrt{ab+2016}}{ab+100}-\left({\frac{\sqrt{|a+b|}}{ab+100}}\right)i\]
Find the number of ordered pairs of integers $(a,b)$ such that this complex number is a real number. | {
"answer": "103",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For a permutation $p = (a_1,a_2,\ldots,a_9)$ of the digits $1,2,\ldots,9$, let $s(p)$ denote the sum of the three $3$-digit numbers $a_1a_2a_3$, $a_4a_5a_6$, and $a_7a_8a_9$. Let $m$ be the minimum value of $s(p)$ subject to the condition that the units digit of $s(p)$ is $0$. Let $n$ denote the number of permutations $p$ with $s(p) = m$. Find $|m - n|$. | {
"answer": "162",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Triangle $ABC$ has $AB=40,AC=31,$ and $\sin{A}=\frac{1}{5}$. This triangle is inscribed in rectangle $AQRS$ with $B$ on $\overline{QR}$ and $C$ on $\overline{RS}$. Find the maximum possible area of $AQRS$. | {
"answer": "744",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A strictly increasing sequence of positive integers $a_1$, $a_2$, $a_3$, $\cdots$ has the property that for every positive integer $k$, the subsequence $a_{2k-1}$, $a_{2k}$, $a_{2k+1}$ is geometric and the subsequence $a_{2k}$, $a_{2k+1}$, $a_{2k+2}$ is arithmetic. Suppose that $a_{13} = 2016$. Find $a_1$. | {
"answer": "504",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the least positive integer $m$ such that $m^2 - m + 11$ is a product of at least four not necessarily distinct primes. | {
"answer": "132",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Freddy the frog is jumping around the coordinate plane searching for a river, which lies on the horizontal line $y = 24$. A fence is located at the horizontal line $y = 0$. On each jump Freddy randomly chooses a direction parallel to one of the coordinate axes and moves one unit in that direction. When he is at a point where $y=0$, with equal likelihoods he chooses one of three directions where he either jumps parallel to the fence or jumps away from the fence, but he never chooses the direction that would have him cross over the fence to where $y < 0$. Freddy starts his search at the point $(0, 21)$ and will stop once he reaches a point on the river. Find the expected number of jumps it will take Freddy to reach the river. | {
"answer": "273",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Centered at each lattice point in the coordinate plane are a circle radius $\frac{1}{10}$ and a square with sides of length $\frac{1}{5}$ whose sides are parallel to the coordinate axes. The line segment from $(0,0)$ to $(1001, 429)$ intersects $m$ of the squares and $n$ of the circles. Find $m + n$. | {
"answer": "574",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Circles $\omega_1$ and $\omega_2$ intersect at points $X$ and $Y$. Line $\ell$ is tangent to $\omega_1$ and $\omega_2$ at $A$ and $B$, respectively, with line $AB$ closer to point $X$ than to $Y$. Circle $\omega$ passes through $A$ and $B$ intersecting $\omega_1$ again at $D \neq A$ and intersecting $\omega_2$ again at $C \neq B$. The three points $C$, $Y$, $D$ are collinear, $XC = 67$, $XY = 47$, and $XD = 37$. Find $AB^2$. | {
"answer": "270",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Triangle $ABC_0$ has a right angle at $C_0$. Its side lengths are pairwise relatively prime positive integers, and its perimeter is $p$. Let $C_1$ be the foot of the altitude to $\overline{AB}$, and for $n \geq 2$, let $C_n$ be the foot of the altitude to $\overline{C_{n-2}B}$ in $\triangle C_{n-2}C_{n-1}B$. The sum $\sum_{n=2}^\infty C_{n-2}C_{n-1} = 6p$. Find $p$. | {
"answer": "182",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Squares $ABCD$ and $EFGH$ have a common center and $\overline{AB} || \overline{EF}$. The area of $ABCD$ is 2016, and the area of $EFGH$ is a smaller positive integer. Square $IJKL$ is constructed so that each of its vertices lies on a side of $ABCD$ and each vertex of $EFGH$ lies on a side of $IJKL$. Find the difference between the largest and smallest positive integer values for the area of $IJKL$. | {
"answer": "840",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the number of sets ${a,b,c}$ of three distinct positive integers with the property that the product of $a,b,$ and $c$ is equal to the product of $11,21,31,41,51,61$. | {
"answer": "728",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The sequences of positive integers $1,a_2, a_3,...$ and $1,b_2, b_3,...$ are an increasing arithmetic sequence and an increasing geometric sequence, respectively. Let $c_n=a_n+b_n$. There is an integer $k$ such that $c_{k-1}=100$ and $c_{k+1}=1000$. Find $c_k$. | {
"answer": "262",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Triangle $ABC$ is inscribed in circle $\omega$. Points $P$ and $Q$ are on side $\overline{AB}$ with $AP<AQ$. Rays $CP$ and $CQ$ meet $\omega$ again at $S$ and $T$ (other than $C$), respectively. If $AP=4,PQ=3,QB=6,BT=5,$ and $AS=7$, then $ST=\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | {
"answer": "43",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Beatrix is going to place six rooks on a $6 \times 6$ chessboard where both the rows and columns are labeled $1$ to $6$; the rooks are placed so that no two rooks are in the same row or the same column. The $value$ of a square is the sum of its row number and column number. The $score$ of an arrangement of rooks is the least value of any occupied square.The average score over all valid configurations is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. | {
"answer": "371",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Equilateral $\triangle ABC$ has side length $600$. Points $P$ and $Q$ lie outside the plane of $\triangle ABC$ and are on opposite sides of the plane. Furthermore, $PA=PB=PC$, and $QA=QB=QC$, and the planes of $\triangle PAB$ and $\triangle QAB$ form a $120^{\circ}$ dihedral angle (the angle between the two planes). There is a point $O$ whose distance from each of $A,B,C,P,$ and $Q$ is $d$. Find $d$. | {
"answer": "450",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For $1 \leq i \leq 215$ let $a_i = \dfrac{1}{2^{i}}$ and $a_{216} = \dfrac{1}{2^{215}}$. Let $x_1, x_2, ..., x_{216}$ be positive real numbers such that $\sum_{i=1}^{216} x_i=1$ and $\sum_{1 \leq i < j \leq 216} x_ix_j = \dfrac{107}{215} + \sum_{i=1}^{216} \dfrac{a_i x_i^{2}}{2(1-a_i)}$. The maximum possible value of $x_2=\dfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | {
"answer": "863",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Fifteen distinct points are designated on $\triangle ABC$: the 3 vertices $A$, $B$, and $C$; $3$ other points on side $\overline{AB}$; $4$ other points on side $\overline{BC}$; and $5$ other points on side $\overline{CA}$. Find the number of triangles with positive area whose vertices are among these $15$ points. | {
"answer": "390",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A rational number written in base eight is $\underline{ab} . \underline{cd}$, where all digits are nonzero. The same number in base twelve is $\underline{bb} . \underline{ba}$. Find the base-ten number $\underline{abc}$. | {
"answer": "321",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A circle is circumscribed around an isosceles triangle whose two congruent angles have degree measure $x$. Two points are chosen independently and uniformly at random on the circle, and a chord is drawn between them. The probability that the chord intersects the triangle is $\frac{14}{25}$. Find the difference between the largest and smallest possible values of $x$. | {
"answer": "48",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.