Question stringlengths 37 4.42k | answer stringlengths 1 210 | source stringclasses 5 values | split stringclasses 2 values |
|---|---|---|---|
Compute the third least positive integer $n$ such that each of $n, n+1$, and $n+2$ is a product of exactly two (not necessarily distinct) primes. | 93 | OLYMPIADBENCH | test |
The points $(1,2,3)$ and $(3,3,2)$ are vertices of a cube. Compute the product of all possible distinct volumes of the cube. | 216 | OLYMPIADBENCH | test |
Eight students attend a Harper Valley ARML practice. At the end of the practice, they decide to take selfies to celebrate the event. Each selfie will have either two or three students in the picture. Compute the minimum number of selfies so that each pair of the eight students appears in exactly one selfie. | 12 | OLYMPIADBENCH | test |
$\quad$ Compute the least positive value of $t$ such that
$$
\operatorname{Arcsin}(\sin (t)), \operatorname{Arccos}(\cos (t)), \operatorname{Arctan}(\tan (t))
$$
form (in some order) a three-term arithmetic progression with a nonzero common difference. | $\frac{3 \pi}{4}$ | OLYMPIADBENCH | test |
In non-right triangle $A B C$, distinct points $P, Q, R$, and $S$ lie on $\overline{B C}$ in that order such that $\angle B A P \cong \angle P A Q \cong \angle Q A R \cong \angle R A S \cong \angle S A C$. Given that the angles of $\triangle A B C$ are congruent to the angles of $\triangle A P Q$ in some order of correspondence, compute $\mathrm{m} \angle B$ in degrees. | $\frac{45}{2}$ | OLYMPIADBENCH | test |
Consider the system of equations
$$
\begin{aligned}
& \log _{4} x+\log _{8}(y z)=2 \\
& \log _{4} y+\log _{8}(x z)=4 \\
& \log _{4} z+\log _{8}(x y)=5 .
\end{aligned}
$$
Given that $x y z$ can be expressed in the form $2^{k}$, compute $k$. | $\frac{66}{7}$ | OLYMPIADBENCH | test |
A complex number $z$ is selected uniformly at random such that $|z|=1$. Compute the probability that $z$ and $z^{2019}$ both lie in Quadrant II in the complex plane. | $\frac{505}{8076}$ | OLYMPIADBENCH | test |
Compute the least positive integer $n$ such that the sum of the digits of $n$ is five times the sum of the digits of $(n+2019)$. | 7986 | OLYMPIADBENCH | test |
$\quad$ Compute the greatest real number $K$ for which the graphs of
$$
(|x|-5)^{2}+(|y|-5)^{2}=K \quad \text { and } \quad(x-1)^{2}+(y+1)^{2}=37
$$
have exactly two intersection points. | 29 | OLYMPIADBENCH | test |
To morph a sequence means to replace two terms $a$ and $b$ with $a+1$ and $b-1$ if and only if $a+1<b-1$, and such an operation is referred to as a morph. Compute the least number of morphs needed to transform the sequence $1^{2}, 2^{2}, 3^{2}, \ldots, 10^{2}$ into an arithmetic progression. | 56 | OLYMPIADBENCH | test |
Triangle $A B C$ is inscribed in circle $\omega$. The tangents to $\omega$ at $B$ and $C$ meet at point $T$. The tangent to $\omega$ at $A$ intersects the perpendicular bisector of $\overline{A T}$ at point $P$. Given that $A B=14, A C=30$, and $B C=40$, compute $[P B C]$. | $\frac{800}{3}$ | OLYMPIADBENCH | test |
Given that $a, b, c$, and $d$ are integers such that $a+b c=20$ and $-a+c d=19$, compute the greatest possible value of $c$. | 39 | OLYMPIADBENCH | test |
Let $T$ = 39. Emile randomly chooses a set of $T$ cards from a standard deck of 52 cards. Given that Emile's set contains no clubs, compute the probability that his set contains three aces. | 1 | OLYMPIADBENCH | test |
Let $T=1$. In parallelogram $A B C D, \frac{A B}{B C}=T$. Given that $M$ is the midpoint of $\overline{A B}$ and $P$ and $Q$ are the trisection points of $\overline{C D}$, compute $\frac{[A B C D]}{[M P Q]}$. | 6 | OLYMPIADBENCH | test |
Let $T=6$. Compute the value of $x$ such that $\log _{T} \sqrt{x-7}+\log _{T^{2}}(x-2)=1$. | 11 | OLYMPIADBENCH | test |
Let $T=11$. Let $p$ be an odd prime and let $x, y$, and $z$ be positive integers less than $p$. When the trinomial $(p x+y+z)^{T-1}$ is expanded and simplified, there are $N$ terms, of which $M$ are always multiples of $p$. Compute $M$. | 55 | OLYMPIADBENCH | test |
Let $T=55$. Compute the value of $K$ such that $20, T-5, K$ is an increasing geometric sequence and $19, K, 4 T+11$ is an increasing arithmetic sequence. | 125 | OLYMPIADBENCH | test |
Let $T=125$. Cube $\mathcal{C}_{1}$ has volume $T$ and sphere $\mathcal{S}_{1}$ is circumscribed about $\mathcal{C}_{1}$. For $n \geq 1$, the sphere $\mathcal{S}_{n}$ is circumscribed about the cube $\mathcal{C}_{n}$ and is inscribed in the cube $\mathcal{C}_{n+1}$. Let $k$ be the least integer such that the volume of $\mathcal{C}_{k}$ is at least 2019. Compute the edge length of $\mathcal{C}_{k}$. | 15 | OLYMPIADBENCH | test |
Square $K E N T$ has side length 20 . Point $M$ lies in the interior of $K E N T$ such that $\triangle M E N$ is equilateral. Given that $K M^{2}=a-b \sqrt{3}$, where $a$ and $b$ are integers, compute $b$. | 400 | OLYMPIADBENCH | test |
Let $T$ be a rational number. Let $a, b$, and $c$ be the three solutions of the equation $x^{3}-20 x^{2}+19 x+T=0$. Compute $a^{2}+b^{2}+c^{2}$. | 362 | OLYMPIADBENCH | test |
Let $T=362$ and let $K=\sqrt{T-1}$. Compute $\left|(K-20)(K+1)+19 K-K^{2}\right|$. | 20 | OLYMPIADBENCH | test |
Let $T=20$. In $\triangle L E O, \sin \angle L E O=\frac{1}{T}$. If $L E=\frac{1}{n}$ for some positive real number $n$, then $E O=$ $n^{3}-4 n^{2}+5 n$. As $n$ ranges over the positive reals, compute the least possible value of $[L E O]$. | $\frac{1}{40}$ | OLYMPIADBENCH | test |
Let $T=\frac{1}{40}$. Given that $x, y$, and $z$ are real numbers such that $x+y=5, x^{2}-y^{2}=\frac{1}{T}$, and $x-z=-7$, compute $x+z$ | 20 | OLYMPIADBENCH | test |
Let $T=20$. The product of all positive divisors of $2^{T}$ can be written in the form $2^{K}$. Compute $K$. | 210 | OLYMPIADBENCH | test |
Let $T=210$. At the Westward House of Supper ("WHS"), a dinner special consists of an appetizer, an entrée, and dessert. There are 7 different appetizers and $K$ different entrées that a guest could order. There are 2 dessert choices, but ordering dessert is optional. Given that there are $T$ possible different orders that could be placed at the WHS, compute $K$. | 10 | OLYMPIADBENCH | test |
Let $S=15$ and let $M=10$ . Sam and Marty each ride a bicycle at a constant speed. Sam's speed is $S \mathrm{~km} / \mathrm{hr}$ and Marty's speed is $M \mathrm{~km} / \mathrm{hr}$. Given that Sam and Marty are initially $100 \mathrm{~km}$ apart and they begin riding towards one another at the same time, along a straight path, compute the number of kilometers that Sam will have traveled when Sam and Marty meet. | 60 | OLYMPIADBENCH | test |
Compute the $2011^{\text {th }}$ smallest positive integer $N$ that gains an extra digit when doubled. | 6455 | OLYMPIADBENCH | test |
In triangle $A B C, C$ is a right angle and $M$ is on $\overline{A C}$. A circle with radius $r$ is centered at $M$, is tangent to $\overline{A B}$, and is tangent to $\overline{B C}$ at $C$. If $A C=5$ and $B C=12$, compute $r$. | $\frac{12}{5}$ | OLYMPIADBENCH | test |
The product of the first five terms of a geometric progression is 32 . If the fourth term is 17 , compute the second term. | $\frac{4}{17}$ | OLYMPIADBENCH | test |
Polygon $A_{1} A_{2} \ldots A_{n}$ is a regular $n$-gon. For some integer $k<n$, quadrilateral $A_{1} A_{2} A_{k} A_{k+1}$ is a rectangle of area 6 . If the area of $A_{1} A_{2} \ldots A_{n}$ is 60 , compute $n$. | 40 | OLYMPIADBENCH | test |
A bag contains 20 lavender marbles, 12 emerald marbles, and some number of orange marbles. If the probability of drawing an orange marble in one try is $\frac{1}{y}$, compute the sum of all possible integer values of $y$. | 69 | OLYMPIADBENCH | test |
Compute the number of ordered quadruples of integers $(a, b, c, d)$ satisfying the following system of equations:
$$
\left\{\begin{array}{l}
a b c=12,000 \\
b c d=24,000 \\
c d a=36,000
\end{array}\right.
$$ | 12 | OLYMPIADBENCH | test |
Let $n$ be a positive integer such that $\frac{3+4+\cdots+3 n}{5+6+\cdots+5 n}=\frac{4}{11}$. Compute $\frac{2+3+\cdots+2 n}{4+5+\cdots+4 n}$. | $\frac{27}{106}$ | OLYMPIADBENCH | test |
The quadratic polynomial $f(x)$ has a zero at $x=2$. The polynomial $f(f(x))$ has only one real zero, at $x=5$. Compute $f(0)$. | $-\frac{32}{9}$ | OLYMPIADBENCH | test |
The Local Area Inspirational Math Exam comprises 15 questions. All answers are integers ranging from 000 to 999, inclusive. If the 15 answers form an arithmetic progression with the largest possible difference, compute the largest possible sum of those 15 answers. | 7530 | OLYMPIADBENCH | test |
Circle $\omega_{1}$ has center $O$, which is on circle $\omega_{2}$. The circles intersect at points $A$ and $C$. Point $B$ lies on $\omega_{2}$ such that $B A=37, B O=17$, and $B C=7$. Compute the area of $\omega_{1}$. | $548 \pi$ | OLYMPIADBENCH | test |
Compute the number of integers $n$ for which $2^{4}<8^{n}<16^{32}$. | 41 | OLYMPIADBENCH | test |
Let $T=41$. Compute the number of positive integers $b$ such that the number $T$ has exactly two digits when written in base $b$. | 35 | OLYMPIADBENCH | test |
Let $T=35$. Triangle $A B C$ has a right angle at $C$, and $A B=40$. If $A C-B C=T-1$, compute $[A B C]$, the area of $\triangle A B C$. | 111 | OLYMPIADBENCH | test |
Let $x$ be a positive real number such that $\log _{\sqrt{2}} x=20$. Compute $\log _{2} \sqrt{x}$. | 5 | OLYMPIADBENCH | test |
Let $T=5$. Hannah flips two fair coins, while Otto flips $T$ fair coins. Let $p$ be the probability that the number of heads showing on Hannah's coins is greater than the number of heads showing on Otto's coins. If $p=q / r$, where $q$ and $r$ are relatively prime positive integers, compute $q+r$. | 17 | OLYMPIADBENCH | test |
Let $T=17$. In ARMLovia, the unit of currency is the edwah. Janet's wallet contains bills in denominations of 20 and 80 edwahs. If the bills are worth an average of $2 T$ edwahs each, compute the smallest possible value of the bills in Janet's wallet. | 1020 | OLYMPIADBENCH | test |
Spheres centered at points $P, Q, R$ are externally tangent to each other, and are tangent to plane $\mathcal{M}$ at points $P^{\prime}, Q^{\prime}, R^{\prime}$, respectively. All three spheres are on the same side of the plane. If $P^{\prime} Q^{\prime}=Q^{\prime} R^{\prime}=12$ and $P^{\prime} R^{\prime}=6$, compute the area of $\triangle P Q R$. | $18 \sqrt{6}$ | OLYMPIADBENCH | test |
Let $f(x)=x^{1}+x^{2}+x^{4}+x^{8}+x^{16}+x^{32}+\cdots$. Compute the coefficient of $x^{10}$ in $f(f(x))$. | 40 | OLYMPIADBENCH | test |
Compute $\left\lfloor 100000(1.002)^{10}\right\rfloor$. | 102018 | OLYMPIADBENCH | test |
If $1, x, y$ is a geometric sequence and $x, y, 3$ is an arithmetic sequence, compute the maximum value of $x+y$. | $\frac{15}{4}$ | OLYMPIADBENCH | test |
Define the sequence of positive integers $\left\{a_{n}\right\}$ as follows:
$$
\left\{\begin{array}{l}
a_{1}=1 \\
\text { for } n \geq 2, a_{n} \text { is the smallest possible positive value of } n-a_{k}^{2}, \text { for } 1 \leq k<n .
\end{array}\right.
$$
For example, $a_{2}=2-1^{2}=1$, and $a_{3}=3-1^{2}=2$. Compute $a_{1}+a_{2}+\cdots+a_{50}$. | 253 | OLYMPIADBENCH | test |
Compute the base $b$ for which $253_{b} \cdot 341_{b}=\underline{7} \underline{4} \underline{X} \underline{Y} \underline{Z}_{b}$, for some base- $b$ digits $X, Y, Z$. | 20 | OLYMPIADBENCH | test |
Some portions of the line $y=4 x$ lie below the curve $y=10 \pi \sin ^{2} x$, and other portions lie above the curve. Compute the sum of the lengths of all the segments of the graph of $y=4 x$ that lie in the first quadrant, below the graph of $y=10 \pi \sin ^{2} x$. | $\frac{5 \pi}{4} \sqrt{17}$ | OLYMPIADBENCH | test |
In equilateral hexagon $A B C D E F, \mathrm{~m} \angle A=2 \mathrm{~m} \angle C=2 \mathrm{~m} \angle E=5 \mathrm{~m} \angle D=10 \mathrm{~m} \angle B=10 \mathrm{~m} \angle F$, and diagonal $B E=3$. Compute $[A B C D E F]$, that is, the area of $A B C D E F$. | $\frac{9}{2}$ | OLYMPIADBENCH | test |
The taxicab distance between points $A=\left(x_{A}, y_{A}\right)$ and $B=\left(x_{B}, y_{B}\right)$ is defined as $d(A, B)=$ $\left|x_{A}-x_{B}\right|+\left|y_{A}-y_{B}\right|$. Given some $s>0$ and points $A=\left(x_{A}, y_{A}\right)$ and $B=\left(x_{B}, y_{B}\right)$, define the taxicab ellipse with foci $A=\left(x_{A}, y_{A}\right)$ and $B=\left(x_{B}, y_{B}\right)$ to be the set of points $\{Q \mid d(A, Q)+d(B, Q)=s\}$. Compute the area enclosed by the taxicab ellipse with foci $(0,5)$ and $(12,0)$, passing through $(1,-1)$. | 96 | OLYMPIADBENCH | test |
The function $f$ satisfies the relation $f(n)=f(n-1) f(n-2)$ for all integers $n$, and $f(n)>0$ for all positive integers $n$. If $f(1)=\frac{f(2)}{512}$ and $\frac{1}{f(1)}=2 f(2)$, compute $f(f(4))$. | 4096 | OLYMPIADBENCH | test |
Frank Narf accidentally read a degree $n$ polynomial with integer coefficients backwards. That is, he read $a_{n} x^{n}+\ldots+a_{1} x+a_{0}$ as $a_{0} x^{n}+\ldots+a_{n-1} x+a_{n}$. Luckily, the reversed polynomial had the same zeros as the original polynomial. All the reversed polynomial's zeros were real, and also integers. If $1 \leq n \leq 7$, compute the number of such polynomials such that $\operatorname{GCD}\left(a_{0}, a_{1}, \ldots, a_{n}\right)=1$. | 70 | OLYMPIADBENCH | test |
Given a regular 16-gon, extend three of its sides to form a triangle none of whose vertices lie on the 16-gon itself. Compute the number of noncongruent triangles that can be formed in this manner. | 11 | OLYMPIADBENCH | test |
Two square tiles of area 9 are placed with one directly on top of the other. The top tile is then rotated about its center by an acute angle $\theta$. If the area of the overlapping region is 8 , compute $\sin \theta+\cos \theta$. | $\frac{5}{4}$ | OLYMPIADBENCH | test |
Suppose that neither of the three-digit numbers $M=\underline{4} \underline{A} \underline{6}$ and $N=\underline{1} \underline{B} \underline{7}$ is divisible by 9 , but the product $M \cdot N$ is divisible by 9 . Compute the largest possible value of $A+B$. | 12 | OLYMPIADBENCH | test |
Let $T=12$. Each interior angle of a regular $T$-gon has measure $d^{\circ}$. Compute $d$. | 150 | OLYMPIADBENCH | test |
Suppose that $r$ and $s$ are the two roots of the equation $F_{k} x^{2}+F_{k+1} x+F_{k+2}=0$, where $F_{n}$ denotes the $n^{\text {th }}$ Fibonacci number. Compute the value of $(r+1)(s+1)$. | 2 | OLYMPIADBENCH | test |
Let $T=2$. Compute the product of $-T-i$ and $i-T$, where $i=\sqrt{-1}$. | 5 | OLYMPIADBENCH | test |
Let $T=5$. Compute the number of positive divisors of the number $20^{4} \cdot 11^{T}$ that are perfect cubes. | 12 | OLYMPIADBENCH | test |
Let $T=72 \sqrt{2}$, and let $K=\left(\frac{T}{12}\right)^{2}$. In the sequence $0.5,1,-1.5,2,2.5,-3, \ldots$, every third term is negative, and the absolute values of the terms form an arithmetic sequence. Compute the sum of the first $K$ terms of this sequence. | 414 | OLYMPIADBENCH | test |
Let $A$ be the sum of the digits of the number you will receive from position 7 , and let $B$ be the sum of the digits of the number you will receive from position 9 . Let $(x, y)$ be a point randomly selected from the interior of the triangle whose consecutive vertices are $(1,1),(B, 7)$ and $(17,1)$. Compute the probability that $x>A-1$. | $\frac{79}{128}$ | OLYMPIADBENCH | test |
Let $T=9.5$. If $\log _{2} x^{T}-\log _{4} x=\log _{8} x^{k}$ is an identity for all $x>0$, compute the value of $k$. | 27 | OLYMPIADBENCH | test |
Let $T=16$. An isosceles trapezoid has an area of $T+1$, a height of 2 , and the shorter base is 3 units shorter than the longer base. Compute the sum of the length of the shorter base and the length of one of the congruent sides. | 9.5 | OLYMPIADBENCH | test |
Let $T=10$. Susan flips a fair coin $T$ times. Leo has an unfair coin such that the probability of flipping heads is $\frac{1}{3}$. Leo gets to flip his coin the least number of times so that Leo's expected number of heads will exceed Susan's expected number of heads. Compute the number of times Leo gets to flip his coin. | 16 | OLYMPIADBENCH | test |
Let $T=1$. Dennis and Edward each take 48 minutes to mow a lawn, and Shawn takes 24 minutes to mow a lawn. Working together, how many lawns can Dennis, Edward, and Shawn mow in $2 \cdot T$ hours? (For the purposes of this problem, you may assume that after they complete mowing a lawn, they immediately start mowing the next lawn.) | 10 | OLYMPIADBENCH | test |
Let T be a rational number. Compute $\sin ^{2} \frac{T \pi}{2}+\sin ^{2} \frac{(5-T) \pi}{2}$. | 1 | OLYMPIADBENCH | test |
Let $T=11$. Compute the value of $x$ that satisfies $\sqrt{20+\sqrt{T+x}}=5$. | 14 | OLYMPIADBENCH | test |
The sum of the interior angles of an $n$-gon equals the sum of the interior angles of a pentagon plus the sum of the interior angles of an octagon. Compute $n$. | 11 | OLYMPIADBENCH | test |
Xenia and Sergey play the following game. Xenia thinks of a positive integer $N$ not exceeding 5000. Then she fixes 20 distinct positive integers $a_{1}, a_{2}, \ldots, a_{20}$ such that, for each $k=1,2, \ldots, 20$, the numbers $N$ and $a_{k}$ are congruent modulo $k$. By a move, Sergey tells Xenia a set $S$ of positive integers not exceeding 20 , and she tells him back the set $\left\{a_{k}: k \in S\right\}$ without spelling out which number corresponds to which index. How many moves does Sergey need to determine for sure the number Xenia thought of? | 2 | OLYMPIADBENCH | test |
Given a positive integer $n$, determine the largest real number $\mu$ satisfying the following condition: for every $4 n$-point configuration $C$ in an open unit square $U$, there exists an open rectangle in $U$, whose sides are parallel to those of $U$, which contains exactly one point of $C$, and has an area greater than or equal to $\mu$. | $\frac{1}{2 n+2}$ | OLYMPIADBENCH | test |
Find (in closed form) the difference between the number of positive integers at most $2^{2017}$ with even weight and the number of positive integers at most $2^{2017}$ with odd weight. | $2^{1009}$ | OLYMPIADBENCH | test |
Determine all positive integers $n$ satisfying the following condition: for every monic polynomial $P$ of degree at most $n$ with integer coefficients, there exists a positive integer $k \leq n$, and $k+1$ distinct integers $x_{1}, x_{2}, \ldots, x_{k+1}$ such that
$$
P\left(x_{1}\right)+P\left(x_{2}\right)+\cdots+P\left(x_{k}\right)=P\left(x_{k+1}\right) .
$$
Note. A polynomial is monic if the coefficient of the highest power is one. | 2 | OLYMPIADBENCH | test |
Let $n$ be an integer greater than 1 and let $X$ be an $n$-element set. A non-empty collection of subsets $A_{1}, \ldots, A_{k}$ of $X$ is tight if the union $A_{1} \cup \cdots \cup A_{k}$ is a proper subset of $X$ and no element of $X$ lies in exactly one of the $A_{i}$ s. Find the largest cardinality of a collection of proper non-empty subsets of $X$, no non-empty subcollection of which is tight.
Note. A subset $A$ of $X$ is proper if $A \neq X$. The sets in a collection are assumed to be distinct. The whole collection is assumed to be a subcollection. | $2n-2$ | OLYMPIADBENCH | test |
Determine all prime numbers $p$ and all positive integers $x$ and $y$ satisfying $x^{3}+y^{3}=$ $p(x y+p)$. | $(1,8,19), (2,7,13), (4,5,7)$ | OLYMPIADBENCH | test |
Let $n \geqslant 2$ be an integer, and let $f$ be a $4 n$-variable polynomial with real coefficients. Assume that, for any $2 n$ points $\left(x_{1}, y_{1}\right), \ldots,\left(x_{2 n}, y_{2 n}\right)$ in the plane, $f\left(x_{1}, y_{1}, \ldots, x_{2 n}, y_{2 n}\right)=0$ if and only if the points form the vertices of a regular $2 n$-gon in some order, or are all equal.
Determine the smallest possible degree of $f$. | $2n$ | OLYMPIADBENCH | test |
For a positive integer $a$, define a sequence of integers $x_{1}, x_{2}, \ldots$ by letting $x_{1}=a$ and $x_{n+1}=2 x_{n}+1$ for $n \geq 1$. Let $y_{n}=2^{x_{n}}-1$. Determine the largest possible $k$ such that, for some positive integer $a$, the numbers $y_{1}, \ldots, y_{k}$ are all prime. | 2 | OLYMPIADBENCH | test |
Let $n$ be a positive integer and fix $2 n$ distinct points on a circumference. Split these points into $n$ pairs and join the points in each pair by an arrow (i.e., an oriented line segment). The resulting configuration is good if no two arrows cross, and there are no arrows $\overrightarrow{A B}$ and $\overrightarrow{C D}$ such that $A B C D$ is a convex quadrangle oriented clockwise. Determine the number of good configurations. | $\binom{2n}{n}$ | OLYMPIADBENCH | test |
Given positive integers $m$ and $n \geq m$, determine the largest number of dominoes $(1 \times 2$ or $2 \times 1$ rectangles) that can be placed on a rectangular board with $m$ rows and $2 n$ columns consisting of cells $(1 \times 1$ squares $)$ so that:
(i) each domino covers exactly two adjacent cells of the board;
(ii) no two dominoes overlap;
(iii) no two form a $2 \times 2$ square; and
(iv) the bottom row of the board is completely covered by $n$ dominoes. | $m n-\lfloor m / 2\rfloor$ | OLYMPIADBENCH | test |
A cubic sequence is a sequence of integers given by $a_{n}=n^{3}+b n^{2}+c n+d$, where $b, c$ and $d$ are integer constants and $n$ ranges over all integers, including negative integers.
Determine the possible values of $a_{2015} \cdot a_{2016}$ for a cubic sequence satisfying the condition in part (a). | 0 | OLYMPIADBENCH | test |
Find all functions $f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$ such that
$$
f(x+f(y))=f(x+y)+f(y)\tag{1}
$$
for all $x, y \in \mathbb{R}^{+}$. (Symbol $\mathbb{R}^{+}$denotes the set of all positive real numbers.) | $f(x)=2 x$ | OLYMPIADBENCH | test |
Let $n>1$ be an integer. In the space, consider the set
$$
S=\{(x, y, z) \mid x, y, z \in\{0,1, \ldots, n\}, x+y+z>0\}
$$
Find the smallest number of planes that jointly contain all $(n+1)^{3}-1$ points of $S$ but none of them passes through the origin. | $3 n$ | OLYMPIADBENCH | test |
Find all positive integers $n$, for which the numbers in the set $S=\{1,2, \ldots, n\}$ can be colored red and blue, with the following condition being satisfied: the set $S \times S \times S$ contains exactly 2007 ordered triples $(x, y, z)$ such that (i) $x, y, z$ are of the same color and (ii) $x+y+z$ is divisible by $n$. | $69$,$84$ | OLYMPIADBENCH | test |
Determine the smallest positive real number $k$ with the following property.
Let $A B C D$ be a convex quadrilateral, and let points $A_{1}, B_{1}, C_{1}$ and $D_{1}$ lie on sides $A B, B C$, $C D$ and $D A$, respectively. Consider the areas of triangles $A A_{1} D_{1}, B B_{1} A_{1}, C C_{1} B_{1}$, and $D D_{1} C_{1}$; let $S$ be the sum of the two smallest ones, and let $S_{1}$ be the area of quadrilateral $A_{1} B_{1} C_{1} D_{1}$. Then we always have $k S_{1} \geq S$. | $k=1$ | OLYMPIADBENCH | test |
Find all pairs $(k, n)$ of positive integers for which $7^{k}-3^{n}$ divides $k^{4}+n^{2}$. | $(2,4)$ | OLYMPIADBENCH | test |
Find all surjective functions $f: \mathbb{N} \rightarrow \mathbb{N}$ such that for every $m, n \in \mathbb{N}$ and every prime $p$, the number $f(m+n)$ is divisible by $p$ if and only if $f(m)+f(n)$ is divisible by $p$.
( $\mathbb{N}$ is the set of all positive integers.) | $f(n)=n$ | OLYMPIADBENCH | test |
Determine all pairs $(f, g)$ of functions from the set of positive integers to itself that satisfy
$$
f^{g(n)+1}(n)+g^{f(n)}(n)=f(n+1)-g(n+1)+1
$$
for every positive integer $n$. Here, $f^{k}(n)$ means $\underbrace{f(f(\ldots f}_{k}(n) \ldots))$. | $f(n)=n$, $g(n)=1$ | OLYMPIADBENCH | test |
Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_{1}, A_{2}, \ldots, A_{k}$ such that for all integers $n \geq 15$ and all $i \in\{1,2, \ldots, k\}$ there exist two distinct elements of $A_{i}$ whose sum is $n$. | 3 | OLYMPIADBENCH | test |
Let $m$ be a positive integer and consider a checkerboard consisting of $m$ by $m$ unit squares. At the midpoints of some of these unit squares there is an ant. At time 0, each ant starts moving with speed 1 parallel to some edge of the checkerboard. When two ants moving in opposite directions meet, they both turn $90^{\circ}$ clockwise and continue moving with speed 1 . When more than two ants meet, or when two ants moving in perpendicular directions meet, the ants continue moving in the same direction as before they met. When an ant reaches one of the edges of the checkerboard, it falls off and will not re-appear.
Considering all possible starting positions, determine the latest possible moment at which the last ant falls off the checkerboard or prove that such a moment does not necessarily exist. | $\frac{3 m}{2}-1$ | OLYMPIADBENCH | test |
On a square table of 2011 by 2011 cells we place a finite number of napkins that each cover a square of 52 by 52 cells. In each cell we write the number of napkins covering it, and we record the maximal number $k$ of cells that all contain the same nonzero number. Considering all possible napkin configurations, what is the largest value of $k$ ? | 3986729 | OLYMPIADBENCH | test |
For each positive integer $k$, let $t(k)$ be the largest odd divisor of $k$. Determine all positive integers $a$ for which there exists a positive integer $n$ such that all the differences
$$
t(n+a)-t(n), \quad t(n+a+1)-t(n+1), \quad \ldots, \quad t(n+2 a-1)-t(n+a-1)
$$
are divisible by 4 . | 1,3,5 | OLYMPIADBENCH | test |
Let $x_{1}, \ldots, x_{100}$ be nonnegative real numbers such that $x_{i}+x_{i+1}+x_{i+2} \leq 1$ for all $i=1, \ldots, 100$ (we put $x_{101}=x_{1}, x_{102}=x_{2}$ ). Find the maximal possible value of the sum
$$
S=\sum_{i=1}^{100} x_{i} x_{i+2}
$$ | $\frac{25}{2}$ | OLYMPIADBENCH | test |
Denote by $\mathbb{Q}^{+}$the set of all positive rational numbers. Determine all functions $f: \mathbb{Q}^{+} \rightarrow \mathbb{Q}^{+}$ which satisfy the following equation for all $x, y \in \mathbb{Q}^{+}$:
$$
f\left(f(x)^{2} y\right)=x^{3} f(x y)
\tag{1}
$$ | $f(x)=\frac{1}{x}$ | OLYMPIADBENCH | test |
On some planet, there are $2^{N}$ countries $(N \geq 4)$. Each country has a flag $N$ units wide and one unit high composed of $N$ fields of size $1 \times 1$, each field being either yellow or blue. No two countries have the same flag.
We say that a set of $N$ flags is diverse if these flags can be arranged into an $N \times N$ square so that all $N$ fields on its main diagonal will have the same color. Determine the smallest positive integer $M$ such that among any $M$ distinct flags, there exist $N$ flags forming a diverse set. | $M=2^{N-2}+1$ | OLYMPIADBENCH | test |
2500 chess kings have to be placed on a $100 \times 100$ chessboard so that
(i) no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex);
(ii) each row and each column contains exactly 25 kings.
Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.) | 2 | OLYMPIADBENCH | test |
Find the least positive integer $n$ for which there exists a set $\left\{s_{1}, s_{2}, \ldots, s_{n}\right\}$ consisting of $n$ distinct positive integers such that
$$
\left(1-\frac{1}{s_{1}}\right)\left(1-\frac{1}{s_{2}}\right) \ldots\left(1-\frac{1}{s_{n}}\right)=\frac{51}{2010}
$$ | 39 | OLYMPIADBENCH | test |
Find all pairs $(m, n)$ of nonnegative integers for which
$$
m^{2}+2 \cdot 3^{n}=m\left(2^{n+1}-1\right)
\tag{1}
$$ | $(6,3),(9,3),(9,5),(54,5)$ | OLYMPIADBENCH | test |
Find the smallest number $n$ such that there exist polynomials $f_{1}, f_{2}, \ldots, f_{n}$ with rational coefficients satisfying
$$
x^{2}+7=f_{1}(x)^{2}+f_{2}(x)^{2}+\cdots+f_{n}(x)^{2} .
$$ | 5 | OLYMPIADBENCH | test |
Determine the smallest number $M$ such that the inequality
$$
\left|a b\left(a^{2}-b^{2}\right)+b c\left(b^{2}-c^{2}\right)+c a\left(c^{2}-a^{2}\right)\right| \leq M\left(a^{2}+b^{2}+c^{2}\right)^{2}
$$
holds for all real numbers $a, b, c$. | $M=\frac{9}{32} \sqrt{2}$ | OLYMPIADBENCH | test |
A diagonal of a regular 2006-gon is called odd if its endpoints divide the boundary into two parts, each composed of an odd number of sides. Sides are also regarded as odd diagonals.
Suppose the 2006-gon has been dissected into triangles by 2003 nonintersecting diagonals. Find the maximum possible number of isosceles triangles with two odd sides. | $1003$ | OLYMPIADBENCH | test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.