This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 229

Let $\triangle ABC$ have $\angle ABC=67^{\circ}$. Point $X$ is chosen such that $AB = XC$, $\angle{XAC}=32^\circ$, and $\angle{XCA}=35^\circ$. Compute $\angle{BAC}$ in degrees. [i]Proposed by Raina Yang[/i]
Compute the sum of all positive integers $x$ such that $(x-17)\sqrt{x-1}+(x-1)\sqrt{x+15}$ is an integer.
A non-self intersecting hexagon $RANDOM$ is formed by assigning the labels $R, A, N, D, O, M$ in some order to the points $$(0,0), (10,0), (10,10), (0,10), (3,4), (6,2).$$ Let $a_{\text{max}}$ be the greatest possible area of $RANDOM$ and $a_{\text{min}}$ the least possible area of $RANDOM.$ Find $a_{\text{max}}-a_{\text{min}}.$
Vincent is playing a game with Evil Bill. The game uses an infinite number of red balls, an infinite number of green balls, and a very large bag. Vincent first picks two nonnegative integers $g$ and $k$ such that $g < k \le 2016$, and Evil Bill places $g$ green balls and $2016 - g$ red balls in the bag, so that there is a total of $2016$ balls in the bag. Vincent then picks a ball of either color and places it in the bag. Evil Bill then inspects the bag. If the ratio of green balls to total balls in the bag is ever exactly $\frac{k}{2016}$ , then Evil Bill wins. If the ratio of green balls to total balls is greater than $\frac{k}{2016}$ , then Vincent wins. Otherwise, Vincent and Evil Bill repeat the previous two actions (Vincent picks a ball and Evil Bill inspects the bag). If $S$ is the sum of all possible values of $k$ that Vincent could choose and be able to win, determine the largest prime factor of $S$.
There are $9$ points arranged in a $3\times 3$ square grid. Let two points be adjacent if the distance between them is half the side length of the grid. (There should be $12$ pairs of adjacent points). Suppose that we wanted to connect $8$ pairs of adjacent points, such that all points are connected to each other. In how many ways is this possible? [i]Proposed by Kevin You[/i]
Simplify $$\dbinom{2020}{1010}\dbinom{1010}{1010}+\dbinom{2019}{1010}\dbinom{1011}{1010}+\cdots+\dbinom{1011}{1010}\dbinom{2019}{1010} + \dbinom{1010}{1010}\dbinom{2020}{1010}.$$
Suppose that the sequence of real numbers $a_1,a_2,\ldots$ satisfies $a_1 = - \sqrt{1}, a_2 = \sqrt{2}$, and for all $k > 1$, \[ \frac{a_{k+1}+a_{k-1}}{a_k} = \frac{\sqrt{3} + \sqrt{1}}{\sqrt{2}}. \] Find $a_{2023}$. [i]Proposed by Kevin You[/i]
Jason starts in a cell of the grid below. Every second he moves to an adjacent cell (i.e., two cells that share a side) that he has not visited yet. Find the maximum possible number of cells that Jason can visit. [asy] size(3cm); draw((1,0)--(4,0)); draw((0,1)--(5,1)); draw((0,2)--(5,2)); draw((0,3)--(5,3)); draw((0,4)--(5,4)); draw((1,5)--(4,5)); draw((0,1)--(0,4)); draw((1,0)--(1,5)); draw((2,0)--(2,5)); draw((3,0)--(3,5)); draw((4,0)--(4,5)); draw((5,1)--(5,4)); [/asy]
Say an odd positive integer $n > 1$ is $\textit{twinning}$ if $p - 2 \mid n$ for every prime $p \mid n$. Find the number of twinning integers less than 250.
Find the smallest positive integer $n$ for which $315^2-n^2$ evenly divides $315^3-n^3$. [i]Proposed by Kyle Lee[/i]
For any integer $a$, let $f(a) = |a^4 - 36a^2 + 96a - 64|$. What is the sum of all values of $f(a)$ that are prime? [i]Proposed by Alexander Wang[/i]
For natural numbers $n$, let $r(n)$ be the number formed by reversing the digits of $n$, and take $f(n)$ to be the maximum value of $\frac{r(k)}k$ across all $n$-digit positive integers $k$. If we define $g(n)=\left\lfloor\frac1{10-f(n)}\right\rfloor$, what is the value of $g(20)$? [i]Proposed by Adam Bertelli[/i]
Let $f(x, y) = \left\lfloor \frac{5x}{2y} \right\rfloor + \left\lceil \frac{5y}{2x} \right\rceil$. Suppose $x, y$ are chosen independently uniformly at random from the interval $(0, 1]$. Let $p$ be the probability that $f(x, y) < 6$. If $p$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$, compute $m + n$. (Note: $\lfloor x\rfloor $ is defined as the greatest integer less than or equal to $x$ and $\lceil x \rceil$ is defined as the least integer greater than or equal to$ x$.)
If $x > 0$ and $x^2 +\frac{1}{x^2}= 14$, find $x^5 +\frac{1}{x^5}$.
Find the sum of all two-digit prime numbers whose digits are also both prime numbers. [i]Proposed by Nathan Xiong[/i]
Let $F_n$ denote the $n$th Fibonacci number, with $F_0=0, F_1=1$ and $F_{n}=F_{n-1}+F_{n-2}$ for $n \geq 2$. There exists a unique two digit prime $p$ such that for all $n$, $p | F_{n+100} + F_n$. Find $p$. [i]Proposed by Sam Rosenstrauch[/i]
Brandon wants to split his orchestra of $20$ violins, $15$ violas, $10$ cellos, and $5$ basses into three distinguishable groups, where all of the players of each instrument are indistinguishable. He wants each group to have at least one of each instrument and for each group to have more violins than violas, more violas than cellos, and more cellos than basses. How many ways are there for Brandon to split his orchestra following these conditions?
A $3\times2\times2$ right rectangular prism has one of its edges with length $3$ replaced with an edge of length $5$ parallel to the original edge. The other $11$ edges remain the same length, and the $6$ vertices that are not endpoints of the replaced edge remain in place. The resulting convex solid has $8$ faces, as shown below. Find the volume of the solid. [i]Proposed by Justin Hsieh[/i]
Let $ABC$ be an acute triangle with $AB = 3$ and $AC = 4$. Suppose $M$ is the midpoint of segment $\overline{BC}$, $N$ is the midpoint of $\overline{AM}$, and $E$ and $F$ are the feet of the altitudes of $M$ onto $\overline{AB}$ and $\overline{AC}$, respectively. Further suppose $BC$ intersects $NE$ at $S$ and $NF$ at $T$, and let $X$ and $Y$ be the circumcenters of $\triangle MES$ and $\triangle MFT$, respectively. If $XY$ is tangent to the circumcircle of $\triangle ABC$, what is the area of $\triangle ABC$?
On a plane, two equilateral triangles (of side length $1$) share a side, and a circle is drawn with the common side as a diameter. Find the area of the set of all points that lie inside exactly one of these shapes. [i]Proposed by Howard Halim[/i]
Circles $\omega_1$ and $\omega_2$ are externally tangent to each other. Circle $\Omega$ is placed such that $\omega_1$ is internally tangent to $\Omega$ at $X$ while $\omega_2$ is internally tangent to $\Omega$ at $Y$. Line $\ell$ is tangent to $\omega_1$ at $P$ and $\omega_2$ at $Q$ and furthermore intersects $\Omega$ at points $A$ and $B$ with $AP<AQ$. Suppose that $AP=2$, $PQ=4$, and $QB=3$. Compute the length of line segment $\overline{XY}$.
Let $ABC$ be a triangle with centroid $G$ and $BC = 3$. If $ABC$ is similar to $GAB$, compute the area of $ABC$.
Brandon wants to split his orchestra of $20$ violins, $15$ violas, $10$ cellos, and $5$ basses into three distinguishable groups, where all of the players of each instrument are indistinguishable. He wants each group to have at least one of each instrument and for each group to have more violins than violas, more violas than cellos, and more cellos than basses. How many ways are there for Brandon to split his orchestra following these conditions?
Solve for $x$ if $\sqrt{x + 1}+ \sqrt{x} = 5.$ [i]Proposed by Eric Oh[/i]
Find the smallest positive integer $k$ such that $ \underbrace{11\cdots 11}_{k\text{ 1's}}$ is divisible by $9999$. Let $T = TNYWR$. Circles $\omega_1$ and $\omega_2$ intersect at $P$ and $Q$. The common external tangent $\ell$ to the two circles closer to $Q$ touches $\omega_1$ and $\omega_2$ at $A$ and $B$ respectively. Line $AQ$ intersects $\omega_2$ at $X$ while $BQ$ intersects $\omega_1$ again at $Y$. Let $M$ and $N$ denote the midpoints of $\overline{AY}$ and $\overline{BX}$, also respectively. If $AQ=\sqrt{T}$, $BQ=7$, and $AB=8$, then find the length of $MN$.