Unnamed: 0
int64 0
40.3k
| problem
stringlengths 10
5.15k
| ground_truth
stringlengths 1
1.22k
| solved_percentage
float64 0
100
|
|---|---|---|---|
4,000 | You have six blocks in a row, labeled 1 through 6, each with weight 1. Call two blocks $x \leq y$ connected when, for all $x \leq z \leq y$, block $z$ has not been removed. While there is still at least one block remaining, you choose a remaining block uniformly at random and remove it. The cost of this operation is the sum of the weights of the blocks that are connected to the block being removed, including itself. Compute the expected total cost of removing all the blocks. | \frac{163}{10} | 0 |
4,001 | We can view these conditions as a geometry diagram as seen below. So, we know that $\frac{e}{f}=\frac{3}{4}$ (since $e=a-b=\frac{3}{4} c-\frac{3}{4} d=\frac{3}{4} f$ and we know that $\sqrt{e^{2}+f^{2}}=15$ (since this is $\left.\sqrt{a^{2}+c^{2}}-\sqrt{b^{2}+d^{2}}\right)$. Also, note that $a c+b d-a d-b c=(a-b)(c-d)=e f$. So, solving for $e$ and $f$, we find that $e^{2}+f^{2}=225$, so $16 e^{2}+16 f^{2}=3600$, so $(4 e)^{2}+(4 f)^{2}=3600$, so $(3 f)^{2}+(4 f)^{2}=3600$, so $f^{2}\left(3^{2}+4^{2}\right)=3600$, so $25 f^{2}=3600$, so $f^{2}=144$ and $f=12$. Thus, $e=\frac{3}{4} 12=9$. Therefore, \boldsymbol{e f}=\mathbf{9} * \mathbf{1 2}=\mathbf{1 0 8}$. | 108 | 77.34375 |
4,002 | Suppose that there are 16 variables $\left\{a_{i, j}\right\}_{0 \leq i, j \leq 3}$, each of which may be 0 or 1 . For how many settings of the variables $a_{i, j}$ do there exist positive reals $c_{i, j}$ such that the polynomial $$f(x, y)=\sum_{0 \leq i, j \leq 3} a_{i, j} c_{i, j} x^{i} y^{j}$$ $(x, y \in \mathbb{R})$ is bounded below? | 126 | 0 |
4,003 | Kelvin the Frog was bored in math class one day, so he wrote all ordered triples $(a, b, c)$ of positive integers such that $a b c=2310$ on a sheet of paper. Find the sum of all the integers he wrote down. In other words, compute $$\sum_{\substack{a b c=2310 \\ a, b, c \in \mathbb{N}}}(a+b+c)$$ where $\mathbb{N}$ denotes the positive integers. | 49140 | 16.40625 |
4,004 | How many orderings $(a_{1}, \ldots, a_{8})$ of $(1,2, \ldots, 8)$ exist such that $a_{1}-a_{2}+a_{3}-a_{4}+a_{5}-a_{6}+a_{7}-a_{8}=0$ ? | 4608 | 97.65625 |
4,005 | The polynomial \( f(x)=x^{2007}+17 x^{2006}+1 \) has distinct zeroes \( r_{1}, \ldots, r_{2007} \). A polynomial \( P \) of degree 2007 has the property that \( P\left(r_{j}+\frac{1}{r_{j}}\right)=0 \) for \( j=1, \ldots, 2007 \). Determine the value of \( P(1) / P(-1) \). | 289/259 | 0 |
4,006 | You are trapped in a room with only one exit, a long hallway with a series of doors and land mines. To get out you must open all the doors and disarm all the mines. In the room is a panel with 3 buttons, which conveniently contains an instruction manual. The red button arms a mine, the yellow button disarms two mines and closes a door, and the green button opens two doors. Initially 3 doors are closed and 3 mines are armed. The manual warns that attempting to disarm two mines or open two doors when only one is armed/closed will reset the system to its initial state. What is the minimum number of buttons you must push to get out? | 9 | 3.125 |
4,007 | Compute \( \frac{2^{3}-1}{2^{3}+1} \cdot \frac{3^{3}-1}{3^{3}+1} \cdot \frac{4^{3}-1}{4^{3}+1} \cdot \frac{5^{3}-1}{5^{3}+1} \cdot \frac{6^{3}-1}{6^{3}+1} \). | 43/63 | 28.90625 |
4,008 | Suppose $(a_{1}, a_{2}, a_{3}, a_{4})$ is a 4-term sequence of real numbers satisfying the following two conditions: - $a_{3}=a_{2}+a_{1}$ and $a_{4}=a_{3}+a_{2}$ - there exist real numbers $a, b, c$ such that $a n^{2}+b n+c=\cos \left(a_{n}\right)$ for all $n \in\{1,2,3,4\}$. Compute the maximum possible value of $\cos \left(a_{1}\right)-\cos \left(a_{4}\right)$ over all such sequences $(a_{1}, a_{2}, a_{3}, a_{4})$. | -9+3\sqrt{13} | 0 |
4,009 | Let $a, b, c, x, y$, and $z$ be complex numbers such that $a=\frac{b+c}{x-2}, \quad b=\frac{c+a}{y-2}, \quad c=\frac{a+b}{z-2}$. If $x y+y z+z x=67$ and $x+y+z=2010$, find the value of $x y z$. | -5892 | 2.34375 |
4,010 | Suppose $x$ is a real number such that $\sin \left(1+\cos ^{2} x+\sin ^{4} x\right)=\frac{13}{14}$. Compute $\cos \left(1+\sin ^{2} x+\cos ^{4} x\right)$. | -\frac{3 \sqrt{3}}{14} | 5.46875 |
4,011 | Let $a \neq b$ be positive real numbers and $m, n$ be positive integers. An $m+n$-gon $P$ has the property that $m$ sides have length $a$ and $n$ sides have length $b$. Further suppose that $P$ can be inscribed in a circle of radius $a+b$. Compute the number of ordered pairs $(m, n)$, with $m, n \leq 100$, for which such a polygon $P$ exists for some distinct values of $a$ and $b$. | 940 | 0.78125 |
4,012 | How many times does 24 divide into 100! (factorial)? | 32 | 81.25 |
4,013 | Given that 7,999,999,999 has at most two prime factors, find its largest prime factor. | 4,002,001 | 0 |
4,014 | In a $16 \times 16$ table of integers, each row and column contains at most 4 distinct integers. What is the maximum number of distinct integers that there can be in the whole table? | 49 | 0 |
4,015 | Evaluate the infinite sum $\sum_{n=0}^{\infty}\binom{2 n}{n} \frac{1}{5^{n}}$. | \sqrt{5} | 75 |
4,016 | A light pulse starts at a corner of a reflective square. It bounces around inside the square, reflecting off of the square's perimeter $n$ times before ending in a different corner. The path of the light pulse, when traced, divides the square into exactly 2021 regions. Compute the smallest possible value of $n$. | 129 | 0 |
4,017 | You are given a $10 \times 2$ grid of unit squares. Two different squares are adjacent if they share a side. How many ways can one mark exactly nine of the squares so that no two marked squares are adjacent? | 36 | 1.5625 |
4,018 | Suppose that $m$ and $n$ are positive integers with $m<n$ such that the interval $[m, n)$ contains more multiples of 2021 than multiples of 2000. Compute the maximum possible value of $n-m$. | 191999 | 0 |
4,019 | Diana is playing a card game against a computer. She starts with a deck consisting of a single card labeled 0.9. Each turn, Diana draws a random card from her deck, while the computer generates a card with a random real number drawn uniformly from the interval $[0,1]$. If the number on Diana's card is larger, she keeps her current card and also adds the computer's card to her deck. Otherwise, the computer takes Diana's card. After $k$ turns, Diana's deck is empty. Compute the expected value of $k$. | 100 | 0 |
4,020 | Define $\phi^{!}(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the number of integers $2 \leq n \leq 50$ such that $n$ divides $\phi^{!}(n)+1$. | 30 | 92.96875 |
4,021 | A positive integer $n$ is loose if it has six positive divisors and satisfies the property that any two positive divisors $a<b$ of $n$ satisfy $b \geq 2 a$. Compute the sum of all loose positive integers less than 100. | 512 | 0 |
4,022 | $p$ and $q$ are primes such that the numbers $p+q$ and $p+7 q$ are both squares. Find the value of $p$. | 2 | 53.125 |
4,023 | Let $A B C$ be an acute triangle with $A$-excircle $\Gamma$. Let the line through $A$ perpendicular to $B C$ intersect $B C$ at $D$ and intersect $\Gamma$ at $E$ and $F$. Suppose that $A D=D E=E F$. If the maximum value of $\sin B$ can be expressed as $\frac{\sqrt{a}+\sqrt{b}}{c}$ for positive integers $a, b$, and $c$, compute the minimum possible value of $a+b+c$. | 705 | 0 |
4,024 | A set of six edges of a regular octahedron is called Hamiltonian cycle if the edges in some order constitute a single continuous loop that visits each vertex exactly once. How many ways are there to partition the twelve edges into two Hamiltonian cycles? | 6 | 0.78125 |
4,025 | For a real number $x$, let $[x]$ be $x$ rounded to the nearest integer and $\langle x\rangle$ be $x$ rounded to the nearest tenth. Real numbers $a$ and $b$ satisfy $\langle a\rangle+[b]=98.6$ and $[a]+\langle b\rangle=99.3$. Compute the minimum possible value of $[10(a+b)]$. | 988 | 2.34375 |
4,026 | For positive integers $a$ and $b$, let $M(a, b)=\frac{\operatorname{lcm}(a, b)}{\operatorname{gcd}(a, b)}$, and for each positive integer $n \geq 2$, define $$x_{n}=M(1, M(2, M(3, \ldots, M(n-2, M(n-1, n)) \ldots)))$$ Compute the number of positive integers $n$ such that $2 \leq n \leq 2021$ and $5 x_{n}^{2}+5 x_{n+1}^{2}=26 x_{n} x_{n+1}$. | 20 | 0 |
4,027 | Find the largest number $n$ such that $(2004!)!$ is divisible by $((n!)!)!$. | 6 | 89.0625 |
4,028 | In the Cartesian plane, let $A=(0,0), B=(200,100)$, and $C=(30,330)$. Compute the number of ordered pairs $(x, y)$ of integers so that $\left(x+\frac{1}{2}, y+\frac{1}{2}\right)$ is in the interior of triangle $A B C$. | 31480 | 0 |
4,029 | Compute the number of ordered pairs of integers $(a, b)$, with $2 \leq a, b \leq 2021$, that satisfy the equation $$a^{\log _{b}\left(a^{-4}\right)}=b^{\log _{a}\left(b a^{-3}\right)}.$$ | 43 | 28.90625 |
4,030 | The function $f(x)$ is of the form $a x^{2}+b x+c$ for some integers $a, b$, and $c$. Given that $\{f(177883), f(348710), f(796921), f(858522)\} = \{1324754875645,1782225466694,1984194627862,4388794883485\}$ compute $a$. | 23 | 0 |
4,031 | Regular polygons $I C A O, V E N T I$, and $A L B E D O$ lie on a plane. Given that $I N=1$, compute the number of possible values of $O N$. | 2 | 3.90625 |
4,032 | Compute the nearest integer to $$100 \sum_{n=1}^{\infty} 3^{n} \sin ^{3}\left(\frac{\pi}{3^{n}}\right)$$ | 236 | 7.03125 |
4,033 | Suppose that there exist nonzero complex numbers $a, b, c$, and $d$ such that $k$ is a root of both the equations $a x^{3}+b x^{2}+c x+d=0$ and $b x^{3}+c x^{2}+d x+a=0$. Find all possible values of $k$ (including complex values). | 1,-1, i,-i | 56.25 |
4,034 | Compute the number of positive real numbers $x$ that satisfy $\left(3 \cdot 2^{\left\lfloor\log _{2} x\right\rfloor}-x\right)^{16}=2022 x^{13}$. | 9 | 0 |
4,035 | Let $x_{1}=y_{1}=x_{2}=y_{2}=1$, then for $n \geq 3$ let $x_{n}=x_{n-1} y_{n-2}+x_{n-2} y_{n-1}$ and $y_{n}=y_{n-1} y_{n-2}- x_{n-1} x_{n-2}$. What are the last two digits of $\left|x_{2012}\right|$ ? | 84 | 0 |
4,036 | Suppose that $P(x, y, z)$ is a homogeneous degree 4 polynomial in three variables such that $P(a, b, c)=P(b, c, a)$ and $P(a, a, b)=0$ for all real $a, b$, and $c$. If $P(1,2,3)=1$, compute $P(2,4,8)$. | 56 | 9.375 |
4,037 | Let $z_{1}, z_{2}, z_{3}, z_{4}$ be the solutions to the equation $x^{4}+3 x^{3}+3 x^{2}+3 x+1=0$. Then $\left|z_{1}\right|+\left|z_{2}\right|+\left|z_{3}\right|+\left|z_{4}\right|$ can be written as $\frac{a+b \sqrt{c}}{d}$, where $c$ is a square-free positive integer, and $a, b, d$ are positive integers with $\operatorname{gcd}(a, b, d)=1$. Compute $1000 a+100 b+10 c+d$. | 7152 | 0 |
4,038 | Consider the polynomial \( P(x)=x^{3}+x^{2}-x+2 \). Determine all real numbers \( r \) for which there exists a complex number \( z \) not in the reals such that \( P(z)=r \). | r>3, r<49/27 | 0 |
4,039 | Compute $\sum_{k=1}^{2009} k\left(\left\lfloor\frac{2009}{k}\right\rfloor-\left\lfloor\frac{2008}{k}\right\rfloor\right)$. | 2394 | 73.4375 |
4,040 | $\mathbf{7 3 8 , 8 2 6}$. This can be arrived at by stepping down, starting with finding how many combinations are there that begin with a letter other than V or W , and so forth. The answer is $\frac{8 \cdot 9!}{2 \cdot 2}+\frac{4 \cdot 7!}{2}+4 \cdot 6!+4 \cdot 4!+3!+2!+2!=738826$. | 738826 | 14.84375 |
4,041 | In a classroom, 34 students are seated in 5 rows of 7 chairs. The place at the center of the room is unoccupied. A teacher decides to reassign the seats such that each student will occupy a chair adjacent to his/her present one (i.e. move one desk forward, back, left or right). In how many ways can this reassignment be made? | 0 | 4.6875 |
4,042 | A regular dodecagon $P_{1} P_{2} \cdots P_{12}$ is inscribed in a unit circle with center $O$. Let $X$ be the intersection of $P_{1} P_{5}$ and $O P_{2}$, and let $Y$ be the intersection of $P_{1} P_{5}$ and $O P_{4}$. Let $A$ be the area of the region bounded by $X Y, X P_{2}, Y P_{4}$, and minor arc $\widehat{P_{2} P_{4}}$. Compute $\lfloor 120 A\rfloor$. | 45 | 0.78125 |
4,043 | Find all real solutions to $x^{4}+(2-x)^{4}=34$. | 1 \pm \sqrt{2} | 0 |
4,044 | Starting with an empty string, we create a string by repeatedly appending one of the letters $H, M, T$ with probabilities $\frac{1}{4}, \frac{1}{2}, \frac{1}{4}$, respectively, until the letter $M$ appears twice consecutively. What is the expected value of the length of the resulting string? | 6 | 38.28125 |
4,045 | Carl and Bob can demolish a building in 6 days, Anne and Bob can do it in 3, Anne and Carl in 5. How many days does it take all of them working together if Carl gets injured at the end of the first day and can't come back? Express your answer as a fraction in lowest terms. | \frac{59}{20} | 46.09375 |
4,046 | Evaluate $$\sin \left(1998^{\circ}+237^{\circ}\right) \sin \left(1998^{\circ}-1653^{\circ}\right)$$ | -\frac{1}{4} | 33.59375 |
4,047 | During the weekends, Eli delivers milk in the complex plane. On Saturday, he begins at $z$ and delivers milk to houses located at $z^{3}, z^{5}, z^{7}, \ldots, z^{2013}$, in that order; on Sunday, he begins at 1 and delivers milk to houses located at $z^{2}, z^{4}, z^{6}, \ldots, z^{2012}$, in that order. Eli always walks directly (in a straight line) between two houses. If the distance he must travel from his starting point to the last house is $\sqrt{2012}$ on both days, find the real part of $z^{2}$. | \frac{1005}{1006} | 0 |
4,048 | We wish to color the integers $1,2,3, \ldots, 10$ in red, green, and blue, so that no two numbers $a$ and $b$, with $a-b$ odd, have the same color. (We do not require that all three colors be used.) In how many ways can this be done? | 186 | 0 |
4,049 | Shelly writes down a vector $v=(a, b, c, d)$, where $0<a<b<c<d$ are integers. Let $\sigma(v)$ denote the set of 24 vectors whose coordinates are $a, b, c$, and $d$ in some order. For instance, $\sigma(v)$ contains $(b, c, d, a)$. Shelly notes that there are 3 vectors in $\sigma(v)$ whose sum is of the form $(s, s, s, s)$ for some $s$. What is the smallest possible value of $d$? | 6 | 17.1875 |
4,050 | Given that $a, b$, and $c$ are complex numbers satisfying $$\begin{aligned} a^{2}+a b+b^{2} & =1+i \\ b^{2}+b c+c^{2} & =-2 \\ c^{2}+c a+a^{2} & =1 \end{aligned}$$ compute $(a b+b c+c a)^{2}$. (Here, $\left.i=\sqrt{-1}.\right)$ | \frac{-11-4 i}{3} | 0 |
4,051 | Compute the number of positive integers that divide at least two of the integers in the set $\{1^{1}, 2^{2}, 3^{3}, 4^{4}, 5^{5}, 6^{6}, 7^{7}, 8^{8}, 9^{9}, 10^{10}\}$. | 22 | 41.40625 |
4,052 | Euler's Bridge: The following figure is the graph of the city of Konigsburg in 1736 - vertices represent sections of the cities, edges are bridges. An Eulerian path through the graph is a path which moves from vertex to vertex, crossing each edge exactly once. How many ways could World War II bombers have knocked out some of the bridges of Konigsburg such that the Allied victory parade could trace an Eulerian path through the graph? (The order in which the bridges are destroyed matters.) | 13023 | 0 |
4,053 | In a certain country, there are 100 senators, each of whom has 4 aides. These senators and aides serve on various committees. A committee may consist either of 5 senators, of 4 senators and 4 aides, or of 2 senators and 12 aides. Every senator serves on 5 committees, and every aide serves on 3 committees. How many committees are there altogether? | 160 | 30.46875 |
4,054 | Find the sum of the infinite series $$1+2\left(\frac{1}{1998}\right)+3\left(\frac{1}{1998}\right)^{2}+4\left(\frac{1}{1998}\right)^{3}+\ldots$$ | \left(\frac{1998}{1997}\right)^{2} \text{ or } \frac{3992004}{3988009} | 0 |
4,055 | Given any two positive real numbers $x$ and $y$, then $x \diamond y$ is a positive real number defined in terms of $x$ and $y$ by some fixed rule. Suppose the operation $x \diamond y$ satisfies the equations \((x \cdot y) \diamond y=x(y \diamond y)\) and \((x \diamond 1) \diamond x=x \diamond 1\) for all $x, y>0$. Given that $1 \diamond 1=1$, find $19 \diamond 98$. | 19 | 53.90625 |
4,056 | Compute: $$\left\lfloor\frac{2005^{3}}{2003 \cdot 2004}-\frac{2003^{3}}{2004 \cdot 2005}\right\rfloor$$ | 8 | 95.3125 |
4,057 | Compute the sum of all 2-digit prime numbers $p$ such that there exists a prime number $q$ for which $100 q+p$ is a perfect square. | 179 | 97.65625 |
4,058 | Let $\left(x_{1}, y_{1}\right), \ldots,\left(x_{k}, y_{k}\right)$ be the distinct real solutions to the equation $$\left(x^{2}+y^{2}\right)^{6}=\left(x^{2}-y^{2}\right)^{4}=\left(2 x^{3}-6 x y^{2}\right)^{3}$$ Then $\sum_{i=1}^{k}\left(x_{i}+y_{i}\right)$ can be expressed as $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Compute $100 a+b$. | 516 | 0 |
4,059 | Define the sequence $\{x_{i}\}_{i \geq 0}$ by $x_{0}=2009$ and $x_{n}=-\frac{2009}{n} \sum_{k=0}^{n-1} x_{k}$ for all $n \geq 1$. Compute the value of $\sum_{n=0}^{2009} 2^{n} x_{n}$ | 2009 | 32.8125 |
4,060 | How many ways are there to cover a $3 \times 8$ rectangle with 12 identical dominoes? | 153 | 1.5625 |
4,061 | You have infinitely many boxes, and you randomly put 3 balls into them. The boxes are labeled $1,2, \ldots$. Each ball has probability $1 / 2^{n}$ of being put into box $n$. The balls are placed independently of each other. What is the probability that some box will contain at least 2 balls? | 5 / 7 | 0 |
4,062 | The train schedule in Hummut is hopelessly unreliable. Train A will enter Intersection X from the west at a random time between 9:00 am and 2:30 pm; each moment in that interval is equally likely. Train B will enter the same intersection from the north at a random time between 9:30 am and 12:30 pm, independent of Train A; again, each moment in the interval is equally likely. If each train takes 45 minutes to clear the intersection, what is the probability of a collision today? | \frac{13}{48} | 0.78125 |
4,063 | Let $n$ be a positive integer. A pair of $n$-tuples \left(a_{1}, \ldots, a_{n}\right)$ and \left(b_{1}, \ldots, b_{n}\right)$ with integer entries is called an exquisite pair if $$\left|a_{1} b_{1}+\cdots+a_{n} b_{n}\right| \leq 1$$ Determine the maximum number of distinct $n$-tuples with integer entries such that any two of them form an exquisite pair. | n^{2}+n+1 | 0 |
4,064 | If $n$ is a positive integer such that $n^{3}+2 n^{2}+9 n+8$ is the cube of an integer, find $n$. | 7 | 60.9375 |
4,065 | How many values of $x,-19<x<98$, satisfy $$\cos ^{2} x+2 \sin ^{2} x=1 ?$$ | 38 | 50 |
4,066 | How many ways are there to win tic-tac-toe in $\mathbb{R}^{n}$? (That is, how many lines pass through three of the lattice points $(a_{1}, \ldots, a_{n})$ in $\mathbb{R}^{n}$ with each coordinate $a_{i}$ in $\{1,2,3\}$? Express your answer in terms of $n$. | \left(5^{n}-3^{n}\right) / 2 | 0 |
4,067 | Find all ordered triples $(a, b, c)$ of positive reals that satisfy: $\lfloor a\rfloor b c=3, a\lfloor b\rfloor c=4$, and $a b\lfloor c\rfloor=5$, where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$. | \left(\frac{\sqrt{30}}{3}, \frac{\sqrt{30}}{4}, \frac{2 \sqrt{30}}{5}\right),\left(\frac{\sqrt{30}}{3}, \frac{\sqrt{30}}{2}, \frac{\sqrt{30}}{5}\right) | 0 |
4,068 | Among all polynomials $P(x)$ with integer coefficients for which $P(-10)=145$ and $P(9)=164$, compute the smallest possible value of $|P(0)|$. | 25 | 34.375 |
4,069 | Let $A_{1}, A_{2}, A_{3}$ be three points in the plane, and for convenience, let $A_{4}=A_{1}, A_{5}=A_{2}$. For $n=1,2$, and 3, suppose that $B_{n}$ is the midpoint of $A_{n} A_{n+1}$, and suppose that $C_{n}$ is the midpoint of $A_{n} B_{n}$. Suppose that $A_{n} C_{n+1}$ and $B_{n} A_{n+2}$ meet at $D_{n}$, and that $A_{n} B_{n+1}$ and $C_{n} A_{n+2}$ meet at $E_{n}$. Calculate the ratio of the area of triangle $D_{1} D_{2} D_{3}$ to the area of triangle $E_{1} E_{2} E_{3}$. | \frac{25}{49} | 2.34375 |
4,070 | How many ways are there to insert +'s between the digits of 111111111111111 (fifteen 1's) so that the result will be a multiple of 30? | 2002 | 0.78125 |
4,071 | An infinite sequence of real numbers $a_{1}, a_{2}, \ldots$ satisfies the recurrence $$a_{n+3}=a_{n+2}-2 a_{n+1}+a_{n}$$ for every positive integer $n$. Given that $a_{1}=a_{3}=1$ and $a_{98}=a_{99}$, compute $a_{1}+a_{2}+\cdots+a_{100}$. | 3 | 0 |
4,072 | How many ordered quadruples $(a, b, c, d)$ of four distinct numbers chosen from the set $\{1,2,3, \ldots, 9\}$ satisfy $b<a, b<c$, and $d<c$? | 630 | 35.9375 |
4,073 | A sequence of real numbers $a_{0}, a_{1}, \ldots$ is said to be good if the following three conditions hold. (i) The value of $a_{0}$ is a positive integer. (ii) For each non-negative integer $i$ we have $a_{i+1}=2 a_{i}+1$ or $a_{i+1}=\frac{a_{i}}{a_{i}+2}$. (iii) There exists a positive integer $k$ such that $a_{k}=2014$. Find the smallest positive integer $n$ such that there exists a good sequence $a_{0}, a_{1}, \ldots$ of real numbers with the property that $a_{n}=2014$. | 60 | 0 |
4,074 | How many real triples $(a, b, c)$ are there such that the polynomial $p(x)=x^{4}+a x^{3}+b x^{2}+a x+c$ has exactly three distinct roots, which are equal to $\tan y, \tan 2 y$, and $\tan 3 y$ for some real $y$ ? | 18 | 0 |
4,075 | There are 2008 distinct points on a circle. If you connect two of these points to form a line and then connect another two points (distinct from the first two) to form another line, what is the probability that the two lines intersect inside the circle? | 1/3 | 47.65625 |
4,076 | Find all positive integers $k<202$ for which there exists a positive integer $n$ such that $$\left\{\frac{n}{202}\right\}+\left\{\frac{2 n}{202}\right\}+\cdots+\left\{\frac{k n}{202}\right\}=\frac{k}{2}$$ where $\{x\}$ denote the fractional part of $x$. | k \in\{1,100,101,201\} | 0 |
4,077 | Daniel and Scott are playing a game where a player wins as soon as he has two points more than his opponent. Both players start at par, and points are earned one at a time. If Daniel has a $60 \%$ chance of winning each point, what is the probability that he will win the game? | 9 / 13 | 45.3125 |
4,078 | Find the unique pair of positive integers $(a, b)$ with $a<b$ for which $$\frac{2020-a}{a} \cdot \frac{2020-b}{b}=2$$ | (505,1212) | 0 |
4,079 | Let $n$ be the product of the first 10 primes, and let $$S=\sum_{x y \mid n} \varphi(x) \cdot y$$ where $\varphi(x)$ denotes the number of positive integers less than or equal to $x$ that are relatively prime to $x$, and the sum is taken over ordered pairs $(x, y)$ of positive integers for which $x y$ divides $n$. Compute $\frac{S}{n}$. | 1024 | 64.0625 |
4,080 | An icosidodecahedron is a convex polyhedron with 20 triangular faces and 12 pentagonal faces. How many vertices does it have? | 30 | 100 |
4,081 | Compute $\frac{\tan ^{2}\left(20^{\circ}\right)-\sin ^{2}\left(20^{\circ}\right)}{\tan ^{2}\left(20^{\circ}\right) \sin ^{2}\left(20^{\circ}\right)}$. | 1 | 89.84375 |
4,082 | Let $x, y, n$ be positive integers with $n>1$. How many ordered triples $(x, y, n)$ of solutions are there to the equation $x^{n}-y^{n}=2^{100}$ ? | 49 | 8.59375 |
4,083 | Let $S$ be a set of positive integers satisfying the following two conditions: - For each positive integer $n$, at least one of $n, 2 n, \ldots, 100 n$ is in $S$. - If $a_{1}, a_{2}, b_{1}, b_{2}$ are positive integers such that $\operatorname{gcd}\left(a_{1} a_{2}, b_{1} b_{2}\right)=1$ and $a_{1} b_{1}, a_{2} b_{2} \in S$, then $a_{2} b_{1}, a_{1} b_{2} \in S$ Suppose that $S$ has natural density $r$. Compute the minimum possible value of $\left\lfloor 10^{5} r\right\rfloor$. Note: $S$ has natural density $r$ if $\frac{1}{n}|S \cap\{1, \ldots, n\}|$ approaches $r$ as $n$ approaches $\infty$. | 396 | 0 |
4,084 | In triangle $A B C, \angle A B C$ is obtuse. Point $D$ lies on side $A C$ such that \angle A B D$ is right, and point $E$ lies on side $A C$ between $A$ and $D$ such that $B D$ bisects \angle E B C$. Find $C E$, given that $A C=35, B C=7$, and $B E=5$. | 10 | 4.6875 |
4,085 | Let $a, b, c, d$ be real numbers such that $a^{2}+b^{2}+c^{2}+d^{2}=1$. Determine the minimum value of $(a-b)(b-c)(c-d)(d-a)$ and determine all values of $(a, b, c, d)$ such that the minimum value is achieved. | -\frac{1}{8} | 5.46875 |
4,086 | A positive integer is called jubilant if the number of 1 's in its binary representation is even. For example, $6=110_{2}$ is a jubilant number. What is the 2009 th smallest jubilant number? | 4018 | 42.96875 |
4,087 | A spider is making a web between $n>1$ distinct leaves which are equally spaced around a circle. He chooses a leaf to start at, and to make the base layer he travels to each leaf one at a time, making a straight line of silk between each consecutive pair of leaves, such that no two of the lines of silk cross each other and he visits every leaf exactly once. In how many ways can the spider make the base layer of the web? Express your answer in terms of $n$. | n 2^{n-2} | 0 |
4,088 | For any positive integer $n$, let $\tau(n)$ denote the number of positive divisors of $n$. If $n$ is a positive integer such that $\frac{\tau\left(n^{2}\right)}{\tau(n)}=3$, compute $\frac{\tau\left(n^{7}\right)}{\tau(n)}$. | 29 | 10.9375 |
4,089 | The roots of $z^{6}+z^{4}+z^{2}+1=0$ are the vertices of a convex polygon in the complex plane. Find the sum of the squares of the side lengths of the polygon. | 12-4 \sqrt{2} | 0.78125 |
4,090 | Bob is writing a sequence of letters of the alphabet, each of which can be either uppercase or lowercase, according to the following two rules: If he had just written an uppercase letter, he can either write the same letter in lowercase after it, or the next letter of the alphabet in uppercase. If he had just written a lowercase letter, he can either write the same letter in uppercase after it, or the preceding letter of the alphabet in lowercase. For instance, one such sequence is $a A a A B C D d c b B C$. How many sequences of 32 letters can he write that start at (lowercase) $a$ and end at (lowercase) $z$? | 376 | 0 |
4,091 | During the regular season, Washington Redskins achieve a record of 10 wins and 6 losses. Compute the probability that their wins came in three streaks of consecutive wins, assuming that all possible arrangements of wins and losses are equally likely. (For example, the record LLWWWWWLWWLWWWLL contains three winning streaks, while WWWWWWWLLLLLLWWW has just two.) | \frac{315}{2002} | 0 |
4,092 | Let \mathbb{N} denote the natural numbers. Compute the number of functions $f: \mathbb{N} \rightarrow\{0,1, \ldots, 16\}$ such that $$f(x+17)=f(x) \quad \text { and } \quad f\left(x^{2}\right) \equiv f(x)^{2}+15 \quad(\bmod 17)$$ for all integers $x \geq 1$ | 12066 | 0 |
4,093 | Two reals \( x \) and \( y \) are such that \( x-y=4 \) and \( x^{3}-y^{3}=28 \). Compute \( x y \). | -3 | 100 |
4,094 | Bob's Rice ID number has six digits, each a number from 1 to 9, and any digit can be used any number of times. The ID number satisfies the following property: the first two digits is a number divisible by 2, the first three digits is a number divisible by 3, etc. so that the ID number itself is divisible by 6. One ID number that satisfies this condition is 123252. How many different possibilities are there for Bob's ID number? | 324 | 86.71875 |
4,095 | In how many distinct ways can you color each of the vertices of a tetrahedron either red, blue, or green such that no face has all three vertices the same color? (Two colorings are considered the same if one coloring can be rotated in three dimensions to obtain the other.) | 6 | 39.0625 |
4,096 | Let $f$ be a monic cubic polynomial satisfying $f(x)+f(-x)=0$ for all real numbers $x$. For all real numbers $y$, define $g(y)$ to be the number of distinct real solutions $x$ to the equation $f(f(x))=y$. Suppose that the set of possible values of $g(y)$ over all real numbers $y$ is exactly $\{1,5,9\}$. Compute the sum of all possible values of $f(10)$. | 970 | 6.25 |
4,097 | The average of a set of distinct primes is 27. What is the largest prime that can be in this set? | 139 | 0 |
4,098 | Sam spends his days walking around the following $2 \times 2$ grid of squares. Say that two squares are adjacent if they share a side. He starts at the square labeled 1 and every second walks to an adjacent square. How many paths can Sam take so that the sum of the numbers on every square he visits in his path is equal to 20 (not counting the square he started on)? | 167 | 0 |
4,099 | Find all pairs of integer solutions $(n, m)$ to $2^{3^{n}}=3^{2^{m}}-1$. | (0,0) \text{ and } (1,1) | 5.46875 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.