problem stringlengths 10 5.15k | answer dict |
|---|---|
A particle moves in the Cartesian plane according to the following rules:
From any lattice point $(a,b),$ the particle may only move to $(a+1,b), (a,b+1),$ or $(a+1,b+1).$
There are no right angle turns in the particle's path.
How many different paths can the particle take from $(0,0)$ to $(5,5)$? | {
"answer": "83",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Consider the points $A(0,12), B(10,9), C(8,0),$ and $D(-4,7).$ There is a unique square $S$ such that each of the four points is on a different side of $S.$ Let $K$ be the area of $S.$ Find the remainder when $10K$ is divided by $1000$. | {
"answer": "936",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Triangle $ABC$ has $BC=20.$ The incircle of the triangle evenly trisects the median $AD.$ If the area of the triangle is $m \sqrt{n}$ where $m$ and $n$ are integers and $n$ is not divisible by the square of a prime, find $m+n.$ | {
"answer": "38",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A hotel packed breakfast for each of three guests. Each breakfast should have consisted of three types of rolls, one each of nut, cheese, and fruit rolls. The preparer wrapped each of the nine rolls and once wrapped, the rolls were indistinguishable from one another. She then randomly put three rolls in a bag for each of the guests. Given that the probability each guest got one roll of each type is $\frac mn,$ where $m$ and $n$ are relatively prime integers, find $m+n.$ | {
"answer": "79",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The cards in a stack of $2n$ cards are numbered consecutively from 1 through $2n$ from top to bottom. The top $n$ cards are removed, kept in order, and form pile $A.$ The remaining cards form pile $B.$ The cards are then restacked by taking cards alternately from the tops of pile $B$ and $A,$ respectively. In this process, card number $(n+1)$ becomes the bottom card of the new stack, card number 1 is on top of this card, and so on, until piles $A$ and $B$ are exhausted. If, after the restacking process, at least one card from each pile occupies the same position that it occupied in the original stack, the stack is named magical. For example, eight cards form a magical stack because cards number 3 and number 6 retain their original positions. Find the number of cards in the magical stack in which card number 131 retains its original position. | {
"answer": "392",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Circles $C_1$ and $C_2$ are externally tangent, and they are both internally tangent to circle $C_3.$ The radii of $C_1$ and $C_2$ are 4 and 10, respectively, and the centers of the three circles are all collinear. A chord of $C_3$ is also a common external tangent of $C_1$ and $C_2.$ Given that the length of the chord is $\frac{m\sqrt{n}}p$ where $m,n,$ and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime, find $m+n+p.$ | {
"answer": "405",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Square $ABCD$ has center $O,\ AB=900,\ E$ and $F$ are on $AB$ with $AE<BF$ and $E$ between $A$ and $F, m\angle EOF =45^\circ,$ and $EF=400.$ Given that $BF=p+q\sqrt{r},$ where $p,q,$ and $r$ are positive integers and $r$ is not divisible by the square of any prime, find $p+q+r.$ | {
"answer": "307",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In triangle $ABC, AB=13, BC=15,$ and $CA = 14.$ Point $D$ is on $\overline{BC}$ with $CD=6.$ Point $E$ is on $\overline{BC}$ such that $\angle BAE\cong \angle CAD.$ Given that $BE=\frac pq$ where $p$ and $q$ are relatively prime positive integers, find $q.$ | {
"answer": "463",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $\mathcal{S}$ be the set of real numbers that can be represented as repeating decimals of the form $0.\overline{abc}$ where $a, b, c$ are distinct digits. Find the sum of the elements of $\mathcal{S}.$ | {
"answer": "360",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
An angle is drawn on a set of equally spaced parallel lines as shown. The ratio of the area of shaded region $C$ to the area of shaded region $B$ is 11/5. Find the ratio of shaded region $D$ to the area of shaded region $A.$
[asy] defaultpen(linewidth(0.7)+fontsize(10)); for(int i=0; i<4; i=i+1) { fill((2*i,0)--(2*i+1,0)--(2*i+1,6)--(2*i,6)--cycle, mediumgray); } pair A=(1/3,4), B=A+7.5*dir(-17), C=A+7*dir(10); draw(B--A--C); fill((7.3,0)--(7.8,0)--(7.8,6)--(7.3,6)--cycle, white); clip(B--A--C--cycle); for(int i=0; i<9; i=i+1) { draw((i,1)--(i,6)); } label("$\mathcal{A}$", A+0.2*dir(-17), S); label("$\mathcal{B}$", A+2.3*dir(-17), S); label("$\mathcal{C}$", A+4.4*dir(-17), S); label("$\mathcal{D}$", A+6.5*dir(-17), S);[/asy] | {
"answer": "408",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Hexagon $ABCDEF$ is divided into five rhombuses, $\mathcal{P, Q, R, S,}$ and $\mathcal{T,}$ as shown. Rhombuses $\mathcal{P, Q, R,}$ and $\mathcal{S}$ are congruent, and each has area $\sqrt{2006}.$ Let $K$ be the area of rhombus $\mathcal{T}$. Given that $K$ is a positive integer, find the number of possible values for $K$. | {
"answer": "89",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Eight circles of diameter 1 are packed in the first quadrant of the coordinate plane as shown. Let region $\mathcal{R}$ be the union of the eight circular regions. Line $l,$ with slope 3, divides $\mathcal{R}$ into two regions of equal area. Line $l$'s equation can be expressed in the form $ax=by+c,$ where $a, b,$ and $c$ are positive integers whose greatest common divisor is 1. Find $a^2+b^2+c^2.$ [asy] size(150);defaultpen(linewidth(0.7)); draw((6.5,0)--origin--(0,6.5), Arrows(5)); int[] array={3,3,2}; int i,j; for(i=0; i<3; i=i+1) { for(j=0; j<array[i]; j=j+1) { draw(Circle((1+2*i,1+2*j),1)); }} label("x", (7,0)); label("y", (0,7));[/asy] | {
"answer": "65",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A collection of 8 cubes consists of one cube with edge-length $k$ for each integer $k, 1 \le k \le 8.$ A tower is to be built using all 8 cubes according to the rules:
Any cube may be the bottom cube in the tower.
The cube immediately on top of a cube with edge-length $k$ must have edge-length at most $k+2.$
Let $T$ be the number of different towers than can be constructed. What is the remainder when $T$ is divided by 1000? | {
"answer": "458",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the sum of the values of $x$ such that $\cos^3 3x+ \cos^3 5x = 8 \cos^3 4x \cos^3 x$, where $x$ is measured in degrees and $100< x< 200.$ | {
"answer": "906",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For each even positive integer $x$, let $g(x)$ denote the greatest power of 2 that divides $x.$ For example, $g(20)=4$ and $g(16)=16.$ For each positive integer $n,$ let $S_n=\sum_{k=1}^{2^{n-1}}g(2k).$ Find the greatest integer $n$ less than 1000 such that $S_n$ is a perfect square. | {
"answer": "899",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A tripod has three legs each of length $5$ feet. When the tripod is set up, the angle between any pair of legs is equal to the angle between any other pair, and the top of the tripod is $4$ feet from the ground. In setting up the tripod, the lower 1 foot of one leg breaks off. Let $h$ be the height in feet of the top of the tripod from the ground when the broken tripod is set up. Then $h$ can be written in the form $\frac m{\sqrt{n}},$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $\lfloor m+\sqrt{n}\rfloor.$ (The notation $\lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $x.$) | {
"answer": "183",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Given that a sequence satisfies $x_0=0$ and $|x_k|=|x_{k-1}+3|$ for all integers $k\ge 1,$ find the minimum possible value of $|x_1+x_2+\cdots+x_{2006}|.$ | {
"answer": "27",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In convex hexagon $ABCDEF$, all six sides are congruent, $\angle A$ and $\angle D$ are right angles, and $\angle B, \angle C, \angle E,$ and $\angle F$ are congruent. The area of the hexagonal region is $2116(\sqrt{2}+1).$ Find $AB$. | {
"answer": "46",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The lengths of the sides of a triangle with positive area are $\log_{10} 12$, $\log_{10} 75$, and $\log_{10} n$, where $n$ is a positive integer. Find the number of possible values for $n$. | {
"answer": "893",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $(a_1,a_2,a_3,\ldots,a_{12})$ be a permutation of $(1,2,3,\ldots,12)$ for which
$a_1>a_2>a_3>a_4>a_5>a_6 \mathrm{\ and \ } a_6<a_7<a_8<a_9<a_{10}<a_{11}<a_{12}.$
An example of such a permutation is $(6,5,4,3,2,1,7,8,9,10,11,12).$ Find the number of such permutations. | {
"answer": "462",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the number of ordered pairs of positive integers $(a,b)$ such that $a+b=1000$ and neither $a$ nor $b$ has a zero digit. | {
"answer": "738",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Circles $\mathcal{C}_1, \mathcal{C}_2,$ and $\mathcal{C}_3$ have their centers at (0,0), (12,0), and (24,0), and have radii 1, 2, and 4, respectively. Line $t_1$ is a common internal tangent to $\mathcal{C}_1$ and $\mathcal{C}_2$ and has a positive slope, and line $t_2$ is a common internal tangent to $\mathcal{C}_2$ and $\mathcal{C}_3$ and has a negative slope. Given that lines $t_1$ and $t_2$ intersect at $(x,y),$ and that $x=p-q\sqrt{r},$ where $p, q,$ and $r$ are positive integers and $r$ is not divisible by the square of any prime, find $p+q+r.$ | {
"answer": "27",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A sequence is defined as follows $a_1=a_2=a_3=1,$ and, for all positive integers $n, a_{n+3}=a_{n+2}+a_{n+1}+a_n.$ Given that $a_{28}=6090307, a_{29}=11201821,$ and $a_{30}=20603361,$ find the remainder when $\sum^{28}_{k=1} a_k$ is divided by 1000. | {
"answer": "834",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Equilateral $\triangle ABC$ is inscribed in a circle of radius $2$. Extend $\overline{AB}$ through $B$ to point $D$ so that $AD=13,$ and extend $\overline{AC}$ through $C$ to point $E$ so that $AE = 11.$ Through $D,$ draw a line $l_1$ parallel to $\overline{AE},$ and through $E,$ draw a line $l_2$ parallel to $\overline{AD}.$ Let $F$ be the intersection of $l_1$ and $l_2.$ Let $G$ be the point on the circle that is collinear with $A$ and $F$ and distinct from $A.$ Given that the area of $\triangle CBG$ can be expressed in the form $\frac{p\sqrt{q}}{r},$ where $p, q,$ and $r$ are positive integers, $p$ and $r$ are relatively prime, and $q$ is not divisible by the square of any prime, find $p+q+r.$ | {
"answer": "865",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
How many integers $N$ less than $1000$ can be written as the sum of $j$ consecutive positive odd integers from exactly 5 values of $j\ge 1$? | {
"answer": "15",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $S_n$ be the sum of the reciprocals of the non-zero digits of the integers from $1$ to $10^n$ inclusive. Find the smallest positive integer $n$ for which $S_n$ is an integer. | {
"answer": "63",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Given that $x, y,$ and $z$ are real numbers that satisfy: \begin{align*} x &= \sqrt{y^2-\frac{1}{16}}+\sqrt{z^2-\frac{1}{16}}, \\ y &= \sqrt{z^2-\frac{1}{25}}+\sqrt{x^2-\frac{1}{25}}, \\ z &= \sqrt{x^2 - \frac 1{36}}+\sqrt{y^2-\frac 1{36}}, \end{align*} and that $x+y+z = \frac{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": "9",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Three planets orbit a star circularly in the same plane. Each moves in the same direction and moves at constant speed. Their periods are 60, 84, and 140 years. The three planets and the star are currently collinear. What is the fewest number of years from now that they will all be collinear again? | {
"answer": "105",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The formula for converting a Fahrenheit temperature $F$ to the corresponding Celsius temperature $C$ is $C = \frac{5}{9}(F-32).$ An integer Fahrenheit temperature is converted to Celsius, rounded to the nearest integer, converted back to Fahrenheit, and again rounded to the nearest integer.
For how many integer Fahrenheit temperatures between 32 and 1000 inclusive does the original temperature equal the final temperature? | {
"answer": "539",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A frog is placed at the origin on the number line, and moves according to the following rule: in a given move, the frog advances to either the closest point with a greater integer coordinate that is a multiple of 3, or to the closest point with a greater integer coordinate that is a multiple of 13. A move sequence is a sequence of coordinates which correspond to valid moves, beginning with 0, and ending with 39. For example, $0,\ 3,\ 6,\ 13,\ 15,\ 26,\ 39$ is a move sequence. How many move sequences are possible for the frog? | {
"answer": "169",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In right triangle $ABC$ with right angle $C$, $CA = 30$ and $CB = 16$. Its legs $CA$ and $CB$ are extended beyond $A$ and $B$. Points $O_1$ and $O_2$ lie in the exterior of the triangle and are the centers of two circles with equal radii. The circle with center $O_1$ is tangent to the hypotenuse and to the extension of leg $CA$, the circle with center $O_2$ is tangent to the hypotenuse and to the extension of leg $CB$, and the circles are externally tangent to each other. The length of the radius either circle can be expressed as $p/q$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. | {
"answer": "737",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In a 6 x 4 grid (6 rows, 4 columns), 12 of the 24 squares are to be shaded so that there are two shaded squares in each row and three shaded squares in each column. Let $N$ be the number of shadings with this property. Find the remainder when $N$ is divided by 1000. | {
"answer": "860",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In isosceles triangle $\triangle ABC$, $A$ is located at the origin and $B$ is located at $(20,0)$. Point $C$ is in the first quadrant with $AC = BC$ and angle $BAC = 75^{\circ}$. If triangle $ABC$ is rotated counterclockwise about point $A$ until the image of $C$ lies on the positive $y$-axis, the area of the region common to the original and the rotated triangle is in the form $p\sqrt{2} + q\sqrt{3} + r\sqrt{6} + s$, where $p,q,r,s$ are integers. Find $\frac{p-q+r-s}2$. | {
"answer": "875",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A square pyramid with base $ABCD$ and vertex $E$ has eight edges of length $4$. A plane passes through the midpoints of $AE$, $BC$, and $CD$. The plane's intersection with the pyramid has an area that can be expressed as $\sqrt{p}$. Find $p$. | {
"answer": "80",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A sequence is defined over non-negative integral indexes in the following way: $a_{0}=a_{1}=3$, $a_{n+1}a_{n-1}=a_{n}^{2}+2007$.
Find the greatest integer that does not exceed $\frac{a_{2006}^{2}+a_{2007}^{2}}{a_{2006}a_{2007}}.$ | {
"answer": "224",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $ABC$ be an equilateral triangle, and let $D$ and $F$ be points on sides $BC$ and $AB$, respectively, with $FA = 5$ and $CD = 2$. Point $E$ lies on side $CA$ such that angle $DEF = 60^{\circ}$. The area of triangle $DEF$ is $14\sqrt{3}$. The two possible values of the length of side $AB$ are $p \pm q \sqrt{r}$, where $p$ and $q$ are rational, and $r$ is an integer not divisible by the square of a prime. Find $r$. | {
"answer": "989",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The graph of the equation $9x+223y=2007$ is drawn on graph paper with each square representing one unit in each direction. How many of the $1$ by $1$ graph paper squares have interiors lying entirely below the graph and entirely in the first quadrant? | {
"answer": "888",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
An integer is called parity-monotonic if its decimal representation $a_{1}a_{2}a_{3}\cdots a_{k}$ satisfies $a_{i}<a_{i+1}$ if $a_{i}$ is odd, and $a_{i}>a_{i+1}$ if $a_{i}$ is even. How many four-digit parity-monotonic integers are there? | {
"answer": "640",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A rectangular piece of paper measures 4 units by 5 units. Several lines are drawn parallel to the edges of the paper. A rectangle determined by the intersections of some of these lines is called basic if
(i) all four sides of the rectangle are segments of drawn line segments, and
(ii) no segments of drawn lines lie inside the rectangle.
Given that the total length of all lines drawn is exactly 2007 units, let $N$ be the maximum possible number of basic rectangles determined. Find the remainder when $N$ is divided by 1000. | {
"answer": "896",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Two long cylindrical tubes of the same length but different diameters lie parallel to each other on a flat surface. The larger tube has radius $72$ and rolls along the surface toward the smaller tube, which has radius $24$. It rolls over the smaller tube and continues rolling along the flat surface until it comes to rest on the same point of its circumference as it started, having made one complete revolution. If the smaller tube never moves, and the rolling occurs with no slipping, the larger tube ends up a distance $x$ from where it starts. The distance $x$ can be expressed in the form $a\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.$ | {
"answer": "179",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A triangular array of squares has one square in the first row, two in the second, and in general, $k$ squares in the $k$th row for $1 \leq k \leq 11.$ With the exception of the bottom row, each square rests on two squares in the row immediately below (illustrated in the given diagram). In each square of the eleventh row, a $0$ or a $1$ is placed. Numbers are then placed into the other squares, with the entry for each square being the sum of the entries in the two squares below it. For how many initial distributions of $0$'s and $1$'s in the bottom row is the number in the top square a multiple of $3$?
[asy] for (int i=0; i<12; ++i){ for (int j=0; j<i; ++j){ //dot((-j+i/2,-i)); draw((-j+i/2,-i)--(-j+i/2+1,-i)--(-j+i/2+1,-i+1)--(-j+i/2,-i+1)--cycle); } } [/asy] | {
"answer": "640",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $f(x)$ be a polynomial with real coefficients such that $f(0) = 1,$ $f(2)+f(3)=125,$ and for all $x$, $f(x)f(2x^{2})=f(2x^{3}+x).$ Find $f(5).$ | {
"answer": "676",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Four circles $\omega,$ $\omega_{A},$ $\omega_{B},$ and $\omega_{C}$ with the same radius are drawn in the interior of triangle $ABC$ such that $\omega_{A}$ is tangent to sides $AB$ and $AC$, $\omega_{B}$ to $BC$ and $BA$, $\omega_{C}$ to $CA$ and $CB$, and $\omega$ is externally tangent to $\omega_{A},$ $\omega_{B},$ and $\omega_{C}$. If the sides of triangle $ABC$ are $13,$ $14,$ and $15,$ the radius of $\omega$ can be represented in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | {
"answer": "389",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Square $AIME$ has sides of length $10$ units. Isosceles triangle $GEM$ has base $EM$, and the area common to triangle $GEM$ and square $AIME$ is $80$ square units. Find the length of the altitude to $EM$ in $\triangle GEM$. | {
"answer": "25",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A triangular array of numbers has a first row consisting of the odd integers $1,3,5,\ldots,99$ in increasing order. Each row below the first has one fewer entry than the row above it, and the bottom row has a single entry. Each entry in any row after the top row equals the sum of the two entries diagonally above it in the row immediately above it. How many entries in the array are multiples of $67$? | {
"answer": "17",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $S_i$ be the set of all integers $n$ such that $100i\leq n < 100(i + 1)$. For example, $S_4$ is the set ${400,401,402,\ldots,499}$. How many of the sets $S_0, S_1, S_2, \ldots, S_{999}$ do not contain a perfect square? | {
"answer": "708",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $ABCD$ be an isosceles trapezoid with $\overline{AD}||\overline{BC}$ whose angle at the longer base $\overline{AD}$ is $\dfrac{\pi}{3}$. The diagonals have length $10\sqrt {21}$, and point $E$ is at distances $10\sqrt {7}$ and $30\sqrt {7}$ from vertices $A$ and $D$, respectively. Let $F$ be the foot of the altitude from $C$ to $\overline{AD}$. The distance $EF$ 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": "32",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Consider sequences that consist entirely of $A$'s and $B$'s and that have the property that every run of consecutive $A$'s has even length, and every run of consecutive $B$'s has odd length. Examples of such sequences are $AA$, $B$, and $AABAA$, while $BBAB$ is not such a sequence. How many such sequences have length 14? | {
"answer": "172",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let
\[p(x,y) = a_0 + a_1x + a_2y + a_3x^2 + a_4xy + a_5y^2 + a_6x^3 + a_7x^2y + a_8xy^2 + a_9y^3.\]
Suppose that
\[p(0,0) = p(1,0) = p( - 1,0) = p(0,1) = p(0, - 1)\\ = p(1,1) = p(1, - 1) = p(2,2) = 0.\]
There is a point $\left(\frac {a}{c},\frac {b}{c}\right)$ for which $p\left(\frac {a}{c},\frac {b}{c}\right) = 0$ for all such polynomials, where $a$, $b$, and $c$ are positive integers, $a$ and $c$ are relatively prime, and $c > 1$. Find $a + b + c$. | {
"answer": "40",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $\overline{AB}$ be a diameter of circle $\omega$. Extend $\overline{AB}$ through $A$ to $C$. Point $T$ lies on $\omega$ so that line $CT$ is tangent to $\omega$. Point $P$ is the foot of the perpendicular from $A$ to line $CT$. Suppose $\overline{AB} = 18$, and let $m$ denote the maximum possible length of segment $BP$. Find $m^{2}$. | {
"answer": "432",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A square piece of paper has sides of length $100$. From each corner a wedge is cut in the following manner: at each corner, the two cuts for the wedge each start at a distance $\sqrt{17}$ from the corner, and they meet on the diagonal at an angle of $60^{\circ}$ (see the figure below). The paper is then folded up along the lines joining the vertices of adjacent cuts. When the two edges of a cut meet, they are taped together. The result is a paper tray whose sides are not at right angles to the base. The height of the tray, that is, the perpendicular distance between the plane of the base and the plane formed by the upped edges, can be written in the form $\sqrt[n]{m}$, where $m$ and $n$ are positive integers, $m<1000$, and $m$ is not divisible by the $n$th power of any prime. Find $m+n$.
[asy]import cse5; size(200); pathpen=black; real s=sqrt(17); real r=(sqrt(51)+s)/sqrt(2); D((0,2*s)--(0,0)--(2*s,0)); D((0,s)--r*dir(45)--(s,0)); D((0,0)--r*dir(45)); D((r*dir(45).x,2*s)--r*dir(45)--(2*s,r*dir(45).y)); MP("30^\circ",r*dir(45)-(0.25,1),SW); MP("30^\circ",r*dir(45)-(1,0.5),SW); MP("\sqrt{17}",(0,s/2),W); MP("\sqrt{17}",(s/2,0),S); MP("\mathrm{cut}",((0,s)+r*dir(45))/2,N); MP("\mathrm{cut}",((s,0)+r*dir(45))/2,E); MP("\mathrm{fold}",(r*dir(45).x,s+r/2*dir(45).y),E); MP("\mathrm{fold}",(s+r/2*dir(45).x,r*dir(45).y));[/asy] | {
"answer": "871",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Rudolph bikes at a constant rate and stops for a five-minute break at the end of every mile. Jennifer bikes at a constant rate which is three-quarters the rate that Rudolph bikes, but Jennifer takes a five-minute break at the end of every two miles. Jennifer and Rudolph begin biking at the same time and arrive at the $50$-mile mark at exactly the same time. How many minutes has it taken them? | {
"answer": "620",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A block of cheese in the shape of a rectangular solid measures $10$ cm by $13$ cm by $14$ cm. Ten slices are cut from the cheese. Each slice has a width of $1$ cm and is cut parallel to one face of the cheese. The individual slices are not necessarily parallel to each other. What is the maximum possible volume in cubic cm of the remaining block of cheese after ten slices have been cut off? | {
"answer": "729",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
There exist $r$ unique nonnegative integers $n_1 > n_2 > \cdots > n_r$ and $r$ unique integers $a_k$ ($1\le k\le r$) with each $a_k$ either $1$ or $- 1$ such that \[a_13^{n_1} + a_23^{n_2} + \cdots + a_r3^{n_r} = 2008.\] Find $n_1 + n_2 + \cdots + n_r$. | {
"answer": "21",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A particle is located on the coordinate plane at $(5,0)$. Define a move for the particle as a counterclockwise rotation of $\pi/4$ radians about the origin followed by a translation of $10$ units in the positive $x$-direction. Given that the particle's position after $150$ moves is $(p,q)$, find the greatest integer less than or equal to $|p| + |q|$. | {
"answer": "19",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The diagram below shows a $4\times4$ rectangular array of points, each of which is $1$ unit away from its nearest neighbors.
[asy] unitsize(0.25inch); defaultpen(linewidth(0.7)); int i, j; for(i = 0; i < 4; ++i) for(j = 0; j < 4; ++j) dot(((real)i, (real)j)); [/asy]
Define a growing path to be a sequence of distinct points of the array with the property that the distance between consecutive points of the sequence is strictly increasing. Let $m$ be the maximum possible number of points in a growing path, and let $r$ be the number of growing paths consisting of exactly $m$ points. Find $mr$. | {
"answer": "240",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
There are two distinguishable flagpoles, and there are $19$ flags, of which $10$ are identical blue flags, and $9$ are identical green flags. Let $N$ be the number of distinguishable arrangements using all of the flags in which each flagpole has at least one flag and no two green flags on either pole are adjacent. Find the remainder when $N$ is divided by $1000$. | {
"answer": "310",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A regular hexagon with center at the origin in the complex plane has opposite pairs of sides one unit apart. One pair of sides is parallel to the imaginary axis. Let $R$ be the region outside the hexagon, and let $S = \left\lbrace\frac{1}{z}|z \in R\right\rbrace$. Then the area of $S$ has the form $a\pi + \sqrt{b}$, where $a$ and $b$ are positive integers. Find $a + b$. | {
"answer": "29",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $a$ and $b$ be positive real numbers with $a\ge b$. Let $\rho$ be the maximum possible value of $\frac {a}{b}$ for which the system of equations \[a^2 + y^2 = b^2 + x^2 = (a - x)^2 + (b - y)^2\] has a solution in $(x,y)$ satisfying $0\le x < a$ and $0\le y < b$. Then $\rho^2$ can be expressed as a fraction $\frac {m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. | {
"answer": "7",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Triangle $ABC$ has $AC = 450$ and $BC = 300$. Points $K$ and $L$ are located on $\overline{AC}$ and $\overline{AB}$ respectively so that $AK = CK$, and $\overline{CL}$ is the angle bisector of angle $C$. Let $P$ be the point of intersection of $\overline{BK}$ and $\overline{CL}$, and let $M$ be the point on line $BK$ for which $K$ is the midpoint of $\overline{PM}$. If $AM = 180$, find $LP$.
Diagram
[asy] import markers; defaultpen(fontsize(8)); size(300); pair A=(0,0), B=(30*sqrt(331),0), C, K, L, M, P; C = intersectionpoints(Circle(A,450), Circle(B,300))[0]; K = midpoint(A--C); L = (3*B+2*A)/5; P = extension(B,K,C,L); M = 2*K-P; draw(A--B--C--cycle); draw(C--L);draw(B--M--A); markangle(n=1,radius=15,A,C,L,marker(markinterval(stickframe(n=1),true))); markangle(n=1,radius=15,L,C,B,marker(markinterval(stickframe(n=1),true))); dot(A^^B^^C^^K^^L^^M^^P); label("$A$",A,(-1,-1));label("$B$",B,(1,-1));label("$C$",C,(1,1)); label("$K$",K,(0,2));label("$L$",L,(0,-2));label("$M$",M,(-1,1)); label("$P$",P,(1,1)); label("$180$",(A+M)/2,(-1,0));label("$180$",(P+C)/2,(-1,0));label("$225$",(A+K)/2,(0,2));label("$225$",(K+C)/2,(0,2)); label("$300$",(B+C)/2,(1,1)); [/asy] | {
"answer": "72",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $S = \{2^0,2^1,2^2,\ldots,2^{10}\}$. Consider all possible positive differences of pairs of elements of $S$. Let $N$ be the sum of all of these differences. Find the remainder when $N$ is divided by $1000$. | {
"answer": "398",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A game show offers a contestant three prizes A, B and C, each of which is worth a whole number of dollars from $$ 1$ to $$ 9999$ inclusive. The contestant wins the prizes by correctly guessing the price of each prize in the order A, B, C. As a hint, the digits of the three prices are given. On a particular day, the digits given were $1, 1, 1, 1, 3, 3, 3$. Find the total number of possible guesses for all three prizes consistent with the hint. | {
"answer": "420",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The Annual Interplanetary Mathematics Examination (AIME) is written by a committee of five Martians, five Venusians, and five Earthlings. At meetings, committee members sit at a round table with chairs numbered from $1$ to $15$ in clockwise order. Committee rules state that a Martian must occupy chair $1$ and an Earthling must occupy chair $15$, Furthermore, no Earthling can sit immediately to the left of a Martian, no Martian can sit immediately to the left of a Venusian, and no Venusian can sit immediately to the left of an Earthling. The number of possible seating arrangements for the committee is $N \cdot (5!)^3$. Find $N$. | {
"answer": "346",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In right $\triangle ABC$ with hypotenuse $\overline{AB}$, $AC = 12$, $BC = 35$, and $\overline{CD}$ is the altitude to $\overline{AB}$. Let $\omega$ be the circle having $\overline{CD}$ as a diameter. Let $I$ be a point outside $\triangle ABC$ such that $\overline{AI}$ and $\overline{BI}$ are both tangent to circle $\omega$. The ratio of the perimeter of $\triangle ABI$ to the length $AB$ can be expressed in the form $\frac {m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. | {
"answer": "11",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For $t = 1, 2, 3, 4$, define $S_t = \sum_{i = 1}^{350}a_i^t$, where $a_i \in \{1,2,3,4\}$. If $S_1 = 513$ and $S_4 = 4745$, find the minimum possible value for $S_2$. | {
"answer": "905",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In triangle $ABC$, $AB = 10$, $BC = 14$, and $CA = 16$. Let $D$ be a point in the interior of $\overline{BC}$. Let points $I_B$ and $I_C$ denote the incenters of triangles $ABD$ and $ACD$, respectively. The circumcircles of triangles $BI_BD$ and $CI_CD$ meet at distinct points $P$ and $D$. The maximum possible area of $\triangle BPC$ can be expressed in the form $a - b\sqrt {c}$, where $a$, $b$, and $c$ are positive integers and $c$ is not divisible by the square of any prime. Find $a + b + c$.
Diagram
[asy] defaultpen(fontsize(11)+0.8); size(300); pair A,B,C,D,Ic,Ib,P; A=MP("A",origin,down+left); B=MP("B",8*right,down+right); C=MP("C",IP(CR(A,5), CR(B,7)),2*up); real t=0.505; D=MP("",B+t*(C-B),SW); draw(A--B--C--A--D); path c1=incircle(A,D,C); path c2=incircle(A,D,B); draw(c1, gray+0.25); draw(c2, gray+0.25); Ic=MP("I_C",incenter(A,D,C),down+left); Ib=MP("I_B",incenter(A,D,B),left); path c3=circumcircle(Ic,D,C); path c4=circumcircle(Ib,D,B); draw(c3, fuchsia+0.2); draw(c4, fuchsia+0.2); P=MP("P",OP(c3,c4),up); draw(arc(circumcenter(B,C,P),B,C), royalblue+0.5+dashed); draw(C--Ic--D--P--C^^P--Ic, black+0.3); draw(B--Ib--D--P--B^^P--Ib, black+0.3); label("10",A--B,down); label("16",A--C,left); [/asy] | {
"answer": "150",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Equilateral triangle $T$ is inscribed in circle $A$, which has radius $10$. Circle $B$ with radius $3$ is internally tangent to circle $A$ at one vertex of $T$. Circles $C$ and $D$, both with radius $2$, are internally tangent to circle $A$ at the other two vertices of $T$. Circles $B$, $C$, and $D$ are all externally tangent to circle $E$, which has radius $\dfrac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
[asy] unitsize(3mm); defaultpen(linewidth(.8pt)); dotfactor=4; pair A=(0,0), D=8*dir(330), C=8*dir(210), B=7*dir(90); pair Ep=(0,4-27/5); pair[] dotted={A,B,C,D,Ep}; draw(Circle(A,10)); draw(Circle(B,3)); draw(Circle(C,2)); draw(Circle(D,2)); draw(Circle(Ep,27/5)); dot(dotted); label("$E$",Ep,E); label("$A$",A,W); label("$B$",B,W); label("$C$",C,W); label("$D$",D,E); [/asy] | {
"answer": "32",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Define $n!!$ to be $n(n-2)(n-4)\cdots 3\cdot 1$ for $n$ odd and $n(n-2)(n-4)\cdots 4\cdot 2$ for $n$ even. When $\sum_{i=1}^{2009} \frac{(2i-1)!!}{(2i)!!}$ is expressed as a fraction in lowest terms, its denominator is $2^ab$ with $b$ odd. Find $\dfrac{ab}{10}$. | {
"answer": "401",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $m$ be the number of solutions in positive integers to the equation $4x+3y+2z=2009$, and let $n$ be the number of solutions in positive integers to the equation $4x+3y+2z=2000$. Find the remainder when $m-n$ is divided by $1000$. | {
"answer": "0",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Four lighthouses are located at points $A$, $B$, $C$, and $D$. The lighthouse at $A$ is $5$ kilometers from the lighthouse at $B$, the lighthouse at $B$ is $12$ kilometers from the lighthouse at $C$, and the lighthouse at $A$ is $13$ kilometers from the lighthouse at $C$. To an observer at $A$, the angle determined by the lights at $B$ and $D$ and the angle determined by the lights at $C$ and $D$ are equal. To an observer at $C$, the angle determined by the lights at $A$ and $B$ and the angle determined by the lights at $D$ and $B$ are equal. The number of kilometers from $A$ to $D$ is given by $\frac {p\sqrt{q}}{r}$, where $p$, $q$, and $r$ are relatively prime positive integers, and $r$ is not divisible by the square of any prime. Find $p$ + $q$ + $r$.
Diagram
[asy] size(120); pathpen = linewidth(0.7); pointpen = black; pen f = fontsize(10); pair B=(0,0), A=(5,0), C=(0,13), E=(-5,0), O = incenter(E,C,A), D=IP(A -- A+3*(O-A),E--C); D(A--B--C--cycle); D(A--D--C); D(D--E--B, linetype("4 4")); MP("5", (A+B)/2, f); MP("13", (A+C)/2, NE,f); MP("A",D(A),f); MP("B",D(B),f); MP("C",D(C),N,f); MP("A'",D(E),f); MP("D",D(D),NW,f); D(rightanglemark(C,B,A,20)); D(anglemark(D,A,E,35));D(anglemark(C,A,D,30)); [/asy] -asjpz | {
"answer": "96",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For certain pairs $(m,n)$ of positive integers with $m\geq n$ there are exactly $50$ distinct positive integers $k$ such that $|\log m - \log k| < \log n$. Find the sum of all possible values of the product $mn$. | {
"answer": "125",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
From the set of integers $\{1,2,3,\dots,2009\}$, choose $k$ pairs $\{a_i,b_i\}$ with $a_i<b_i$ so that no two pairs have a common element. Suppose that all the sums $a_i+b_i$ are distinct and less than or equal to $2009$. Find the maximum possible value of $k$. | {
"answer": "803",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The sequence $(a_n)$ satisfies $a_0=0$ and $a_{n + 1} = \frac85a_n + \frac65\sqrt {4^n - a_n^2}$ for $n\geq 0$. Find the greatest integer less than or equal to $a_{10}$. | {
"answer": "983",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $\overline{MN}$ be a diameter of a circle with diameter 1. Let $A$ and $B$ be points on one of the semicircular arcs determined by $\overline{MN}$ such that $A$ is the midpoint of the semicircle and $MB=\frac{3}5$. Point $C$ lies on the other semicircular arc. Let $d$ be the length of the line segment whose endpoints are the intersections of diameter $\overline{MN}$ with chords $\overline{AC}$ and $\overline{BC}$. The largest possible value of $d$ can be written in the form $r-s\sqrt{t}$, where $r, s$ and $t$ are positive integers and $t$ is not divisible by the square of any prime. Find $r+s+t$. | {
"answer": "14",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the remainder when $9 \times 99 \times 999 \times \cdots \times \underbrace{99\cdots9}_{\text{999 9's}}$ is divided by $1000$. | {
"answer": "109",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Define an ordered triple $(A, B, C)$ of sets to be minimally intersecting if $|A \cap B| = |B \cap C| = |C \cap A| = 1$ and $A \cap B \cap C = \emptyset$. For example, $(\{1,2\},\{2,3\},\{1,3,4\})$ is a minimally intersecting triple. Let $N$ be the number of minimally intersecting ordered triples of sets for which each set is a subset of $\{1,2,3,4,5,6,7\}$. Find the remainder when $N$ is divided by $1000$.
Note: $|S|$ represents the number of elements in the set $S$. | {
"answer": "760",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For a real number $a$, let $\lfloor a \rfloor$ denote the greatest integer less than or equal to $a$. Let $\mathcal{R}$ denote the region in the coordinate plane consisting of points $(x,y)$ such that $\lfloor x \rfloor ^2 + \lfloor y \rfloor ^2 = 25$. The region $\mathcal{R}$ is completely contained in a disk of radius $r$ (a disk is the union of a circle and its interior). The minimum value of $r$ can be written as $\frac {\sqrt {m}}{n}$, where $m$ and $n$ are integers and $m$ is not divisible by the square of any prime. Find $m + n$. | {
"answer": "132",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$, where the $a_i$'s are integers, and $0 \le a_i \le 99$. An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$. Find $N$. | {
"answer": "202",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $\mathcal{R}$ be the region consisting of the set of points in the coordinate plane that satisfy both $|8 - x| + y \le 10$ and $3y - x \ge 15$. When $\mathcal{R}$ is revolved around the line whose equation is $3y - x = 15$, the volume of the resulting solid is $\frac {m\pi}{n\sqrt {p}}$, where $m$, $n$, and $p$ are positive integers, $m$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $m + n + p$. | {
"answer": "365",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $m \ge 3$ be an integer and let $S = \{3,4,5,\ldots,m\}$. Find the smallest value of $m$ such that for every partition of $S$ into two subsets, at least one of the subsets contains integers $a$, $b$, and $c$ (not necessarily distinct) such that $ab = c$.
Note: a partition of $S$ is a pair of sets $A$, $B$ such that $A \cap B = \emptyset$, $A \cup B = S$. | {
"answer": "243",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Rectangle $ABCD$ and a semicircle with diameter $AB$ are coplanar and have nonoverlapping interiors. Let $\mathcal{R}$ denote the region enclosed by the semicircle and the rectangle. Line $\ell$ meets the semicircle, segment $AB$, and segment $CD$ at distinct points $N$, $U$, and $T$, respectively. Line $\ell$ divides region $\mathcal{R}$ into two regions with areas in the ratio $1: 2$. Suppose that $AU = 84$, $AN = 126$, and $UB = 168$. Then $DA$ can be represented as $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": "69",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
For each positive integer n, let $f(n) = \sum_{k = 1}^{100} \lfloor \log_{10} (kn) \rfloor$. Find the largest value of $n$ for which $f(n) \le 300$.
Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$. | {
"answer": "109",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In $\triangle{ABC}$ with $AB = 12$, $BC = 13$, and $AC = 15$, let $M$ be a point on $\overline{AC}$ such that the incircles of $\triangle{ABM}$ and $\triangle{BCM}$ have equal radii. Then $\frac{AM}{CM} = \frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p + q$. | {
"answer": "45",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the smallest positive integer $n$ with the property that the polynomial $x^4 - nx + 63$ can be written as a product of two nonconstant polynomials with integer coefficients. | {
"answer": "8",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $N$ be the number of ordered pairs of nonempty sets $\mathcal{A}$ and $\mathcal{B}$ that have the following properties:
$\mathcal{A} \cup \mathcal{B} = \{1,2,3,4,5,6,7,8,9,10,11,12\}$,
$\mathcal{A} \cap \mathcal{B} = \emptyset$,
The number of elements of $\mathcal{A}$ is not an element of $\mathcal{A}$,
The number of elements of $\mathcal{B}$ is not an element of $\mathcal{B}$.
Find $N$. | {
"answer": "772",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the number of second-degree polynomials $f(x)$ with integer coefficients and integer zeros for which $f(0)=2010$. | {
"answer": "163",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Define a T-grid to be a $3\times3$ matrix which satisfies the following two properties:
Exactly five of the entries are $1$'s, and the remaining four entries are $0$'s.
Among the eight rows, columns, and long diagonals (the long diagonals are $\{a_{13},a_{22},a_{31}\}$ and $\{a_{11},a_{22},a_{33}\}$, no more than one of the eight has all three entries equal.
Find the number of distinct T-grids. | {
"answer": "68",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The $52$ cards in a deck are numbered $1, 2, \cdots, 52$. Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards form a team, and the two persons with higher numbered cards form another team. Let $p(a)$ be the probability that Alex and Dylan are on the same team, given that Alex picks one of the cards $a$ and $a+9$, and Dylan picks the other of these two cards. The minimum value of $p(a)$ for which $p(a)\ge\frac{1}{2}$ can be written as $\frac{m}{n}$. where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | {
"answer": "263",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Triangle $ABC$ with right angle at $C$, $\angle BAC < 45^\circ$ and $AB = 4$. Point $P$ on $\overline{AB}$ is chosen such that $\angle APC = 2\angle ACP$ and $CP = 1$. The ratio $\frac{AP}{BP}$ can be represented in the form $p + q\sqrt{r}$, where $p$, $q$, $r$ are positive integers and $r$ is not divisible by the square of any prime. Find $p+q+r$. | {
"answer": "7",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In triangle $ABC$, $AC = 13$, $BC = 14$, and $AB=15$. Points $M$ and $D$ lie on $AC$ with $AM=MC$ and $\angle ABD = \angle DBC$. Points $N$ and $E$ lie on $AB$ with $AN=NB$ and $\angle ACE = \angle ECB$. Let $P$ be the point, other than $A$, of intersection of the circumcircles of $\triangle AMN$ and $\triangle ADE$. Ray $AP$ meets $BC$ at $Q$. The ratio $\frac{BQ}{CQ}$ can be written in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m-n$.
Diagram
[asy] size(250); defaultpen(fontsize(9pt)); picture pic; pair A,B,C,D,E,M,N,P,Q; B=MP("B",origin, SW); C=MP("C", (12.5,0), SE); A=MP("A", IP(CR(C,10),CR(B,15)), dir(90)); N=MP("N", (A+B)/2, dir(180)); M=MP("M", midpoint(C--A), dir(70)); D=MP("D", extension(B,incenter(A,B,C),A,C), dir(C-B)); E=MP("E", extension(C,incenter(A,B,C),A,B), dir(90)); P=MP("P", OP(circumcircle(A,M,N),circumcircle(A,D,E)), dir(-70)); Q = MP("Q", extension(A,P,B,C),dir(-90)); draw(B--C--A--B^^M--P--N^^D--P--E^^A--Q); draw(circumcircle(A,M,N), gray); draw(circumcircle(A,D,E), heavygreen); dot(A);dot(B);dot(C);dot(D);dot(E);dot(P);dot(Q);dot(M);dot(N); [/asy] | {
"answer": "218",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In rectangle $ABCD$, $AB = 12$ and $BC = 10$. Points $E$ and $F$ lie inside rectangle $ABCD$ so that $BE = 9$, $DF = 8$, $\overline{BE} \parallel \overline{DF}$, $\overline{EF} \parallel \overline{AB}$, and line $BE$ intersects segment $\overline{AD}$. The length $EF$ can be expressed in the form $m \sqrt{n} - p$, where $m$, $n$, and $p$ are positive integers and $n$ is not divisible by the square of any prime. Find $m + n + p$. | {
"answer": "36",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $L$ be the line with slope $\frac{5}{12}$ that contains the point $A=(24,-1)$, and let $M$ be the line perpendicular to line $L$ that contains the point $B=(5,6)$. The original coordinate axes are erased, and line $L$ is made the $x$-axis and line $M$ the $y$-axis. In the new coordinate system, point $A$ is on the positive $x$-axis, and point $B$ is on the positive $y$-axis. The point $P$ with coordinates $(-14,27)$ in the original system has coordinates $(\alpha,\beta)$ in the new coordinate system. Find $\alpha+\beta$. | {
"answer": "31",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In triangle $ABC$, $AB=125$, $AC=117$ and $BC=120$. The angle bisector of angle $A$ intersects $\overline{BC}$ at point $L$, and the angle bisector of angle $B$ intersects $\overline{AC}$ at point $K$. Let $M$ and $N$ be the feet of the perpendiculars from $C$ to $\overline{BK}$ and $\overline{AL}$, respectively. Find $MN$. | {
"answer": "56",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The vertices of a regular nonagon (9-sided polygon) are to be labeled with the digits 1 through 9 in such a way that the sum of the numbers on every three consecutive vertices is a multiple of 3. Two acceptable arrangements are considered to be indistinguishable if one can be obtained from the other by rotating the nonagon in the plane. Find the number of distinguishable acceptable arrangements. | {
"answer": "144",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Find the number of positive integers $m$ for which there exist nonnegative integers $x_0$, $x_1$ , $\dots$ , $x_{2011}$ such that \[m^{x_0} = \sum_{k = 1}^{2011} m^{x_k}.\] | {
"answer": "16",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
In triangle $ABC$, $BC = 23$, $CA = 27$, and $AB = 30$. Points $V$ and $W$ are on $\overline{AC}$ with $V$ on $\overline{AW}$, points $X$ and $Y$ are on $\overline{BC}$ with $X$ on $\overline{CY}$, and points $Z$ and $U$ are on $\overline{AB}$ with $Z$ on $\overline{BU}$. In addition, the points are positioned so that $\overline{UV}\parallel\overline{BC}$, $\overline{WX}\parallel\overline{AB}$, and $\overline{YZ}\parallel\overline{CA}$. Right angle folds are then made along $\overline{UV}$, $\overline{WX}$, and $\overline{YZ}$. The resulting figure is placed on a leveled floor to make a table with triangular legs. Let $h$ be the maximum possible height of a table constructed from triangle $ABC$ whose top is parallel to the floor. Then $h$ can be written in the form $\frac{k\sqrt{m}}{n}$, where $k$ and $n$ are relatively prime positive integers and $m$ is a positive integer that is not divisible by the square of any prime. Find $k+m+n$.
[asy] unitsize(1 cm); pair translate; pair[] A, B, C, U, V, W, X, Y, Z; A[0] = (1.5,2.8); B[0] = (3.2,0); C[0] = (0,0); U[0] = (0.69*A[0] + 0.31*B[0]); V[0] = (0.69*A[0] + 0.31*C[0]); W[0] = (0.69*C[0] + 0.31*A[0]); X[0] = (0.69*C[0] + 0.31*B[0]); Y[0] = (0.69*B[0] + 0.31*C[0]); Z[0] = (0.69*B[0] + 0.31*A[0]); translate = (7,0); A[1] = (1.3,1.1) + translate; B[1] = (2.4,-0.7) + translate; C[1] = (0.6,-0.7) + translate; U[1] = U[0] + translate; V[1] = V[0] + translate; W[1] = W[0] + translate; X[1] = X[0] + translate; Y[1] = Y[0] + translate; Z[1] = Z[0] + translate; draw (A[0]--B[0]--C[0]--cycle); draw (U[0]--V[0],dashed); draw (W[0]--X[0],dashed); draw (Y[0]--Z[0],dashed); draw (U[1]--V[1]--W[1]--X[1]--Y[1]--Z[1]--cycle); draw (U[1]--A[1]--V[1],dashed); draw (W[1]--C[1]--X[1]); draw (Y[1]--B[1]--Z[1]); dot("$A$",A[0],N); dot("$B$",B[0],SE); dot("$C$",C[0],SW); dot("$U$",U[0],NE); dot("$V$",V[0],NW); dot("$W$",W[0],NW); dot("$X$",X[0],S); dot("$Y$",Y[0],S); dot("$Z$",Z[0],NE); dot(A[1]); dot(B[1]); dot(C[1]); dot("$U$",U[1],NE); dot("$V$",V[1],NW); dot("$W$",W[1],NW); dot("$X$",X[1],dir(-70)); dot("$Y$",Y[1],dir(250)); dot("$Z$",Z[1],NE);[/asy] | {
"answer": "318",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
The probability that a set of three distinct vertices chosen at random from among the vertices of a regular n-gon determine an obtuse triangle is $\frac{93}{125}$ . Find the sum of all possible values of $n$. | {
"answer": "503",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Let $R$ be the set of all possible remainders when a number of the form $2^n$, $n$ a nonnegative integer, is divided by 1000. Let $S$ be the sum of the elements in $R$. Find the remainder when $S$ is divided by 1000. | {
"answer": "7",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
Six men and some number of women stand in a line in random order. Let $p$ be the probability that a group of at least four men stand together in the line, given that every man stands next to at least one other man. Find the least number of women in the line such that $p$ does not exceed 1 percent. | {
"answer": "594",
"ground_truth": null,
"style": null,
"task_type": "math"
} |
A cube with side length 10 is suspended above a plane. The vertex closest to the plane is labeled $A$. The three vertices adjacent to vertex $A$ are at heights 10, 11, and 12 above the plane. The distance from vertex $A$ to the plane can be expressed as $\frac{r-\sqrt{s}}{t}$, where $r$, $s$, and $t$ are positive integers. Find $r+s+t$. | {
"answer": "330",
"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.