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

Let $1,7,19,\ldots$ be the sequence of numbers such that for all integers $n\ge 1$, the average of the first $n$ terms is equal to the $n$th perfect square. Compute the last three digits of the $2021$st term in the sequence. [i]Proposed by Nathan Xiong[/i]
A donkey suffers an attack of hiccups and the first hiccup happens at $\text{4:00}$ one afternoon. Suppose that the donkey hiccups regularly every $5$ seconds. At what time does the donkey’s $\text{700th}$ hiccup occur? $\textbf{(A) }$ $15$ seconds after $\text{4:58}$ $\textbf{(B) }$ $20$ seconds after $\text{4:58}$ $\textbf{(C)}$ $25$ seconds after $\text{4:58}$ $\textbf{(D) }$ $30$ seconds after $\text{4:58}$ $\textbf{(E) }$ $35$ seconds after $\text{4:58}$
The sequence $a_{1},a_{2},\cdots,a_{2010}$ has the following properties: (1) each sum of the 20 successive values of the sequence is nonnegative, (2) $|a_{i}a_{i+1}| \leq 1$ for $i=1,2,\cdots,2009$. Determine the maximal value of the expression $\sum_{i=1}^{2010}a_{i}$.
[b]p1.[/b] There are $2000$ cans of paint. Show that at least one of the following two statements must be true. There are at least $45$ cans of the same color. There are at least $45$ cans all of different colors. [b]p2.[/b] The measures of the $3$ angles of one triangle are all different from each other but are the same as the measures of the $3$ angles of a second triangle. The lengths of $2$ sides of the first triangle are different from each other but are the same as the lengths of $2$ sides of the second triangle. Must the length of the remaining side of the first triangle be the same as the length of the remaining side of the second triangle? If yes, prove it. If not, provide an example. [b]p3.[/b] Consider the sequence $a_1=1$, $a_2=2$, $a_3=5/2$, ... satisfying $a_{n+1}=a_n+(a_n)^{-1}$ for $n>1$. Show that $a_{10000}>141$. [b]p4.[/b] Prove that no matter how $250$ points are placed in a disk of radius $1$, there is a disk of radius $1/10$ that contains at least $3$ of the points. [b]p5.[/b] Prove that: Given any $11$ integers (not necessarily distinct), one can select $6$ of them so that their sum is divisible by $6$. Given any $71$ integers (not necessarily distinct), one can select $36$ of them so that their sum is divisible by $36$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
[b]p1.[/b] Find $20 \cdot 18 + 20 + 18 + 1$. [b]p2.[/b] Suzie’s Ice Cream has $10$ flavors of ice cream, $5$ types of cones, and $5$ toppings to choose from. An ice cream cone consists of one flavor, one cone, and one topping. How many ways are there for Sebastian to order an ice cream cone from Suzie’s? [b]p3.[/b] Let $a = 7$ and $b = 77$. Find $\frac{(2ab)^2}{(a+b)^2-(a-b)^2}$ . [b]p4.[/b] Sebastian invests $100,000$ dollars. On the first day, the value of his investment falls by $20$ percent. On the second day, it increases by $25$ percent. On the third day, it falls by $25$ percent. On the fourth day, it increases by $60$ percent. How many dollars is his investment worth by the end of the fourth day? [b]p5.[/b] Square $ABCD$ has side length $5$. Points $K,L,M,N$ are on segments $AB$,$BC$,$CD$,$DA$ respectively,such that $MC = CL = 2$ and $NA = AK = 1$. The area of trapezoid $KLMN$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p6.[/b] Suppose that $p$ and $q$ are prime numbers. If $p + q = 30$, find the sum of all possible values of $pq$. [b]p7.[/b] Tori receives a $15 - 20 - 25$ right triangle. She cuts the triangle into two pieces along the altitude to the side of length $25$. What is the difference between the areas of the two pieces? [b]p8.[/b] The factorial of a positive integer $n$, denoted $n!$, is the product of all the positive integers less than or equal to $n$. For example, $1! = 1$ and $5! = 120$. Let $m!$ and $n!$ be the smallest and largest factorial ending in exactly $3$ zeroes, respectively. Find $m + n$. [b]p9.[/b] Sam is late to class, which is located at point $B$. He begins his walk at point $A$ and is only allowed to walk on the grid lines. He wants to get to his destination quickly; how many paths are there that minimize his walking distance? [img]https://cdn.artofproblemsolving.com/attachments/a/5/764e64ac315c950367357a1a8658b08abd635b.png[/img] [b]p10.[/b] Mr. Iyer owns a set of $6$ antique marbles, where $1$ is red, $2$ are yellow, and $3$ are blue. Unfortunately, he has randomly lost two of the marbles. His granddaughter starts drawing the remaining $4$ out of a bag without replacement. She draws a yellow marble, then the red marble. Suppose that the probability that the next marble she draws is blue is equal to $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positiveintegers. What is $m + n$? [b]p11.[/b] If $a$ is a positive integer, what is the largest integer that will always be a factor of $(a^3+1)(a^3+2)(a^3+3)$? [b]p12.[/b] What is the largest prime number that is a factor of $160,401$? [b]p13.[/b] For how many integers $m$ does the equation $x^2 + mx + 2018 = 0$ have no real solutions in $x$? [b]p14.[/b] What is the largest palindrome that can be expressed as the product of two two-digit numbers? A palindrome is a positive integer that has the same value when its digits are reversed. An example of a palindrome is $7887887$. [b]p15.[/b] In circle $\omega$ inscribe quadrilateral $ADBC$ such that $AB \perp CD$. Let $E$ be the intersection of diagonals $AB$ and $CD$, and suppose that $EC = 3$, $ED = 4$, and $EB = 2$. If the radius of $\omega$ is $r$, then $r^2 =\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Determine $m + n$. [b]p16.[/b] Suppose that $a, b, c$ are nonzero real numbers such that $2a^2 + 5b^2 + 45c^2 = 4ab + 6bc + 12ca$. Find the value of $\frac{9(a + b + c)^3}{5abc}$ . [b]p17.[/b] Call a positive integer n spicy if there exist n distinct integers $k_1, k_2, ... , k_n$ such that the following two conditions hold: $\bullet$ $|k_1| + |k_2| +... + |k_n| = n2$, $\bullet$ $k_1 + k_2 + ...+ k_n = 0$. Determine the number of spicy integers less than $10^6$. [b]p18.[/b] Consider the system of equations $$|x^2 - y^2 - 4x + 4y| = 4$$ $$|x^2 + y^2 - 4x - 4y| = 4.$$ Find the sum of all $x$ and $y$ that satisfy the system. [b]p19.[/b] Determine the number of $8$ letter sequences, consisting only of the letters $W,Q,N$, in which none of the sequences $WW$, $QQQ$, or $NNNN$ appear. For example, $WQQNNNQQ$ is a valid sequence, while $WWWQNQNQ$ is not. [b]p20.[/b] Triangle $\vartriangle ABC$ has $AB = 7$, $CA = 8$, and $BC = 9$. Let the reflections of $A,B,C$ over the orthocenter H be $A'$,$B'$,$C'$. The area of the intersection of triangles $ABC$ and $A'B'C'$ can be expressed in the form $\frac{a\sqrt{b}}{c}$ , where $b$ is squarefree and $a$ and $c$ are relatively prime. determine $a+b+c$. (The orthocenter of a triangle is the intersection of its three altitudes.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let us consider an infinite grid plane as shown below. We start with 4 points $A$, $B$, $C$, $D$, that form a square. We perform the following operation: We pick two points $X$ and $Y$ from the currant points. $X$ is reflected about $Y$ to get $X'$. We remove $X$ and add $X'$ to get a new set of 4 points and treat it as our currant points. For example in the figure suppose we choose $A$ and $B$ (we can choose any other pair too). Then reflect $A$ about $B$ to get $A'$. We remove $A$ and add $A'$. Thus $A'$, $B$, $C$, $D$ is our new 4 points. We may again choose $D$ and $A'$ from the currant points. Reflect $D$ about $A'$ to obtain $D'$ and hence $A'$, $B$, $C$, $D'$ are now new set of points. Then similar operation is performed on this new 4 points and so on. Starting with $A$, $B$, $C$, $D$ can you get a bigger square by some sequence of such operations?
[b]p1.[/b] How many subsets of $\{D,U,K,E\}$ have an odd number of elements? [b]p2.[/b] Find the coefficient of $x^{12}$ in $(1 + x^2 + x^4 +... + x^{28})(1 + x + x^2 + ...+ x^{14})^2$. [b]p3.[/b] How many $4$-digit numbers have their digits in non-decreasing order from left to right? [b]p4.[/b] A dodecahedron (a polyhedron with $12$ faces, each a regular pentagon) is projected orthogonally onto a plane parallel to one of its faces to form a polygon. Find the measure (in degrees) of the largest interior angle of this polygon. [b]p5.[/b] Justin is back with a $6\times 6$ grid made of $36$ colorless squares. Dr. Kraines wants him to color some squares such that $\bullet$ Each row and column of the grid must have at least one colored square $\bullet$ For each colored square, there must be another colored square on the same row or column What is the minimum number of squares that Justin will have to color? [b]p6.[/b] Inside a circle $C$, we have three equal circles $C_1$, $C_2$, $C_3$, which are pairwise externally tangent to each other and all internally tangent to $C$. What is the ratio of the area of $C_1$ to the area of $C$? [b]p7.[/b] There are $3$ different paths between the Duke Chapel and the Physics building. $6$ students are heading towards the Physics building for a class, so they split into $3$ pairs and each pair takes a separate path from the Chapel. After class, they again split into $3$ pairs and take separate paths back. Find the number of possible scenarios where each student's companion on the way there is different from their companion on the way back. [b]p8.[/b] Let $a_n$ be a sequence that satisfies the recurrence relation $$a_na_{n+2} =\frac{\cos (3a_{n+1})}{\cos (a_{n+1})[2 \cos(2a_{n+1}) - 1]}a_{n+1}$$ with $a_1 = 2$ and $a_2 = 3$. Find the value of $2018a_{2017}$. [b]p9.[/b] Let $f(x)$ be a polynomial with minimum degree, integer coefficients, and leading coefficient of $1$ that satisfies $f(\sqrt7 +\sqrt{13})= 0$. What is the value of $f(10)$? [b]p10.[/b] $1024$ Duke students, indexed $1$ to $1024$, are having a chat. For each $1 \le i \le 1023$, student $i$ claims that student $2^{\lfloor \log_2 i\rfloor +1}$ has a girlfriend. ($\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.) Given that exactly $201$ people are lying, find the index of the $61$st liar (ordered by index from smallest to largest). PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $n\geq 3$ be an integer. Find the number of ways in which one can place the numbers $1, 2, 3, \ldots, n^2$ in the $n^2$ squares of a $n \times n$ chesboard, one on each, such that the numbers in each row and in each column are in arithmetic progression.
Alison has an analog clock whose hands have the following lengths: $a$ inches (the hour hand), $b$ inches (the minute hand), and $c$ inches (the second hand), with $a < b < c$. The numbers $a$, $b$, and $c$ are consecutive terms of an arithmetic sequence. The tips of the hands travel the following distances during a day: $A$ inches (the hour hand), $B$ inches (the minute hand), and $C$ inches (the second hand). The numbers $A$, $B$, and $C$ (in this order) are consecutive terms of a geometric sequence. What is the value of $\frac{B}{A}$?
The sequence $(x_n)_{n\in\mathbb N}$ is defined by $x_1=x_2=1$, $x_{n+2}=14x_{n+1}-x_n-4$ for each $n\in\mathbb N$. Prove that all terms of this sequence are perfect squares.
Let $m$ be a fixed positive integer. The infinite sequence $\{a_n\}_{n\geq 1}$ is defined in the following way: $a_1$ is a positive integer, and for every integer $n\geq 1$ we have $$a_{n+1} = \begin{cases}a_n^2+2^m & \text{if } a_n< 2^m \\ a_n/2 &\text{if } a_n\geq 2^m\end{cases}$$ For each $m$, determine all possible values of $a_1$ such that every term in the sequence is an integer.
Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom
Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]
The positive integers $x_1, \cdots , x_n$, $n \geq 3$, satisfy $x_1 < x_2 <\cdots< x_n < 2x_1$. Set $P = x_1x_2 \cdots x_n.$ Prove that if $p$ is a prime number, $k$ a positive integer, and $P$ is divisible by $pk$, then $\frac{P}{p^k} \geq n!.$
A sequence of positive integers with $a_1=1$ and $a_9+a_{10}=646$ is formed so that the first three terms are in geometric progression, the second, third, and fourth terms are in arithmetic progression, and, in general, for all $n\ge1$, the terms $a_{2n-1}$, $a_{2n}$, $a_{2n+1}$ are in geometric progression, and the terms $a_{2n}$, $a_{2n+1}$, and $a_{2n+2}$ are in arithmetic progression. Let $a_n$ be the greatest term in this sequence that is less than 1000. Find $n+a_n$.
Let $F$ is the set of all sequences $\{(a_1, a_2, . . . , a_{2020})\}$ with $a_i \in \{-1, 1\}$ for all $i = 1,2,...,2020$. Prove that there exists a set $S$, such that $S \subset F$, $|S| = 2020$ and for any $(a_1,a_2,...,a_{2020}) \in F$ there exists $(b_1,b_2,...,b_{2020}) \in S$, such that $\sum_{i=1}^{2020} a_ib_i = 0$.
A token starts at the point $(0,0)$ of an $xy$-coordinate grid and them makes a sequence of six moves. Each move is $1$ unit in a direction parallel to one of the coordinate axes. Each move is selected randomly from the four possible directions and independently of the other moves. The probability the token ends at a point on the graph of $|y|=|x|$ is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Let $n\ge 3$ be an integer and $a_1,a_2,\dots ,a_n$ be a finite sequence of positive integers, such that, for $k=2,3,\dots ,n$ $$n(a_k+1)-(n-1)a_{k-1}=1.$$ Prove that $a_n$ is not divisible by $(n-1)^2$.
Let $a_1,\ldots,a_8$ be reals, not all equal to zero. Let \[ c_n = \sum^8_{k=1} a^n_k\] for $n=1,2,3,\ldots$. Given that among the numbers of the sequence $(c_n)$, there are infinitely many equal to zero, determine all the values of $n$ for which $c_n = 0.$
Let $\{a_n\}_{n\geq 1}$ be a sequence defined by $a_n=\int_0^1 x^2(1-x)^ndx$. Find the real value of $c$ such that $\sum_{n=1}^{\infty} (n+c)(a_n-a_{n+1})=2.$
A sequence of complex numbers $ z_0,z_1,z_2,....$ is defined by the rule \[ z_{n \plus{} 1} \equal{} \frac {i z_n}{\overline{z_n}} \]where $ \overline{z_n}$ is the complex conjugate of $ z_n$ and $ i^2 \equal{} \minus{} 1$. Suppose that $ |z_0| \equal{} 1$ and $ z_{2005} \equal{} 1$. How many possible values are there for $ z_0$? $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 2\qquad \textbf{(C)}\ 4\qquad \textbf{(D)}\ 2005\qquad \textbf{(E)}\ 2^{2005}$
Let $a_1=24$ and form the sequence $a_n$, $n\geq 2$ by $a_n=100a_{n-1}+134$. The first few terms are $$24,2534,253534,25353534,\ldots$$ What is the least value of $n$ for which $a_n$ is divisible by $99$?
A set of $n$ points in Euclidean 3-dimensional space, no four of which are coplanar, is partitioned into two subsets $\mathcal{A}$ and $\mathcal{B}$. An $\mathcal{AB}$-tree is a configuration of $n-1$ segments, each of which has an endpoint in $\mathcal{A}$ and an endpoint in $\mathcal{B}$, and such that no segments form a closed polyline. An $\mathcal{AB}$-tree is transformed into another as follows: choose three distinct segments $A_1B_1$, $B_1A_2$, and $A_2B_2$ in the $\mathcal{AB}$-tree such that $A_1$ is in $\mathcal{A}$ and $|A_1B_1|+|A_2B_2|>|A_1B_2|+|A_2B_1|$, and remove the segment $A_1B_1$ to replace it by the segment $A_1B_2$. Given any $\mathcal{AB}$-tree, prove that every sequence of successive transformations comes to an end (no further transformation is possible) after finitely many steps.
Let $S_n$ be the sum of the first $n$ term of an arithmetic sequence that has a common difference of $2$. The quotient $\frac{S_{3n}}{S_n}$ does not depend on $n$. What is $S_{20}$? $\textbf{(A) } 340 \qquad \textbf{(B) } 360 \qquad \textbf{(C) } 380 \qquad \textbf{(D) } 400 \qquad \textbf{(E) } 420$
Let $a$ and $b$ be real numbers with $a<b,$ and let $f$ and $g$ be continuous functions from $[a,b]$ to $(0,\infty)$ such that $\int_a^b f(x)\,dx=\int_a^b g(x)\,dx$ but $f\ne g.$ For every positive integer $n,$ define \[I_n=\int_a^b\frac{(f(x))^{n+1}}{(g(x))^n}\,dx.\] Show that $I_1,I_2,I_3,\dots$ is an increasing sequence with $\displaystyle\lim_{n\to\infty}I_n=\infty.$