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

A positive integer $n$ is called "foursic'' if there exists a placement of $0$ in the digits of $n$ such that the resulting number a multiple of $4.$ For example, $14$ is foursic because $104$ is a multiple of $4.$ Find the number of two-digit foursic numbers.
Compute \[\frac{(1-\tan10^\circ)(1-\tan 20^\circ)(1-\tan30^\circ)(1-\tan40^\circ)}{(1-\tan5^\circ)(1-\tan 15^\circ)(1-\tan25^\circ)(1-\tan35^\circ)}.\] [i]Proposed by Connor Gordon[/i]
Suppose $x$, $y$, and $z$ are nonzero complex numbers such that $(x+y+z)(x^2+y^2+z^2)=x^3+y^3+z^3$. Compute \[(x+y+z)\left(\dfrac1x+\dfrac1y+\dfrac1z\right).\]
The lengths of the two legs of a right triangle are the two distinct roots of the quadratic $x^2 - 36x + 70$. What is the length of the triangle’s hypotenuse?
For a positive integer $k$, define the $k$-[i]pop[/i] of a positive integer $n$ as the infinite sequence of integers $a_1, a_2, ...$ such that $a_1 = n$ and $$a_{i+1}= \left\lfloor \frac{a_i}{k} \right\rfloor , i = 1, 2, ..$$ where $ \lfloor x\rfloor $ denotes the greatest integer less than or equal to $x$. Furthermore, define a positive integer $m$ to be $k$-[i]pop avoiding[/i] if $k$ does not divide any nonzero term in the $k$-pop of $m$. For example, $14$ is 3-pop avoiding because $3$ does not divide any nonzero term in the $3$-pop of $14$, which is $14, 4, 1, 0, 0, ....$ Suppose that the number of positive integers less than $13^{2018}$ which are $13$-pop avoiding is equal to N. What is the remainder when $N$ is divided by $1000$?
Determine, with proof, whether a square can be dissected into finitely many (not necessarily congruent) triangles, each of which has interior angles $30^\circ, 75^\circ,$ and $75^\circ.$
Let $ABC$ be a triangle with $AB = AC = 10$ and $BC = 12$. Define $\ell_A$ as the line through $A$ perpendicular to $\overline{AB}$. Similarly, $\ell_B$ is the line through $B$ perpendicular to $\overline{BC}$ and $\ell_C$ is the line through $C$ perpendicular to $\overline{CA}$. These three lines $\ell_A, \ell_B, \ell_C$ form a triangle with perimeter $m/n$ for relatively prime positive integers $m$ and $n$. Find $m + n$.
Suppose integers $a < b < c$ satisfy \[ a + b + c = 95\qquad\text{and}\qquad a^2 + b^2 + c^2 = 3083.\] Find $c$.
Let $ABCD$ be a unit square, and suppose that $E$ and $F$ are on $\overline{AD}$ and $\overline{AB}$ such that $AE = AF = \tfrac23$. Let $\overline{CE}$ and $\overline{DF}$ intersect at $G$. If the area of $\triangle CFG$ can be expressed as simplified fraction $\frac{p}{q}$, find $p + q$. Let $T = TNYWR$. A total of $2T$ students go on a road trip. They take two cars, each of which seats $T$ people. Call two students \textit{friendly} if they sat together in the same car going to the trip and in the same car going back home. What is the smallest possible number of friendly pairs of students on the trip?
For how many ordered pairs of positive integers $(a, b)$ such that $a \le 50$ is it true that $x^2 - ax + b$ has integer roots?
Let $ABCD$ be an isosceles trapezoid with $2DA=2AB=2BC=CD$. A point $P$ lies in the interior of $ABCD$ such that $BP=1$, $CP=2$, $DP=4$. Find the area of $ABCD$.
If $x > 0$ and $x^2 +\frac{1}{x^2}= 14$, find $x^5 +\frac{1}{x^5}$.
For some integer $n > 0$, a square paper of side length $2^{n}$ is repeatedly folded in half, right-to-left then bottom-to-top, until a square of side length 1 is formed. A hole is then drilled into the square at a point $\tfrac{3}{16}$ from the top and left edges, and then the paper is completely unfolded. The holes in the unfolded paper form a rectangular array of unevenly spaced points; when connected with horizontal and vertical line segments, these points form a grid of squares and rectangles. Let $P$ be a point chosen randomly from \textit{inside} this grid. Suppose the largest $L$ such that, for all $n$, the probability that the four segments $P$ is bounded by form a square is at least $L$ can be written in the form $\tfrac mn$ where $m$ and $n$ are positive relatively prime integers. Find $m+n$.
Bob has $30$ identical unit cubes. He can join two cubes together by gluing a face on one cube to a face on the other cube. He must join all the cubes together into one connected solid. Over all possible solids that Bob can build, what is the largest possible surface area of the solid? [i]Proposed by Nathan Xiong[/i]
In the national math league, there are $7$ teams. Their season is a round robin format, where each team plays other. Find the number of ways the games could go such that they have equal number of wins. [i]Proposed by Ishin Shah[/i]
Let $\triangle A_1B_1C_1$ be an equilateral triangle of area $60$. Chloe constructs a new triangle $\triangle A_2B_2C_2$ as follows. First, she flips a coin. If it comes up heads, she constructs point $A_2$ such that $B_1$ is the midpoint of $\overline{A_2C_1}$. If it comes up tails, she instead constructs $A_2$ such that $C_1$ is the midpoint of $\overline{A_2B_1}$. She performs analogous operations on $B_2$ and $C_2$. What is the expected value of the area of $\triangle A_2B_2C_2$?
Let $a,b,$ and $c$ be pairwise distinct positive integers such that $\tfrac{1}{a}, \tfrac{1}{b}, \tfrac{1}{c}$ is an increasing arithmetic sequence in that order. Prove that $\gcd(a,b)>1.$
Let $f:\mathbb{N}\to \mathbb{N}$ be a bijection satisfying $f(ab)=f(a)f(b)$ for all $a,b\in \mathbb{N}$. Determine the minimum possible value of $f(n)/n$, taken over all possible $f$ and all $n\leq 2019$.
Find the product of all possible real values for $k$ such that the system of equations $$x^2+y^2= 80$$ $$x^2+y^2= k+2x-8y$$ has exactly one real solution $(x,y)$. [i]Proposed by Nathan Xiong[/i]
Michael and Andrew are playing the game Bust, which is played as follows: Michael chooses a positive integer less than or equal to $99$, and writes it on the board. Andrew then makes a move, which consists of him choosing a positive integer less than or equal to $ 8$ and increasing the integer on the board by the integer he chose. Play then alternates in this manner, with each person making exactly one move, until the integer on the board becomes greater than or equal to $100$. The person who made the last move loses. Let S be the sum of all numbers for which Michael could choose initially and win with both people playing optimally. Find S.
The binomial coefficient $\tbinom{n}{k}$ can be defined as the coefficient of $x^k$ in the expansion of $(1+x)^n.$ Similarly, define the trinomial coefficient $\tbinom{n}{k}_3$ as the coefficient of $x^k$ in the expansion of $(1+x+x^2)^n.$ Determine the number of integers $k$ with $0 \le k \le 4048$ such that $\tbinom{2024}{k}_3 \equiv 1 \pmod{3}.$
Find the product of all possible real values for $k$ such that the system of equations $$x^2+y^2= 80$$ $$x^2+y^2= k+2x-8y$$ has exactly one real solution $(x,y)$. [i]Proposed by Nathan Xiong[/i]
We have 7 buckets labelled 0-6. Initially bucket 0 is empty, while bucket $n$ (for each $1 \leq n \leq 6$) contains the list $[1,2, \ldots, n]$. Consider the following program: choose a subset $S$ of $[1,2,\ldots,6]$ uniformly at random, and replace the contents of bucket $|S|$ with $S$. Let $\tfrac{p}{q}$ be the probability that bucket 5 still contains $[1,2, \ldots, 5]$ after two executions of this program, where $p,q$ are positive coprime integers. Find $p$.
Call a polynomial $P$ [i]prime-covering[/i] if for every prime $p$, there exists an integer $n$ for which $p$ divides $P(n)$. Determine the number of ordered triples of integers $(a,b,c)$, with $1\leq a < b < c \leq 25$, for which $P(x)=(x^2-a)(x^2-b)(x^2-c)$ is prime-covering.
Five friends named Ella, Jacob, Muztaba, Peter, and William are suspicious of their friends for having secret group chats. Call a group of three people a "secret chat" if there is a chat with just the three of them (there cannot be multiple chats with the same three people). They have the following perfectly logical conversation in this order: [list] [*] Ella: I am part of $5$ secret chats. [*] Jacob: I know all of the secret chats that Ella is in. [*] Muztaba: Peter is in all but one of my secret chats. [*] Peter: I am in a secret chat that William cannot know exists. [*] William: I share exactly two secret chats with Jacob and two secret chats with Peter. [/list] Let $E$ be the number of chats Ella is in, $J$ the number of chats Jacob is in, $M$ the number of chats Muztaba is in, $P$ the number of chats Peter is in, and $W$ the number of chats William is in. Find $10000E$ $+$ $1000J$ $+$ $100M$ $+$ $10P+W$.