context listlengths 1 1 | gen_kwargs dict | repeat_idx int64 0 4 | request_idx int64 0 29 | task_name stringclasses 1
value | metadata dict | model_outputs stringlengths 805 116k |
|---|---|---|---|---|---|---|
[
{
"content": "Problem: Among the 900 residents of Aimeville, there are 195 who own a diamond ring, 367 who own a set of golf clubs, and 562 who own a garden spade. In addition, each of the 900 residents owns a bag of candy hearts. There are 437 residents who own exactly two of these things, and 234 residents wh... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 0 | AIME24 | {
"expected_answer": "73",
"problem_id": "aime24-0",
"reference_solution": "Let $w,x,y,z$ denote the number of residents who own 1,2,3 and 4 of these items, respectively. We know $w+x+y+z=900$ , since there are 900 residents in total. This simplifies to $w+z=229$ , since we know $x=437$ and $y=234$ . Now, w... | To solve this problem, we will use the principle of inclusion-exclusion. Let's define the following sets:
- \( D \): the set of residents who own a diamond ring.
- \( G \): the set of residents who own a set of golf clubs.
- \( S \): the set of residents who own a garden spade.
- \( C \): the set of residents who own ... |
[
{
"content": "Problem: A list of positive integers has the following properties: $\\bullet$ The sum of the items in the list is $30$ . $\\bullet$ The unique mode of the list is $9$ . $\\bullet$ The median of the list is a positive integer that does not appear in the list itself. Find the sum of the squares... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 1 | AIME24 | {
"expected_answer": "236",
"problem_id": "aime24-1",
"reference_solution": "The third condition implies that the list's size must be an even number, as if it were an odd number, the median of the list would surely appear in the list itself. Therefore, we can casework on what even numbers work. Say the size is 2.... | To solve the problem, we need to find a list of positive integers that satisfies the given conditions and then compute the sum of their squares. Let's break down the conditions and work through the solution step by step.
1. **Sum of the items is 30.**
2. **The unique mode is 9.**
3. **The median is a positive integer... |
[
{
"content": "Problem: Find the number of ways to place a digit in each cell of a 2x3 grid so that the sum of the two numbers formed by reading left to right is $999$ , and the sum of the three numbers formed by reading top to bottom is $99$ . The grid below is an example of such an arrangement because $8+99... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 2 | AIME24 | {
"expected_answer": "45",
"problem_id": "aime24-2",
"reference_solution": "Consider this table: $\\begin{array}{|c|c|c|} \\hline a & b & c \\\\ \\hline d & e & f\\\\ \\hline \\end{array}$ We note that $c+f = 9$ , because $c+f \\leq 18$ , meaning it never achieves a unit's digit sum of $9$ otherwise. Since no... | To solve the problem, we need to place digits in a 2x3 grid such that the sum of the two numbers formed by reading left to right is 999, and the sum of the three numbers formed by reading top to bottom is 99. Let's denote the grid as follows:
\[
\begin{array}{|c|c|c|}
\hline
a & b & c \\
\hline
d & e & f \\
\hline
\e... |
[
{
"content": "Problem: Let $x,y$ and $z$ be positive real numbers that satisfy the following system of equations:\n \\[\\log_2\\left({x \\over yz}\\right) = {1 \\over 2}\\] \\[\\log_2\\left({y \\over xz}\\right) = {1 \\over 3}\\] \\[\\log_2\\left({z \\over xy}\\right) = {1 \\over 4}\\] \nThen the value of... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 3 | AIME24 | {
"expected_answer": "33",
"problem_id": "aime24-3",
"reference_solution": "Denote $\\log_2(x) = a$ , $\\log_2(y) = b$ , and $\\log_2(z) = c$ . Then, we have:\n $a-b-c = \\frac{1}{2}$ \n $-a+b-c = \\frac{1}{3}$ \n $-a-b+c = \\frac{1}{4}$ Now, we can solve to get $a = \\frac{-7}{24}, b = \\frac{-9}{24}, c = \\... | To solve the given system of equations, we start by rewriting each equation in exponential form. The given equations are:
\[
\log_2\left(\frac{x}{yz}\right) = \frac{1}{2}
\]
\[
\log_2\left(\frac{y}{xz}\right) = \frac{1}{3}
\]
\[
\log_2\left(\frac{z}{xy}\right) = \frac{1}{4}
\]
Rewriting these in exponential form, we... |
[
{
"content": "Problem: Let ABCDEF be a convex equilateral hexagon in which all pairs of opposite sides are parallel. The triangle whose sides are extensions of segments AB, CD, and EF has side lengths 200, 240, and 300. Find the side length of the hexagon.\nMark your solution with \\boxed\nAnswer:",
"role":... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 4 | AIME24 | {
"expected_answer": "80",
"problem_id": "aime24-4",
"reference_solution": "Draw a good diagram!\nLet $AF \\cap BC$ , $BC \\cap DE$ , and $AF \\cap DE$ be K, L, and M, respectively. Let $KL=200, KM=300, ML=240$ . Notice that all smaller triangles formed are all similar to the larger $(200,240,300)$ triangl... | We begin by noting that the given hexagon \(ABCDEF\) is an equilateral hexagon with all pairs of opposite sides parallel. This configuration implies that the hexagon can be divided into two congruent parallelograms. Let's denote the side length of the hexagon by \(s\).
First, consider the triangle formed by extending... |
[
{
"content": "Problem: Alice chooses a set $A$ of positive integers. Then Bob lists all finite nonempty sets $B$ of positive integers with the property that the maximum element of $B$ belongs to $A$ . Bob's list has 2024 sets. Find the sum of the elements of A.\nMark your solution with \\boxed\nAnswer:",... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 5 | AIME24 | {
"expected_answer": "55",
"problem_id": "aime24-5",
"reference_solution": "Let $k$ be one of the elements in Alices set $A$ of positive integers. The number of sets that Bob lists with the property that their maximum element is k is $2^{k-1}$ , since every positive integer less than k can be in the set or o... | We need to determine the sum of the elements of the set \(A\) given that Bob lists all finite nonempty sets \(B\) of positive integers such that the maximum element of \(B\) belongs to \(A\) and there are 2024 such sets.
Let's denote the elements of \(A\) by \(a_1, a_2, \ldots, a_k\) where \(a_1 < a_2 < \cdots < a_k\... |
[
{
"content": "Problem: Let $N$ be the greatest four-digit positive integer with the property that whenever one of its digits is changed to $1$ , the resulting number is divisible by $7$ . Let $Q$ and $R$ be the quotient and remainder, respectively, when $N$ is divided by $1000$ . Find $Q+R$ .\nMark ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 6 | AIME24 | {
"expected_answer": "699",
"problem_id": "aime24-6",
"reference_solution": "We note that by changing a digit to $1$ for the number $\\overline{abcd}$ , we are subtracting the number by either $1000(a-1)$ , $100(b-1)$ , $10(c-1)$ , or $d-1$ . Thus, $1000a + 100b + 10c + d \\equiv 1000(a-1) \\equiv 100(b-1... | To solve the problem, we need to find the greatest four-digit positive integer \( N \) such that if any one of its digits is changed to 1, the resulting number is divisible by 7. Let's denote \( N \) as \( \overline{abcd} \), where \( a, b, c, d \) are its digits. We need to check the conditions for each digit being c... |
[
{
"content": "Problem: Torus $T$ is the surface produced by revolving a circle with radius $3$ around an axis in the plane of the circle that is a distance $6$ from the center of the circle (so like a donut). Let $S$ be a sphere with a radius $11$ . When $T$ rests on the inside of $S$ , it is intern... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 7 | AIME24 | {
"expected_answer": "127",
"problem_id": "aime24-7",
"reference_solution": "First, let's consider a section $\\mathcal{P}$ of the solids, along the axis.\nBy some 3D-Geomerty thinking, we can simply know that the axis crosses the sphere center. So, that is saying, the $\\mathcal{P}$ we took crosses one of th... | To solve the problem, we need to understand the geometry of the torus and the sphere, and how they interact when the torus is internally and externally tangent to the sphere.
First, let's identify the key parameters of the torus and the sphere:
- The torus \( T \) is generated by revolving a circle of radius 3 around... |
[
{
"content": "Problem: There is a collection of $25$ indistinguishable white chips and $25$ indistinguishable black chips. Find the number of ways to place some of these chips in the $25$ unit cells of a $5\\times5$ grid such that: each cell contains at most one chip all chips in the same row and all ch... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 8 | AIME24 | {
"expected_answer": "902",
"problem_id": "aime24-8",
"reference_solution": "The problem says \"some\", so not all cells must be occupied.\nWe start by doing casework on the column on the left. There can be 5,4,3,2, or 1 black chip. The same goes for white chips, so we will multiply by 2 at the end. There is $1$... | We need to find the number of ways to place 25 indistinguishable white chips and 25 indistinguishable black chips in a \(5 \times 5\) grid such that each cell contains at most one chip, all chips in the same row and all chips in the same column have the same color, and no additional chip can be placed without violatin... |
[
{
"content": "Problem: Let $\\triangle ABC$ have circumcenter $O$ and incenter $I$ with $\\overline{IA}\\perp\\overline{OI}$ , circumradius $13$ , and inradius $6$ . Find $AB\\cdot AC$ .\nMark your solution with \\boxed\nAnswer:",
"role": "user"
}
] | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 9 | AIME24 | {
"expected_answer": "468",
"problem_id": "aime24-9",
"reference_solution": "By Euler's formula $OI^{2}=R(R-2r)$ , we have $OI^{2}=13(13-12)=13$ . Thus, by the Pythagorean theorem, $AI^{2}=13^{2}-13=156$ . Let $AI\\cap(ABC)=M$ ; notice $\\triangle AOM$ is isosceles and $\\overline{OI}\\perp\\overline{AM}$ ... | To solve the problem, we start by using the given conditions and properties of the triangle. We know that the circumradius \( R = 13 \) and the inradius \( r = 6 \). Additionally, we are given that \( \overline{IA} \perp \overline{OI} \), which implies a specific relationship involving the triangle's angles and sides.... |
[
{
"content": "Problem: Find the number of triples of nonnegative integers $(a,b,c)$ satisfying $a + b + c = 300$ and\n \\[a^2b + a^2c + b^2a + b^2c + c^2a + c^2b = 6,000,000.\\]\nMark your solution with \\boxed\nAnswer:",
"role": "user"
}
] | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 10 | AIME24 | {
"expected_answer": "601",
"problem_id": "aime24-10",
"reference_solution": "$ab(a+b)+bc(b+c)+ac(a+c)=300(ab+bc+ac)-3abc=6000000, 100(ab+bc+ac)-abc=2000000$ Note that \n $(100-a)(100-b)(100-c)=1000000-10000(a+b+c)+100(ab+bc+ac)-abc=0$ . Thus, $a/b/c=100$ . There are $201$ cases for each but we need to subtrac... | To solve the problem, we start by analyzing the given equations:
\[a + b + c = 300\]
\[a^2b + a^2c + b^2a + b^2c + c^2a + c^2b = 6,000,000.\]
First, we notice that the right-hand side of the second equation is a symmetric expression in \(a, b, c\). This suggests that \(a, b, c\) might be equal or close to each other.... |
[
{
"content": "Problem: Let \\(O=(0,0)\\), \\(A=\\left(\\tfrac{1}{2},0\\right)\\), and \\(B=\\left(0,\\tfrac{\\sqrt{3}}{2}\\right)\\) be points in the coordinate plane. Let \\(\\mathcal{F}\\) be the family of segments \\(\\overline{PQ}\\) of unit length lying in the first quadrant with \\(P\\) on the \\(x\\)-axi... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 11 | AIME24 | {
"expected_answer": "23",
"problem_id": "aime24-11",
"reference_solution": "Begin by finding the equation of the line $\\overline{AB}$ : $y= -\\sqrt{3}x+\\frac{\\sqrt{3}}{2}$ Now, consider the general equation of all lines that belong to $\\mathcal{F}$ . Let $P$ be located at $(a,0)$ and $Q$ be located... | To solve the problem, we first need to determine the equation of the line segment \(\overline{AB}\). The coordinates of points \(A\) and \(B\) are \(\left(\frac{1}{2}, 0\right)\) and \(\left(0, \frac{\sqrt{3}}{2}\right)\), respectively. The slope of the line segment \(\overline{AB}\) is given by:
\[
\text{slope} = \fr... |
[
{
"content": "Problem: Let $\\omega\\neq 1$ be a 13th root of unity. Find the remainder when\n \\[\\prod_{k=0}^{12}(2-2\\omega^k+\\omega^{2k})\\] \nis divided by 1000.\nMark your solution with \\boxed\nAnswer:",
"role": "user"
}
] | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 12 | AIME24 | {
"expected_answer": "321",
"problem_id": "aime24-12",
"reference_solution": "\\[\\prod_{k=0}^{12} \\left(2- 2\\omega^k + \\omega^{2k}\\right) = \\prod_{k=0}^{12} \\left((1 - \\omega^k)^2 + 1\\right) = \\prod_{k=0}^{12} \\left((1 + i) - \\omega^k)((1 - i) - \\omega^k\\right)\\] Now, we consider the polynomial $x... | To solve the problem, we start by noting that \(\omega\) is a 13th root of unity, so \(\omega^{13} = 1\) and \(\omega^k \neq 1\) for \(k = 1, 2, \ldots, 12\). We need to find the remainder when the product \(\prod_{k=0}^{12}(2-2\omega^k+\omega^{2k})\) is divided by 1000.
First, we simplify the expression inside the p... |
[
{
"content": "Problem: Let \\(b\\ge 2\\) be an integer. Call a positive integer \\(n\\) \\(b\\text-\\textit{eautiful}\\) if it has exactly two digits when expressed in base \\(b\\) and these two digits sum to \\(\\sqrt n\\). For example, \\(81\\) is \\(13\\text-\\textit{eautiful}\\) because \\(81 = \\underlin... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 13 | AIME24 | {
"expected_answer": "211",
"problem_id": "aime24-13",
"reference_solution": "We write the base- $b$ two-digit integer as $\\left( xy \\right)_b$ .\nThus, this number satisfies\n \\[ \\left( x + y \\right)^2 = b x + y \\] \nwith $x \\in \\left\\{ 1, 2, \\cdots , b-1 \\right\\}$ and $y \\in \\left\\{ 0, 1, \\... | To determine the least integer \(b \ge 2\) for which there are more than ten \(b\)-beautiful integers, we first need to understand the conditions under which a number \(n\) is \(b\)-beautiful. A number \(n\) is \(b\)-beautiful if it has exactly two digits in base \(b\) and these two digits sum to \(\sqrt{n}\).
Let's ... |
[
{
"content": "Problem: Find the number of rectangles that can be formed inside a fixed regular dodecagon ( $12$ -gon) where each side of the rectangle lies on either a side or a diagonal of the dodecagon. The diagram below shows three of those rectangles. [asy] unitsize(0.6 inch); for(int i=0; i<360; i+=30) { d... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 14 | AIME24 | {
"expected_answer": "315",
"problem_id": "aime24-14",
"reference_solution": "By Furaken There are two kinds of such rectangles: those whose sides are parallel to some edges of the regular 12-gon (Case 1), and those whose sides are not (Case 2). For Case 1, WLOG assume that the rectangle's sides are horizontal an... | To determine the number of rectangles that can be formed inside a fixed regular dodecagon (12-gon) where each side of the rectangle lies on either a side or a diagonal of the dodecagon, we need to consider the properties and symmetries of the dodecagon.
A regular dodecagon has 12 vertices. We need to count the number... |
[
{
"content": "Problem: Every morning Aya goes for a $9$ -kilometer-long walk and stops at a coffee shop afterwards. When she walks at a constant speed of $s$ kilometers per hour, the walk takes her 4 hours, including $t$ minutes spent in the coffee shop. When she walks $s+2$ kilometers per hour, the walk... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 15 | AIME24 | {
"expected_answer": "204",
"problem_id": "aime24-15",
"reference_solution": "$\\frac{9}{s} + t = 4$ in hours and $\\frac{9}{s+2} + t = 2.4$ in hours. Subtracting the second equation from the first, we get, $\\frac{9}{s} - \\frac{9}{s+2} = 1.6$ Multiplying by $(s)(s+2)$ , we get $9s+18-9s=18=1.6s^{2} + 3.2s$ ... | To solve the problem, we need to determine the speed \( s \) and the time \( t \) spent in the coffee shop. We start by converting the time taken for the walk into hours.
When Aya walks at a speed of \( s \) kilometers per hour, the total time taken for the walk including the coffee shop visit is 4 hours. This includ... |
[
{
"content": "Problem: There exist real numbers $x$ and $y$ , both greater than 1, such that $\\log_x\\left(y^x\\right)=\\log_y\\left(x^{4y}\\right)=10$ . Find $xy$ .\nMark your solution with \\boxed\nAnswer:",
"role": "user"
}
] | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 16 | AIME24 | {
"expected_answer": "25",
"problem_id": "aime24-16",
"reference_solution": "By properties of logarithms, we can simplify the given equation to $x\\log_xy=4y\\log_yx=10$ . Let us break this into two separate equations: \\[x\\log_xy=10\\] \n \\[4y\\log_yx=10.\\] \nWe multiply the two equations to get: \n \\[4xy\\... | To solve the given problem, we start with the equations \(\log_x(y^x) = 10\) and \(\log_y(x^{4y}) = 10\). We can rewrite these logarithmic equations using the properties of logarithms.
First, consider the equation \(\log_x(y^x) = 10\). By the power rule of logarithms, this can be rewritten as:
\[
x \log_x(y) = 10 \im... |
[
{
"content": "Problem: Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take turns with Alice going first. On each turn, the player removes either $1$ token or $4$ tokens from the stack. Whoever removes the last token wins. Find the number of positive integers $n... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 17 | AIME24 | {
"expected_answer": "809",
"problem_id": "aime24-17",
"reference_solution": "Let's first try some experimentation. Alice obviously wins if there is one coin. She will just take it and win. If there are 2 remaining, then Alice will take one and then Bob will take one, so Bob wins. If there are $3$ , Alice will t... | We need to determine the number of positive integers \( n \leq 2024 \) for which Bob has a winning strategy, meaning he can always force a win regardless of Alice's moves. We start by identifying the winning and losing positions for \( n \).
A position \( n \) is a losing position if any move from \( n \) leads to a ... |
[
{
"content": "Problem: Jen enters a lottery by picking $4$ distinct numbers from $S=\\{1,2,3,\\cdots,9,10\\}.$ $4$ numbers are randomly chosen from $S.$ She wins a prize if at least two of her numbers were $2$ of the randomly chosen numbers, and wins the grand prize if all four of her numbers were the... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 18 | AIME24 | {
"expected_answer": "116",
"problem_id": "aime24-18",
"reference_solution": "This is a conditional probability problem. Bayes' Theorem states that \n \\[P(A|B)=\\dfrac{P(B|A)\\cdot P(A)}{P(B)}\\] in other words, the probability of $A$ given $B$ is equal to the probability of $B$ given $A$ times the proba... | To solve the problem, we need to calculate the probability of Jen winning the grand prize given that she won a prize. Let's break it down step by step.
1. **Calculate the total number of ways to choose 4 numbers from 10:**
\[
\binom{10}{4} = 210
\]
2. **Calculate the number of ways Jen can win the grand pri... |
[
{
"content": "Problem: Rectangles $ABCD$ and $EFGH$ are drawn such that $D,E,C,F$ are collinear. Also, $A,D,H,G$ all lie on a circle. If $BC=16$ , $AB=107$ , $FG=17$ , and $EF=184$ , what is the length of $CE$ ? [asy] import graph; unitsize(0.1cm); pair A = (0,0);pair B = (70,0);pair C = (70,16);pai... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 19 | AIME24 | {
"expected_answer": "104",
"problem_id": "aime24-19",
"reference_solution": "We use simple geometry to solve this problem. [asy] import graph; unitsize(0.1cm); pair A = (0,0);pair B = (107,0);pair C = (107,16);pair D = (0,16);pair E = (3,16);pair F = (187,16);pair G = (187,33);pair H = (3,33); label(\"$A$\", A,... | To solve the problem, we start by noting that \(ABCD\) and \(EFGH\) are rectangles, and the points \(D, E, C, F\) are collinear. Additionally, the points \(A, D, H, G\) lie on a circle. We are given the lengths \(BC = 16\), \(AB = 107\), \(FG = 17\), and \(EF = 184\).
First, we determine the coordinates of the points... |
[
{
"content": "Problem: Consider the paths of length $16$ that follow the lines from the lower left corner to the upper right corner on an $8\\times 8$ grid. Find the number of such paths that change direction exactly four times, as in the examples shown below. [asy] size(10cm); usepackage(\"tikz\");label(\"... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 20 | AIME24 | {
"expected_answer": "294",
"problem_id": "aime24-20",
"reference_solution": "We divide the path into eight “ $R$ ” movements and eight “ $U$ ” movements. Five sections of alternative $RURUR$ or $URURU$ are necessary in order to make four “turns.” We use the first case and multiply by $2$ . <br/>\nFor $U$ ,... | To solve the problem, we need to find the number of paths of length 16 from the lower left corner to the upper right corner of an 8x8 grid that change direction exactly four times. Each path consists of 8 right moves (R) and 8 up moves (U), and a path changes direction exactly four times if it changes direction at fou... |
[
{
"content": "Problem: Find the largest possible real part of \\[(75+117i)z+\\frac{96+144i}{z}\\] where $z$ is a complex number with $|z|=4$ .\nMark your solution with \\boxed\nAnswer:",
"role": "user"
}
] | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 21 | AIME24 | {
"expected_answer": "540",
"problem_id": "aime24-21",
"reference_solution": "Let $z=a+bi$ such that $a^2+b^2=4^2=16$ . The expression becomes: \\[(75+117i)(a+bi)+\\dfrac{96+144i}{a+bi}.\\] Call this complex number $w$ . We simplify this expression. \\begin{align*}\nw&=(75+117i)(a+bi)+\\dfrac{96+144i}{a+bi} \... | To find the largest possible real part of the expression \((75+117i)z + \frac{96+144i}{z}\) where \(z\) is a complex number with \(|z| = 4\), we start by letting \(z = 4e^{i\theta}\). Then, we can rewrite the expression as:
\[
(75+117i)z + \frac{96+144i}{z} = (75+117i)4e^{i\theta} + \frac{96+144i}{4e^{i\theta}} = 4(7... |
[
{
"content": "Problem: Eight circles of radius $34$ are sequentially tangent, and two of the circles are tangent to $AB$ and $BC$ of triangle $ABC$ , respectively. $2024$ circles of radius $1$ can be arranged in the same manner. The inradius of triangle $ABC$ can be expressed as $\\frac{m}{n}$ , w... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 22 | AIME24 | {
"expected_answer": "197",
"problem_id": "aime24-22",
"reference_solution": "Draw an altitude from both end circles of the diagram with the circles of radius one, and call the lengths you get drawing the altitudes of the circles down to $BC$ $a$ and $b$ . Now we have the length of side $BC$ of being $(2)... | To solve the problem, we need to determine the inradius of triangle \(ABC\) given the arrangement of circles.
First, let's analyze the arrangement of the 8 circles of radius 34. The centers of these circles form a regular heptagon (7-sided polygon) with each side equal to \(2 \times 34 = 68\). The distance from the c... |
[
{
"content": "Problem: Let $A$ , $B$ , $C$ , and $D$ be points on the hyperbola $\\frac{x^2}{20}- \\frac{y^2}{24} = 1$ such that $ABCD$ is a rhombus whose diagonals intersect at the origin. Find the greatest real number that is less than $BD^2$ for all such rhombi.\nMark your solution with \\boxed\nA... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 23 | AIME24 | {
"expected_answer": "480",
"problem_id": "aime24-23",
"reference_solution": "A quadrilateral is a rhombus if and only if its two diagonals bisect each other and are perpendicular to each other. The first condition is automatically satisfied because of the hyperbola's symmetry about the origin. To satisfy the sec... | To solve the problem, we start by noting that the hyperbola is given by the equation \(\frac{x^2}{20} - \frac{y^2}{24} = 1\). The diagonals of the rhombus \(ABCD\) intersect at the origin, which is the center of the hyperbola. Since the diagonals of a rhombus bisect each other at right angles, the points \(A, B, C,\) ... |
[
{
"content": "Problem: Let $ABC$ be a triangle inscribed in circle $\\omega$ . Let the tangents to $\\omega$ at $B$ and $C$ intersect at point $D$ , and let $\\overline{AD}$ intersect $\\omega$ at $P$ . If $AB=5$ , $BC=9$ , and $AC=10$ , $AP$ can be written as the form $\\frac{m}{n}$ , wher... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 24 | AIME24 | {
"expected_answer": "113",
"problem_id": "aime24-24",
"reference_solution": "From the tangency condition we have $\\let\\angle BCD = \\let\\angle CBD = \\let\\angle A$ . With LoC we have $\\cos(A) = \\frac{25+100-81}{2*5*10} = \\frac{11}{25}$ and $\\cos(B) = \\frac{81+25-100}{2*9*5} = \\frac{1}{15}$ . Then, ... | \boxed{31}
To solve for \( AP \) in the given triangle \( ABC \) with \( AB = 5 \), \( BC = 9 \), and \( AC = 10 \), we will use the properties of the tangents and the power of a point theorem.
First, we note that \( D \) is the intersection of the tangents to the circumcircle \( \omega \) at \( B \) and \( C \). By ... |
End of preview. Expand in Data Studio
YAML Metadata Warning:empty or missing yaml metadata in repo card
Check out the documentation for more information.
- Downloads last month
- 8