Unnamed: 0
int64 0
40.3k
| problem
stringlengths 10
5.15k
| ground_truth
stringlengths 1
1.22k
| solved_percentage
float64 0
100
|
|---|---|---|---|
3,400 | For each prime $p$, a polynomial $P(x)$ with rational coefficients is called $p$-good if and only if there exist three integers $a, b$, and $c$ such that $0 \leq a<b<c<\frac{p}{3}$ and $p$ divides all the numerators of $P(a)$, $P(b)$, and $P(c)$, when written in simplest form. Compute the number of ordered pairs $(r, s)$ of rational numbers such that the polynomial $x^{3}+10x^{2}+rx+s$ is $p$-good for infinitely many primes $p$. | 12 | 3.125 |
3,401 | Let $A_{1} A_{2} \ldots A_{19}$ be a regular nonadecagon. Lines $A_{1} A_{5}$ and $A_{3} A_{4}$ meet at $X$. Compute $\angle A_{7} X A_{5}$. | \frac{1170^{\circ}}{19} | 0 |
3,402 | Let $A B C D$ be a rectangle such that $A B=20$ and $A D=24$. Point $P$ lies inside $A B C D$ such that triangles $P A C$ and $P B D$ have areas 20 and 24, respectively. Compute all possible areas of triangle $P A B$. | 98, 118, 122, 142 | 0.78125 |
3,403 | Compute the sum of all positive integers $n$ such that $n^{2}-3000$ is a perfect square. | 1872 | 5.46875 |
3,404 | Kelvin the Frog is hopping on a number line (extending to infinity in both directions). Kelvin starts at 0. Every minute, he has a $\frac{1}{3}$ chance of moving 1 unit left, a $\frac{1}{3}$ chance of moving 1 unit right and $\frac{1}{3}$ chance of getting eaten. Find the expected number of times Kelvin returns to 0 (not including the start) before getting eaten. | \frac{3\sqrt{5}-5}{5} | 0 |
3,405 | Let rectangle $A B C D$ have lengths $A B=20$ and $B C=12$. Extend ray $B C$ to $Z$ such that $C Z=18$. Let $E$ be the point in the interior of $A B C D$ such that the perpendicular distance from $E$ to \overline{A B}$ is 6 and the perpendicular distance from $E$ to \overline{A D}$ is 6 . Let line $E Z$ intersect $A B$ at $X$ and $C D$ at $Y$. Find the area of quadrilateral $A X Y D$. | 72 | 26.5625 |
3,406 | $A B C D$ is a cyclic quadrilateral with sides $A B=10, B C=8, C D=25$, and $D A=12$. A circle $\omega$ is tangent to segments $D A, A B$, and $B C$. Find the radius of $\omega$. | \sqrt{\frac{1209}{7}} \text{ OR } \frac{\sqrt{8463}}{7} | 0 |
3,407 | $S$ is a set of complex numbers such that if $u, v \in S$, then $u v \in S$ and $u^{2}+v^{2} \in S$. Suppose that the number $N$ of elements of $S$ with absolute value at most 1 is finite. What is the largest possible value of $N$ ? | 13 | 0 |
3,408 | Let $P$ be a polynomial such that $P(x)=P(0)+P(1) x+P(2) x^{2}$ and $P(-1)=1$. Compute $P(3)$. | 5 | 28.90625 |
3,409 | Knot is ready to face Gammadorf in a card game. In this game, there is a deck with twenty cards numbered from 1 to 20. Each player starts with a five card hand drawn from this deck. In each round, Gammadorf plays a card in his hand, then Knot plays a card in his hand. Whoever played a card with greater value gets a point. At the end of five rounds, the player with the most points wins. If Gammadorf starts with a hand of $1,5,10,15,20$, how many five-card hands of the fifteen remaining cards can Knot draw which always let Knot win (assuming he plays optimally)? | 2982 | 0 |
3,410 | Find the number of solutions in positive integers $(k ; a_{1}, a_{2}, \ldots, a_{k} ; b_{1}, b_{2}, \ldots, b_{k})$ to the equation $$a_{1}(b_{1})+a_{2}(b_{1}+b_{2})+\cdots+a_{k}(b_{1}+b_{2}+\cdots+b_{k})=7$$ | 15 | 11.71875 |
3,411 | Find the smallest integer $n \geq 5$ for which there exists a set of $n$ distinct pairs $\left(x_{1}, y_{1}\right), \ldots,\left(x_{n}, y_{n}\right)$ of positive integers with $1 \leq x_{i}, y_{i} \leq 4$ for $i=1,2, \ldots, n$, such that for any indices $r, s \in\{1,2, \ldots, n\}$ (not necessarily distinct), there exists an index $t \in\{1,2, \ldots, n\}$ such that 4 divides $x_{r}+x_{s}-x_{t}$ and $y_{r}+y_{s}-y_{t}$. | 8 | 59.375 |
3,412 | Two 18-24-30 triangles in the plane share the same circumcircle as well as the same incircle. What's the area of the region common to both the triangles? | 132 | 0 |
3,413 | Let \(a_{1}, a_{2}, \ldots\) be an infinite sequence of integers such that \(a_{i}\) divides \(a_{i+1}\) for all \(i \geq 1\), and let \(b_{i}\) be the remainder when \(a_{i}\) is divided by 210. What is the maximal number of distinct terms in the sequence \(b_{1}, b_{2}, \ldots\)? | 127 | 0 |
3,414 | A plane $P$ slices through a cube of volume 1 with a cross-section in the shape of a regular hexagon. This cube also has an inscribed sphere, whose intersection with $P$ is a circle. What is the area of the region inside the regular hexagon but outside the circle? | (3 \sqrt{3}-\pi) / 4 | 0 |
3,415 | Niffy's favorite number is a positive integer, and Stebbysaurus is trying to guess what it is. Niffy tells her that when expressed in decimal without any leading zeros, her favorite number satisfies the following: - Adding 1 to the number results in an integer divisible by 210 . - The sum of the digits of the number is twice its number of digits. - The number has no more than 12 digits. - The number alternates in even and odd digits. Given this information, what are all possible values of Niffy's favorite number? | 1010309 | 0 |
3,416 | Suppose $A B C$ is a triangle with circumcenter $O$ and orthocenter $H$ such that $A, B, C, O$, and $H$ are all on distinct points with integer coordinates. What is the second smallest possible value of the circumradius of $A B C$ ? | \sqrt{10} | 0 |
3,417 | A tetrahedron has all its faces triangles with sides $13,14,15$. What is its volume? | 42 \sqrt{55} | 0 |
3,418 | Let $b(x)=x^{2}+x+1$. The polynomial $x^{2015}+x^{2014}+\cdots+x+1$ has a unique "base $b(x)$ " representation $x^{2015}+x^{2014}+\cdots+x+1=\sum_{k=0}^{N} a_{k}(x) b(x)^{k}$ where each "digit" $a_{k}(x)$ is either the zero polynomial or a nonzero polynomial of degree less than $\operatorname{deg} b=2$; and the "leading digit $a_{N}(x)$ " is nonzero. Find $a_{N}(0)$. | -1006 | 0 |
3,419 | $M$ is an $8 \times 8$ matrix. For $1 \leq i \leq 8$, all entries in row $i$ are at least $i$, and all entries on column $i$ are at least $i$. What is the minimum possible sum of the entries of $M$ ? | 372 | 59.375 |
3,420 | Consider the cube whose vertices are the eight points $(x, y, z)$ for which each of $x, y$, and $z$ is either 0 or 1 . How many ways are there to color its vertices black or white such that, for any vertex, if all of its neighbors are the same color then it is also that color? Two vertices are neighbors if they are the two endpoints of some edge of the cube. | 118 | 0 |
3,421 | It can be shown that there exists a unique polynomial $P$ in two variables such that for all positive integers $m$ and $n$, $$P(m, n)=\sum_{i=1}^{m} \sum_{j=1}^{n}(i+j)^{7}$$ Compute $P(3,-3)$. | -2445 | 0 |
3,422 | An ordered pair $(a, b)$ of positive integers is called spicy if $\operatorname{gcd}(a+b, ab+1)=1$. Compute the probability that both $(99, n)$ and $(101, n)$ are spicy when $n$ is chosen from $\{1,2, \ldots, 2024\}$ uniformly at random. | \frac{96}{595} | 0 |
3,423 | Find the smallest integer $n$ such that $\sqrt{n+99}-\sqrt{n}<1$. | 2402 | 85.9375 |
3,424 | Alice is sitting in a teacup ride with infinitely many layers of spinning disks. The largest disk has radius 5. Each succeeding disk has its center attached to a point on the circumference of the previous disk and has a radius equal to $2 / 3$ of the previous disk. Each disk spins around its center (relative to the disk it is attached to) at a rate of \pi / 6$ radians per second. Initially, at $t=0$, the centers of the disks are aligned on a single line, going outward. Alice is sitting at the limit point of all these disks. After 12 seconds, what is the length of the trajectory that Alice has traced out? | 18 \pi | 0.78125 |
3,425 | Let $a, b$ be integers chosen independently and uniformly at random from the set $\{0,1,2, \ldots, 80\}$. Compute the expected value of the remainder when the binomial coefficient $\binom{a}{b}=\frac{a!}{b!(a-b)!}$ is divided by 3. | \frac{1816}{6561} | 0 |
3,426 | Let $S$ be the set \{1,2, \ldots, 2012\}. A perfectutation is a bijective function $h$ from $S$ to itself such that there exists an $a \in S$ such that $h(a) \neq a$, and that for any pair of integers $a \in S$ and $b \in S$ such that $h(a) \neq a, h(b) \neq b$, there exists a positive integer $k$ such that $h^{k}(a)=b$. Let $n$ be the number of ordered pairs of perfectutations $(f, g)$ such that $f(g(i))=g(f(i))$ for all $i \in S$, but $f \neq g$. Find the remainder when $n$ is divided by 2011 . | 2 | 14.84375 |
3,427 | How many elements are in the set obtained by transforming $\{(0,0),(2,0)\} 14$ times? | 477 | 0 |
3,428 | Let $f(x)=x^{2}+a x+b$ and $g(x)=x^{2}+c x+d$ be two distinct real polynomials such that the $x$-coordinate of the vertex of $f$ is a root of $g$, the $x$-coordinate of the vertex of $g$ is a root of $f$ and both $f$ and $g$ have the same minimum value. If the graphs of the two polynomials intersect at the point (2012, - 2012), what is the value of $a+c$ ? | -8048 | 19.53125 |
3,429 | Franklin has four bags, numbered 1 through 4. Initially, the first bag contains fifteen balls, numbered 1 through 15 , and the other bags are empty. Franklin randomly pulls a pair of balls out of the first bag, throws away the ball with the lower number, and moves the ball with the higher number into the second bag. He does this until there is only one ball left in the first bag. He then repeats this process in the second and third bag until there is exactly one ball in each bag. What is the probability that ball 14 is in one of the bags at the end? | \frac{2}{3} | 0 |
3,430 | A domino is a 1-by-2 or 2-by-1 rectangle. A domino tiling of a region of the plane is a way of covering it (and only it) completely by nonoverlapping dominoes. For instance, there is one domino tiling of a 2-by-1 rectangle and there are 2 tilings of a 2-by-2 rectangle (one consisting of two horizontal dominoes and one consisting of two vertical dominoes). How many domino tilings are there of a 2-by-10 rectangle? | 89 | 81.25 |
3,431 | Let $\mathcal{C}$ be the hyperbola $y^{2}-x^{2}=1$. Given a point $P_{0}$ on the $x$-axis, we construct a sequence of points $\left(P_{n}\right)$ on the $x$-axis in the following manner: let $\ell_{n}$ be the line with slope 1 passing through $P_{n}$, then $P_{n+1}$ is the orthogonal projection of the point of intersection of $\ell_{n}$ and $\mathcal{C}$ onto the $x$-axis. (If $P_{n}=0$, then the sequence simply terminates.) Let $N$ be the number of starting positions $P_{0}$ on the $x$-axis such that $P_{0}=P_{2008}$. Determine the remainder of $N$ when divided by 2008. | 254 | 1.5625 |
3,432 | For how many integers $a(1 \leq a \leq 200)$ is the number $a^{a}$ a square? | 107 | 21.09375 |
3,433 | Find all values of $x$ that satisfy $x=1-x+x^{2}-x^{3}+x^{4}-x^{5}+\cdots$ (be careful; this is tricky). | x=\frac{-1+\sqrt{5}}{2} | 20.3125 |
3,434 | An omino is a 1-by-1 square or a 1-by-2 horizontal rectangle. An omino tiling of a region of the plane is a way of covering it (and only it) by ominoes. How many omino tilings are there of a 2-by-10 horizontal rectangle? | 7921 | 0 |
3,435 | Let $a, b$, and $c$ be real numbers such that $a+b+c=100$, $ab+bc+ca=20$, and $(a+b)(a+c)=24$. Compute all possible values of $bc$. | 224, -176 | 0.78125 |
3,436 | Draw a square of side length 1. Connect its sides' midpoints to form a second square. Connect the midpoints of the sides of the second square to form a third square. Connect the midpoints of the sides of the third square to form a fourth square. And so forth. What is the sum of the areas of all the squares in this infinite series? | 2 | 95.3125 |
3,437 | Let $n$ be the maximum number of bishops that can be placed on the squares of a $6 \times 6$ chessboard such that no two bishops are attacking each other. Let $k$ be the number of ways to put $n$ bishops on an $6 \times 6$ chessboard such that no two bishops are attacking each other. Find $n+k$. (Two bishops are considered to be attacking each other if they lie on the same diagonal. Equivalently, if we label the squares with coordinates $(x, y)$, with $1 \leq x, y \leq 6$, then the bishops on $(a, b)$ and $(c, d)$ are attacking each other if and only if $|a-c|=|b-d|$.) | 74 | 0 |
3,438 | Amy and Ben need to eat 1000 total carrots and 1000 total muffins. The muffins can not be eaten until all the carrots are eaten. Furthermore, Amy can not eat a muffin within 5 minutes of eating a carrot and neither can Ben. If Amy eats 40 carrots per minute and 70 muffins per minute and Ben eats 60 carrots per minute and 30 muffins per minute, what is the minimum number of minutes it will take them to finish the food? | 23.5 | 0 |
3,439 | Another professor enters the same room and says, 'Each of you has to write down an integer between 0 and 200. I will then compute $X$, the number that is 3 greater than half the average of all the numbers that you will have written down. Each student who writes down the number closest to $X$ (either above or below $X$) will receive a prize.' One student, who misunderstood the question, announces to the class that he will write the number 107. If among the other 99 students it is common knowledge that all 99 of them will write down the best response, and there is no further communication between students, what single integer should each of the 99 students write down? | 7 | 81.25 |
3,440 | Let $p$ denote the proportion of teams, out of all participating teams, who submitted a negative response to problem 5 of the Team round (e.g. "there are no such integers"). Estimate $P=\lfloor 10000p\rfloor$. An estimate of $E$ earns $\max (0,\lfloor 20-|P-E|/20\rfloor)$ points. If you have forgotten, problem 5 of the Team round was the following: "Determine, with proof, whether there exist positive integers $x$ and $y$ such that $x+y, x^{2}+y^{2}$, and $x^{3}+y^{3}$ are all perfect squares." | 5568 | 0 |
3,441 | A lattice point in the plane is a point of the form $(n, m)$, where $n$ and $m$ are integers. Consider a set $S$ of lattice points. We construct the transform of $S$, denoted by $S^{\prime}$, by the following rule: the pair $(n, m)$ is in $S^{\prime}$ if and only if any of $(n, m-1),(n, m+1),(n-1, m)$, $(n+1, m)$, and $(n, m)$ is in $S$. How many elements are in the set obtained by successively transforming $\{(0,0)\} 14$ times? | 421 | 5.46875 |
3,442 | How many ways are there of using diagonals to divide a regular 6-sided polygon into triangles such that at least one side of each triangle is a side of the original polygon and that each vertex of each triangle is a vertex of the original polygon? | 12 | 7.03125 |
3,443 | Three points, $A, B$, and $C$, are selected independently and uniformly at random from the interior of a unit square. Compute the expected value of $\angle A B C$. | 60^{\circ} | 0 |
3,444 | The Antarctican language has an alphabet of just 16 letters. Interestingly, every word in the language has exactly 3 letters, and it is known that no word's first letter equals any word's last letter (for instance, if the alphabet were $\{a, b\}$ then $a a b$ and aaa could not both be words in the language because $a$ is the first letter of a word and the last letter of a word; in fact, just aaa alone couldn't be in the language). Given this, determine the maximum possible number of words in the language. | 1024 | 0 |
3,445 | A deck of 100 cards is labeled $1,2, \ldots, 100$ from top to bottom. The top two cards are drawn; one of them is discarded at random, and the other is inserted back at the bottom of the deck. This process is repeated until only one card remains in the deck. Compute the expected value of the label of the remaining card. | \frac{467}{8} | 0 |
3,446 | Find the number of 20-tuples of integers $x_{1}, \ldots, x_{10}, y_{1}, \ldots, y_{10}$ with the following properties: - $1 \leq x_{i} \leq 10$ and $1 \leq y_{i} \leq 10$ for each $i$; - $x_{i} \leq x_{i+1}$ for $i=1, \ldots, 9$; - if $x_{i}=x_{i+1}$, then $y_{i} \leq y_{i+1}$. | \binom{109}{10} | 0 |
3,447 | Two $4 \times 4$ squares are randomly placed on an $8 \times 8$ chessboard so that their sides lie along the grid lines of the board. What is the probability that the two squares overlap? | 529/625 | 1.5625 |
3,448 | Define the sequence $b_{0}, b_{1}, \ldots, b_{59}$ by $$ b_{i}= \begin{cases}1 & \text { if } \mathrm{i} \text { is a multiple of } 3 \\ 0 & \text { otherwise }\end{cases} $$ Let \left\{a_{i}\right\} be a sequence of elements of \{0,1\} such that $$ b_{n} \equiv a_{n-1}+a_{n}+a_{n+1} \quad(\bmod 2) $$ for $0 \leq n \leq 59\left(a_{0}=a_{60}\right.$ and $\left.a_{-1}=a_{59}\right)$. Find all possible values of $4 a_{0}+2 a_{1}+a_{2}$. | 0, 3, 5, 6 | 5.46875 |
3,449 | Let triangle $A B C$ have $A B=5, B C=6$, and $A C=7$, with circumcenter $O$. Extend ray $A B$ to point $D$ such that $B D=5$, and extend ray $B C$ to point $E$ such that $O D=O E$. Find $C E$. | \sqrt{59}-3 | 0 |
3,450 | Let $N$ denote the sum of the decimal digits of $\binom{1000}{100}$. Estimate the value of $N$. | 621 | 49.21875 |
3,451 | Let $P(x)$ be the monic polynomial with rational coefficients of minimal degree such that $\frac{1}{\sqrt{2}}$, $\frac{1}{\sqrt{3}}, \frac{1}{\sqrt{4}}, \ldots, \frac{1}{\sqrt{1000}}$ are roots of $P$. What is the sum of the coefficients of $P$? | \frac{1}{16000} | 0 |
3,452 | Suppose $a, b, c, d$ are real numbers such that $$|a-b|+|c-d|=99 ; \quad|a-c|+|b-d|=1$$ Determine all possible values of $|a-d|+|b-c|$. | 99 | 36.71875 |
3,453 | Find the least positive integer $N>1$ satisfying the following two properties: There exists a positive integer $a$ such that $N=a(2 a-1)$. The sum $1+2+\cdots+(N-1)$ is divisible by $k$ for every integer $1 \leq k \leq 10$. | 2016 | 13.28125 |
3,454 | How many sequences of 0s and 1s are there of length 10 such that there are no three 0s or 1s consecutively anywhere in the sequence? | 178 | 38.28125 |
3,455 | Points $P$ and $Q$ are 3 units apart. A circle centered at $P$ with a radius of $\sqrt{3}$ units intersects a circle centered at $Q$ with a radius of 3 units at points $A$ and $B$. Find the area of quadrilateral APBQ. | \frac{3 \sqrt{11}}{2} | 16.40625 |
3,456 | Let $N$ be a three-digit integer such that the difference between any two positive integer factors of $N$ is divisible by 3 . Let $d(N)$ denote the number of positive integers which divide $N$. Find the maximum possible value of $N \cdot d(N)$. | 5586 | 0 |
3,457 | Consider the two hands of an analog clock, each of which moves with constant angular velocity. Certain positions of these hands are possible (e.g. the hour hand halfway between the 5 and 6 and the minute hand exactly at the 6), while others are impossible (e.g. the hour hand exactly at the 5 and the minute hand exactly at the 6). How many different positions are there that would remain possible if the hour and minute hands were switched? | 143 | 0 |
3,458 | Points $X$ and $Y$ are inside a unit square. The score of a vertex of the square is the minimum distance from that vertex to $X$ or $Y$. What is the minimum possible sum of the scores of the vertices of the square? | \frac{\sqrt{6}+\sqrt{2}}{2} | 0 |
3,459 | Compute $$\sum_{n=1}^{\infty} \frac{2 n+5}{2^{n} \cdot\left(n^{3}+7 n^{2}+14 n+8\right)}$$ | \frac{137}{24}-8 \ln 2 | 0 |
3,460 | Call the pentominoes found in the last problem square pentominoes. Just like dominos and ominos can be used to tile regions of the plane, so can square pentominoes. In particular, a square pentomino tiling of a region of the plane is a way of covering it (and only it) completely by nonoverlapping square pentominoes. How many square pentomino tilings are there of a 12-by-12 rectangle? | 0 | 64.84375 |
3,461 | Let $S_{7}$ denote all the permutations of $1,2, \ldots, 7$. For any \pi \in S_{7}$, let $f(\pi)$ be the smallest positive integer $i$ such that \pi(1), \pi(2), \ldots, \pi(i)$ is a permutation of $1,2, \ldots, i$. Compute \sum_{\pi \in S_{7}} f(\pi)$. | 29093 | 89.84375 |
3,462 | Compute the prime factorization of 1007021035035021007001. | 7^{7} \cdot 11^{7} \cdot 13^{7} | 0 |
3,463 | A sequence $s_{0}, s_{1}, s_{2}, s_{3}, \ldots$ is defined by $s_{0}=s_{1}=1$ and, for every positive integer $n, s_{2 n}=s_{n}, s_{4 n+1}=s_{2 n+1}, s_{4 n-1}=s_{2 n-1}+s_{2 n-1}^{2} / s_{n-1}$. What is the value of $s_{1000}$? | 720 | 59.375 |
3,464 | Find the set consisting of all real values of $x$ such that the three numbers $2^{x}, 2^{x^{2}}, 2^{x^{3}}$ form a non-constant arithmetic progression (in that order). | \varnothing | 0 |
3,465 | Divide an $m$-by-$n$ rectangle into $m n$ nonoverlapping 1-by-1 squares. A polyomino of this rectangle is a subset of these unit squares such that for any two unit squares $S, T$ in the polyomino, either (1) $S$ and $T$ share an edge or (2) there exists a positive integer $n$ such that the polyomino contains unit squares $S_{1}, S_{2}, S_{3}, \ldots, S_{n}$ such that $S$ and $S_{1}$ share an edge, $S_{n}$ and $T$ share an edge, and for all positive integers $k<n, S_{k}$ and $S_{k+1}$ share an edge. We say a polyomino of a given rectangle spans the rectangle if for each of the four edges of the rectangle the polyomino contains a square whose edge lies on it. What is the minimum number of unit squares a polyomino can have if it spans a 128-by343 rectangle? | 470 | 54.6875 |
3,466 | The Dyslexian alphabet consists of consonants and vowels. It so happens that a finite sequence of letters is a word in Dyslexian precisely if it alternates between consonants and vowels (it may begin with either). There are 4800 five-letter words in Dyslexian. How many letters are in the alphabet? | 12 | 35.15625 |
3,467 | Let $P(x)=x^{3}+a x^{2}+b x+2015$ be a polynomial all of whose roots are integers. Given that $P(x) \geq 0$ for all $x \geq 0$, find the sum of all possible values of $P(-1)$. | 9496 | 0 |
3,468 | Over all pairs of complex numbers $(x, y)$ satisfying the equations $$x+2y^{2}=x^{4} \quad \text{and} \quad y+2x^{2}=y^{4}$$ compute the minimum possible real part of $x$. | \sqrt[3]{\frac{1-\sqrt{33}}{2}} | 0 |
3,469 | Define $\varphi^{k}(n)$ as the number of positive integers that are less than or equal to $n / k$ and relatively prime to $n$. Find $\phi^{2001}\left(2002^{2}-1\right)$. (Hint: $\phi(2003)=2002$.) | 1233 | 1.5625 |
3,470 | Let $\ell$ and $m$ be two non-coplanar lines in space, and let $P_{1}$ be a point on $\ell$. Let $P_{2}$ be the point on $m$ closest to $P_{1}, P_{3}$ be the point on $\ell$ closest to $P_{2}, P_{4}$ be the point on $m$ closest to $P_{3}$, and $P_{5}$ be the point on $\ell$ closest to $P_{4}$. Given that $P_{1} P_{2}=5, P_{2} P_{3}=3$, and $P_{3} P_{4}=2$, compute $P_{4} P_{5}$. | \frac{\sqrt{39}}{4} | 0 |
3,471 | Compute the decimal expansion of \sqrt{\pi}$. Your score will be \min (23, k)$, where $k$ is the number of consecutive correct digits immediately following the decimal point in your answer. | 1.77245385090551602729816 \ldots | 0 |
3,472 | How many real solutions are there to the equation $|||| x|-2|-2|-2|=|||| x|-3|-3|-3|$? | 6 | 2.34375 |
3,473 | Bob Barker went back to school for a PhD in math, and decided to raise the intellectual level of The Price is Right by having contestants guess how many objects exist of a certain type, without going over. The number of points you will get is the percentage of the correct answer, divided by 10, with no points for going over (i.e. a maximum of 10 points). Let's see the first object for our contestants...a table of shape (5,4,3,2,1) is an arrangement of the integers 1 through 15 with five numbers in the top row, four in the next, three in the next, two in the next, and one in the last, such that each row and each column is increasing (from left to right, and top to bottom, respectively). For instance: \begin{tabular}{lcccc} 1 & 2 & 3 & 4 & 5 \\ 6 & 7 & 8 & 9 & \\ 10 & 11 & 12 & & \\ 13 & 14 & & & \\ 15 & & & & \end{tabular} is one table. How many tables are there? | 292864 | 0 |
3,474 | Find all numbers $n$ with the following property: there is exactly one set of 8 different positive integers whose sum is $n$. | 36, 37 | 1.5625 |
3,475 | Points $A, B, C$ in the plane satisfy $\overline{A B}=2002, \overline{A C}=9999$. The circles with diameters $A B$ and $A C$ intersect at $A$ and $D$. If $\overline{A D}=37$, what is the shortest distance from point $A$ to line $B C$? | 37 | 63.28125 |
3,476 | A $5 \times 5$ square grid has the number -3 written in the upper-left square and the number 3 written in the lower-right square. In how many ways can the remaining squares be filled in with integers so that any two adjacent numbers differ by 1, where two squares are adjacent if they share a common edge (but not if they share only a corner)? | 250 | 0 |
3,477 | Cyclic quadrilateral $A B C D$ has side lengths $A B=1, B C=2, C D=3$ and $D A=4$. Points $P$ and $Q$ are the midpoints of $\overline{B C}$ and $\overline{D A}$. Compute $P Q^{2}$. | \frac{116}{35} | 1.5625 |
3,478 | The unknown real numbers $x, y, z$ satisfy the equations $$\frac{x+y}{1+z}=\frac{1-z+z^{2}}{x^{2}-x y+y^{2}} ; \quad \frac{x-y}{3-z}=\frac{9+3 z+z^{2}}{x^{2}+x y+y^{2}}$$ Find $x$. | \sqrt[3]{14} | 21.875 |
3,479 | Suppose $x$ and $y$ are real numbers such that $-1<x<y<1$. Let $G$ be the sum of the geometric series whose first term is $x$ and whose ratio is $y$, and let $G^{\prime}$ be the sum of the geometric series whose first term is $y$ and ratio is $x$. If $G=G^{\prime}$, find $x+y$. | 1 | 88.28125 |
3,480 | How many pairs of integers $(a, b)$, with $1 \leq a \leq b \leq 60$, have the property that $b$ is divisible by $a$ and $b+1$ is divisible by $a+1$? | 106 | 0 |
3,481 | Tessa has a figure created by adding a semicircle of radius 1 on each side of an equilateral triangle with side length 2, with semicircles oriented outwards. She then marks two points on the boundary of the figure. What is the greatest possible distance between the two points? | 3 | 0 |
3,482 | $A B C$ is a triangle with points $E, F$ on sides $A C, A B$, respectively. Suppose that $B E, C F$ intersect at $X$. It is given that $A F / F B=(A E / E C)^{2}$ and that $X$ is the midpoint of $B E$. Find the ratio $C X / X F$. | \sqrt{5} | 0 |
3,483 | Let $A B C$ be an equilateral triangle with side length 1. Points $D, E, F$ lie inside triangle $A B C$ such that $A, E, F$ are collinear, $B, F, D$ are collinear, $C, D, E$ are collinear, and triangle $D E F$ is equilateral. Suppose that there exists a unique equilateral triangle $X Y Z$ with $X$ on side $\overline{B C}, Y$ on side $\overline{A B}$, and $Z$ on side $\overline{A C}$ such that $D$ lies on side $\overline{X Z}, E$ lies on side $\overline{Y Z}$, and $F$ lies on side $\overline{X Y}$. Compute $A Z$. | \frac{1}{1+\sqrt[3]{2}} | 0 |
3,484 | The real function $f$ has the property that, whenever $a, b, n$ are positive integers such that $a+b=2^{n}$, the equation $f(a)+f(b)=n^{2}$ holds. What is $f(2002)$? | 96 | 42.1875 |
3,485 | Jarris is a weighted tetrahedral die with faces $F_{1}, F_{2}, F_{3}, F_{4}$. He tosses himself onto a table, so that the probability he lands on a given face is proportional to the area of that face. Let $k$ be the maximum distance any part of Jarris is from the table after he rolls himself. Given that Jarris has an inscribed sphere of radius 3 and circumscribed sphere of radius 10, find the minimum possible value of the expected value of $k$. | 12 | 0 |
3,486 | Find the volume of the three-dimensional solid given by the inequality $\sqrt{x^{2}+y^{2}}+$ $|z| \leq 1$. | 2 \pi / 3 | 0 |
3,487 | Count how many 8-digit numbers there are that contain exactly four nines as digits. | 433755 | 0 |
3,488 | Find the smallest positive integer $k$ such that $z^{10}+z^{9}+z^{6}+z^{5}+z^{4}+z+1$ divides $z^{k}-1$. | 84 | 50.78125 |
3,489 | Let $$\begin{aligned} & A=(1+2 \sqrt{2}+3 \sqrt{3}+6 \sqrt{6})(2+6 \sqrt{2}+\sqrt{3}+3 \sqrt{6})(3+\sqrt{2}+6 \sqrt{3}+2 \sqrt{6})(6+3 \sqrt{2}+2 \sqrt{3}+\sqrt{6}) \\ & B=(1+3 \sqrt{2}+2 \sqrt{3}+6 \sqrt{6})(2+\sqrt{2}+6 \sqrt{3}+3 \sqrt{6})(3+6 \sqrt{2}+\sqrt{3}+2 \sqrt{6})(6+2 \sqrt{2}+3 \sqrt{3}+\sqrt{6}) \end{aligned}$$ Compute the value of $A / B$. | 1 | 96.09375 |
3,490 | Two circles have radii 13 and 30, and their centers are 41 units apart. The line through the centers of the two circles intersects the smaller circle at two points; let $A$ be the one outside the larger circle. Suppose $B$ is a point on the smaller circle and $C$ a point on the larger circle such that $B$ is the midpoint of $A C$. Compute the distance $A C$. | 12 \sqrt{13} | 0 |
3,491 | The expression $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$. Find the value of $$\left\lfloor\frac{2002!}{2001!+2000!+1999!+\cdots+1!}\right\rfloor.$$ | 2000 | 18.75 |
3,492 | Call a positive integer $n$ weird if $n$ does not divide $(n-2)$!. Determine the number of weird numbers between 2 and 100 inclusive. | 26 | 7.8125 |
3,493 | In the $x-y$ plane, draw a circle of radius 2 centered at $(0,0)$. Color the circle red above the line $y=1$, color the circle blue below the line $y=-1$, and color the rest of the circle white. Now consider an arbitrary straight line at distance 1 from the circle. We color each point $P$ of the line with the color of the closest point to $P$ on the circle. If we pick such an arbitrary line, randomly oriented, what is the probability that it contains red, white, and blue points? | \frac{2}{3} | 3.90625 |
3,494 | Call a positive integer 'mild' if its base-3 representation never contains the digit 2. How many values of $n(1 \leq n \leq 1000)$ have the property that $n$ and $n^{2}$ are both mild? | 7 | 0 |
3,495 | A regular decagon $A_{0} A_{1} A_{2} \cdots A_{9}$ is given in the plane. Compute $\angle A_{0} A_{3} A_{7}$ in degrees. | 54^{\circ} | 12.5 |
3,496 | The sequence $\left(z_{n}\right)$ of complex numbers satisfies the following properties: $z_{1}$ and $z_{2}$ are not real. $z_{n+2}=z_{n+1}^{2} z_{n}$ for all integers $n \geq 1$. $\frac{z_{n+3}}{z_{n}^{2}}$ is real for all integers $n \geq 1$. $\left|\frac{z_{3}}{z_{4}}\right|=\left|\frac{z_{4}}{z_{5}}\right|=2$ Find the product of all possible values of $z_{1}$. | 65536 | 0 |
3,497 | Knot is on an epic quest to save the land of Hyruler from the evil Gammadorf. To do this, he must collect the two pieces of the Lineforce, then go to the Temple of Lime. As shown on the figure, Knot starts on point $K$, and must travel to point $T$, where $O K=2$ and $O T=4$. However, he must first reach both solid lines in the figure below to collect the pieces of the Lineforce. What is the minimal distance Knot must travel to do so? | 2 \sqrt{5} | 6.25 |
3,498 | A conical flask contains some water. When the flask is oriented so that its base is horizontal and lies at the bottom (so that the vertex is at the top), the water is 1 inch deep. When the flask is turned upside-down, so that the vertex is at the bottom, the water is 2 inches deep. What is the height of the cone? | \frac{1}{2}+\frac{\sqrt{93}}{6} | 0 |
3,499 | Let $A B C$ be a triangle with $A B=6, A C=7, B C=8$. Let $I$ be the incenter of $A B C$. Points $Z$ and $Y$ lie on the interior of segments $A B$ and $A C$ respectively such that $Y Z$ is tangent to the incircle. Given point $P$ such that $$\angle Z P C=\angle Y P B=90^{\circ}$$ find the length of $I P$. | \frac{\sqrt{30}}{2} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.