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

Let $ p,q,n$ be three positive integers with $ p \plus{} q < n$. Let $ (x_{0},x_{1},\cdots ,x_{n})$ be an $ (n \plus{} 1)$-tuple of integers satisfying the following conditions : (a) $ x_{0} \equal{} x_{n} \equal{} 0$, and (b) For each $ i$ with $ 1\leq i\leq n$, either $ x_{i} \minus{} x_{i \minus{} 1} \equal{} p$ or $ x_{i} \minus{} x_{i \minus{} 1} \equal{} \minus{} q$. Show that there exist indices $ i < j$ with $ (i,j)\neq (0,n)$, such that $ x_{i} \equal{} x_{j}$.
Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a continuous and bounded function such that \[x\int_{x}^{x+1}f(t)\, \text{d}t=\int_{0}^{x}f(t)\, \text{d}t,\quad\text{for any}\ x\in\mathbb{R}.\] Prove that $f$ is a constant function.
[b]p1.[/b] Evaluate $1^2 - 2^2 + 3^2 - 4^2 + ...+ 19^2 - 20^2 + 21^2$. [b]p2.[/b] Kevin is playing in a table-tennis championship against Vincent. Kevin wins the championship if he wins two matches against Vincent, while Vincent must win three matches to win the championship. Given that both players have a $50\%$ chance of winning each match and there are no ties, the probability that Vincent loses the championship can be written in the form $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]p3.[/b] For how many positive integers $n$ less than $2000$ is $n^{3n}$ a perfect fourth power? [b]p4.[/b] Given that a coin of radius $\sqrt{3}$ cm is tossed randomly onto a plane tiled by regular hexagons of side length $14$ cm, the chance that it lands strictly inside of a hexagon can be written in the form $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [b]p5.[/b] Given that $A,C,E,I, P,$ and $M$ are distinct nonzero digits such that $$EPIC + EMCC + AMC = PEACE,$$ what is the least possible value of $PEACE$? [b]p6.[/b] A palindrome is a number that reads the same forwards and backwards. Call a number palindrome-ish if it is not a palindrome but we can make it a palindrome by changing one digit (we cannot change the first digit to zero). For instance, $4009$ is palindrome-ish because we can change the $4$ to a $9$. How many palindrome-ish four-digit numbers are there? [b]p7.[/b] Given that the heights of triangle $ABC$ have lengths $\frac{15}{7}$ , $5$, and $3$, what is the square of the area of $ABC$? [b]p8.[/b] Suppose that cubic polynomial $P(x)$ has leading coecient $1$ and three distinct real roots in the interval $[-20, 2]$. Given that the equation $P\left(x + \frac{1}{x} \right) = 0$ has exactly two distinct real solutions, the range of values that $P(3)$ can take is the open interval $(a, b)$. Compute $b - a$. [b]p9.[/b] Vincent the Bug has $17$ students in his class lined up in a row. Every day, starting on January $1$, $2021$, he performs the same series of swaps between adjacent students. One example of a series of swaps is: swap the $4$th and the $5$th students, then swap the $2$nd and the $3$rd, then the $3$rd and the $4$th. He repeats this series of swaps every day until the students are in the same arrangement as on January $1$. What is the greatest number of days this process could take? [b]p10.[/b] The summation $$\sum^{18}_{i=1}\frac{1}{i}$$ can be written in the form $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Compute the number of divisors of $b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
In $\vartriangle ABC$, let $D$ be on $BC$ such that $\overline{AD} \perp \overline{BC}$. Suppose also that $\tan B = 4 \sin C$, $AB^2 +CD^2 = 17$, and $AC^2 + BC^2 = 21$. Find the measure of $\angle C$ in degrees between $0^o$ and $180^o$ .
Find the maximum number of rectangles with sides equal to 1 and 2 and parallel to the coordinate axes such that each two have an area equal to 1 in common.
2010 MOPpers are assigned numbers 1 through 2010. Each one is given a red slip and a blue slip of paper. Two positive integers, A and B, each less than or equal to 2010 are chosen. On the red slip of paper, each MOPper writes the remainder when the product of A and his or her number is divided by 2011. On the blue slip of paper, he or she writes the remainder when the product of B and his or her number is divided by 2011. The MOPpers may then perform either of the following two operations: [list] [*] Each MOPper gives his or her red slip to the MOPper whose number is written on his or her blue slip. [*] Each MOPper gives his or her blue slip to the MOPper whose number is written on his or her red slip.[/list] Show that it is always possible to perform some number of these operations such that each MOPper is holding a red slip with his or her number written on it. [i]Brian Hamrick.[/i]
Prove that there exist infinitely many positive integers $n$ such that the number $\frac{1^2+2^2+\cdots+n^2}{n}$ is a perfect square. Obviously, $1$ is the least integer having this property. Find the next two least integers having this property.
1) The numbers $1,2,3,\ldots,2010$ are written on the blackboard. Two players in turn erase some two numbers and replace them with one number. The first player replaces numbers $a$ and $b$ with $ab-a-b$ while the second player replaces them with $ab+a+b.$ The game ends when a single number remains on the blackboard. If this number is smaller than $1\cdot2\cdot3\cdot\ldots\cdot2010$ then the first player wins. Otherwise the second player wins. Which of the players has a winning strategy? 2) The numbers $1,2,3,\ldots,2010$ are written on the blackboard. Two players in turn erase some two numbers and replace them with one number. The first player replaces numbers $a$ and $b$ with $ab-a-b+2$ while the second player replaces them with $ab+a+b.$ The game ends when a single number remains on the blackboard. If this number is smaller than $1\cdot2\cdot3\cdot\ldots\cdot2010$ then the first player wins. Otherwise the second player wins. Which of the players has a winning strategy?
Determine all functions $f:(0,\infty)\to\mathbb{R}$ satisfying $$\left(x+\frac{1}{x}\right)f(y)=f(xy)+f\left(\frac{y}{x}\right)$$ for all $x,y>0$.
A palindrome is a nonnegative integer number that reads the same forwards and backwards when written in base 10 with no leading zeros. A 6-digit palindrome $n$ is chosen uniformly at random. What is the probability that $\frac{n}{11}$ is also a palindrome? $ \textbf{(A)} \ \frac{8}{25} \qquad \textbf{(B)} \ \frac{33}{100} \qquad \textbf{(C)} \ \frac{7}{20} \qquad \textbf{(D)} \ \frac{9}{25} \qquad \textbf{(E)} \ \frac{11}{30}$
Convex octagon $AC_1BA_1CB_1$ satisfies: $AB_1=AC_1$, $BC_1=BA_1$, $CA_1=CB_1$ and $\angle{A}+\angle{B}+\angle{C}=\angle{A_1}+\angle{B_1}+\angle{C_1}$. Prove that the area of $\triangle{ABC}$ is equal to half the area of the octagon.
On the graphic of the function $y=x^2$ were selected $1000$ pairwise distinct points, abscissas of which are integer numbers from the segment $[0; 100000]$. Prove that it is possible to choose six different selected points $A$, $B$, $C$, $A'$, $B'$, $C'$ such that areas of triangles $ABC$ and $A'B'C'$ are equals. [i]A. Tereshin[/i]
Let $ABC$ be an acute-angled triangle with $AB \neq AC$, circumcentre $O$ and circumcircle $\Gamma$. Let the tangents to $\Gamma$ at $B$ and $C$ meet each other at $D$, and let the line $AO$ intersect $BC$ at $E$. Denote the midpoint of $BC$ by $M$ and let $AM$ meet $\Gamma$ again at $N \neq A$. Finally, let $F \neq A$ be a point on $\Gamma$ such that $A, M, E$ and $F$ are concyclic. Prove that $FN$ bisects the segment $MD$.
Just wondering: what exactly is Power of a Point?
Let $G$ be the centroid of triangle $ABC$, and $A'$ the symmetric of $A$ wrt $C$. Show that $G, B, C, A'$ are concyclic if and only if $GA \perp GC$.
Let $I_B, I_C$ be the $B, C$-excenters of triangle $ABC$, respectively. Let $O$ be the circumcenter of $ABC$. If $BI_B$ is perpendicular to $AO$, $AI_C = 3$ and $AC = 4\sqrt2$, then $AB^2$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. Note: In triangle $\vartriangle ABC$, the $A$-excenter is the intersection of the exterior angle bisectors of $\angle ABC$ and $\angle ACB$. The $B$-excenter and $C$-excenter are defined similarly.
Find all real numbers $ a,b,c,d$ such that \[ \left\{\begin{array}{cc}a \plus{} b \plus{} c \plus{} d \equal{} 20, \\ ab \plus{} ac \plus{} ad \plus{} bc \plus{} bd \plus{} cd \equal{} 150. \end{array} \right.\]
Given a chessboard that is infinite in all directions. Is it possible to place an infinite number of queens on it so that on each horizontally, on each vertical and on each diagonal of both directions (i.e. on a set of cells located at an angle of $45^o$ or $135^o$ to the horizontal) was exactly one queen?
For each positive integer $ n$, the mean of the first $ n$ terms of a sequence is $ n$. What is the $ 2008$th term of the sequence? $ \textbf{(A)}\ 2008 \qquad \textbf{(B)}\ 4015 \qquad \textbf{(C)}\ 4016 \qquad \textbf{(D)}\ 4,030,056 \qquad \textbf{(E)}\ 4,032,064$
How many $f:\mathbb{R} \rightarrow \mathbb{R}$ are there satisfying $f(x)f(y)f(z)=12f(xyz)-16xyz$ for every real $x,y,z$? $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 1 \qquad \textbf{(D)}\ 0 \qquad \textbf{(E)}\ \text{None}$
A circle is tangential to sides $AB$ and $AD$ of convex quadrilateral $ABCD$ at $G$ and $H$ respectively, and cuts diagonal $AC$ at $E$ and $F$. What are the necessary and sufficient conditions such that there exists another circle which passes through $E$ and $F$, and is tangential to $DA$ and $DC$ extended?
The digits of the three-digit integers $a, b,$ and $c$ are the nine nonzero digits $1,2,3,\cdots 9$ each of them appearing exactly once. Given that the ratio $a:b:c$ is $1:3:5$, determine $a, b,$ and $c$.
Circles $\omega_1$ and $\omega_2$ inscribed into equal angles $X_1OY$ and $Y OX_2$ touch lines $OX_1$ and $OX_2$ at points $A_1$ and $A_2$ respectively. Also they touch $OY$ at points $B_1$ and $B_2$. Let $C_1$ be the second common point of $A_1B_2$ and $\omega_1, C_2$ be the second common point of $A_2B_1$ and $\omega_2$. Prove that $C_1C_2$ is the common tangent of two circles.
Consider the set $$M = \left\{\frac{a}{\overline{ba}}+\frac{b}{\overline{ab}} \, | a,b\in\{1,2,3,4,5,6,7,8,9\} \right\}.$$ a) Show that the set $M$ contains no integer. b) Find the smallest and the largest element of $M$
For any two positive integers $n$ and $p$, prove that there are exactly ${{(p+1)}^{n+1}}-{{p}^{n+1}}$ functions $f:\left\{ 1,2,...,n \right\}\to \left\{ -p,-p+1,-p+2,....,p-1,p \right\}$ such that $\left| f(i)-f(j) \right|\le p$ for all $i,j\in \left\{ 1,2,...,n \right\}$.