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: 161

Suppose $a,b,c$ are distinct positive integers such that $\sqrt{a\sqrt{b\sqrt{c}}}$ is an integer. Compute the least possible value of $a+b+c.$
Let $a_0, a_1, a_2, \ldots$ be an infinite sequence where each term is independently and uniformly at random in the set $\{1, 2, 3, 4\}.$ Define an infinite sequence $b_0, b_1, b_2, \ldots$ recursively by $b_0=1$ and $b_{i+1}=a_i^{b_i}.$ Compute the expected value of the smallest positive integer $k$ such that $b_k \equiv 1 \pmod{5}.$
A number is [i]upwards[/i] if its digits in base $10$ are nondecreasing when read from left to right. Compute the number of positive integers less than $10^6$ that are both upwards and multiples of $11.$
Alice, Bob, and Charlie are playing a game with $6$ cards numbered $1$ through $6.$ Each player is dealt $2$ cards uniformly at random. On each player’s turn, they play one of their cards, and the winner is the person who plays the median of the three cards played. Charlie goes last, so Alice and Bob decide to tell their cards to each other, trying to prevent him from winning whenever possible. Compute the probability that Charlie wins regardless.
Compute $$\frac{2+3+\cdots+100}{1}+\frac{3+4+\cdots+100}{1+2}+\cdots+\frac{100}{1+2+\cdots+99}.$$
Let $f(x) = x^2 +6x+6.$ Compute the greatest real number $x$ such that $f(f(f(f(f(f(x)))))) = 0.$
Let $$P=\prod_{i=0}^{2016} (i^3-i-1)^2.$$ The remainder when $P$ is divided by the prime $2017$ is not zero. Compute this remainder.
There exists a unique circle that is both tangent to the parabola $y=x^2$ at two points and tangent to the curve $x=\sqrt{\tfrac{y^3}{1-y}}.$ Compute the radius of this circle.
Isabella has a bag with $20$ blue diamonds and $25$ purple diamonds. She repeats the following process $44$ times: she removes a diamond from the bag uniformly at random, then puts one blue diamond and one purple diamond into the bag. Compute the expected number of blue diamonds in the bag after all $44$ repetitions.
Holden has a collection of polygons. He writes down a list containing the measure of each interior angle of each of his polygons. He writes down the list $30^\circ, 50^\circ, 60^\circ, 70^\circ, 90^\circ, 100^\circ, 120^\circ, 160^\circ,$ and $x^\circ,$ in some order. Compute $x.$
Suppose $a, b, c,$ and $d$ are pairwise distinct positive perfect squares such that $a^b = c^d.$ Compute the smallest possible value of $a + b + c + d.$
Let $\triangle{ABC}$ be an equilateral triangle with side length $4.$ Across all points $P$ inside triangle $\triangle{ABC}$ satisfying $[PAB]+[PAC]=[PBC],$ compute the minimal possible length of $PA.$ (Here, $[XYZ]$ denotes the area of triangle $\triangle{XYZ}.$)
Let $AXBY$ be a cyclic quadrilateral, and let line $AB$ and line $XY$ intersect at $C.$ Suppose $AX \cdot AY = 6, BX \cdot BY=5,$ and $CX \cdot CY=4.$ Compute $AB^2.$
Compute the $100$th smallest positive multiple of $7$ whose digits in base $10$ are all strictly less than $3.$
Let $ABCD$ be a rectangle whose vertices are labeled in counterclockwise order with $AB=32$ and $AD=60.$ Rectangle $A'B'C'D'$ is constructed by rotating $ABCD$ counterclockwise about $A$ by $60^\circ.$ Given that lines $BB'$ and $DD'$ intersect at point $X,$ compute $CX.$
For each prime $p,$ a polynomial $P(x)$ with rational coefficients is called $p$-[i]good[/i] if and only if there exist three integers $a,b,$ and $c$ such that $0 \le a < b < c < \tfrac{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.$
A subset $S$ of the set $\{1, 2, \ldots, 10\}$ is chosen randomly, with all possible subsets being equally likely. Compute the expected number of positive integers which divide the product of the elements of $S.$ (By convention, the product of the elements of the empty set is $1.$)
Compute the number of even positive integers $n \le 2024$ such that $1, 2, \ldots, n$ can be split into $\tfrac{n}{2}$ pairs, and the sum of the numbers in each pair is a multiple of $3.$
Let $ABC$ be a triangle with circumradius $12$, and denote the orthocenter and circumcenter as $H$ and $O$ respectively. Define $H_A \neq A$ to be the intersection of line $AH$ and the circumcircle of $ABC$. Given that $\overline{OH} \parallel \overline{BC}$ and $\overline{AO} \parallel \overline{BH_A}$, find $AH_A$.
Compute $$\frac{20+\frac{1}{25-\frac{1}{20}}}{25+\frac{1}{20-\frac{1}{25}}}.$$
In the electoral college, each of $51$ places get some positive number of electoral votes for a nationwide total of $538$. Thus, $270$ electoral votes guarantees a win. Across all distributions of electoral votes to each place, let $M$ be the maximum number of sets of places that combine to have at least $270$ electoral votes. Find $M$.
Suppose $j$, $x$, and $u$ are positive real numbers such that $jxu=20$ and $x+u=24$. Find the minimum possible value of $j\max(x,u)$.
An ordered pair $(a,b)$ of positive integers is called [i]spicy[/i] if $\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.
Let $n$ be a positive integer, and let $s$ be the sum of the digits of the base-four representation of $2^n-1.$ If $s=2023$ (in base ten), compute $n$ (in base ten).
A subset $S$ of $\{1, 2, 3, \ldots, 2025\}$ is called [i]balanced[/i] if for all elements $a$ and $b$ both in $S,$ there exists an element $c$ in $S$ such that $2025$ divides $a+b-2c.$ Compute the number of [i]nonempty[/i] balanced sets.