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 $\mathcal{P}$ be the unique parabola in the $xy$-plane which is tangent to the $x$-axis at $(5,0)$ and to the $y$-axis at $(0,12)$. We say a line $\ell$ is $\mathcal{P}$-friendly if the $x$-axis, $y$-axis, and $\mathcal{P}$ divide $\ell$ into three segments, each of which has equal length. If the sum of the slopes of all $\mathcal{P}$-friendly lines can be written in the form $-\tfrac mn$ for $m$ and $n$ positive relatively prime integers, find $m+n$.
Find the maximum value for the area of a heptagon with all vertices on a circle and two diagonals perpendicular.
Let $n$ be a positive integer number. If $S$ is a finite set of vectors in the plane, let $N(S)$ denote the number of two-element subsets $\{\mathbf{v}, \mathbf{v'}\}$ of $S$ such that \[4\,(\mathbf{v} \cdot \mathbf{v'}) + (|\mathbf{v}|^2 - 1)(|\mathbf{v'}|^2 - 1) < 0. \] Determine the maximum of $N(S)$ when $S$ runs through all $n$-element sets of vectors in the plane. [i]***[/i]
The football tournament was played in one round. $3$ points were given for a win, $1$ point for a draw, and $0$ points for a loss. Could it be that the first place team under the old scoring system (win - $2$ points, draw - $1$ point, loss - $0$) would be last?
Suppose that $k$ is a natural number. Prove that there exists a prime number in $\mathbb Z_{[i]}$ such that every other prime number in $\mathbb Z_{[i]}$ has a distance at least $k$ with it.
Let $C$ be an interior point of line segment $AB$. Equilateral triangles $ADC$ and $CEB$ are constructed to the same side from $AB$. Find all points which can be the midpoint of the segment $DE$.
Derek the Dolphin and Kevin the Frog are playing a game where they take turns taking coins from a stack of $N$ coins, except with one rule: The number of coins someone takes each turn must be a power of $6$. The person who cannot take any more coins loses. If Derek goes first, how many integers $N$ from $1$ to $6^{2021}$ inclusive will guarantee him a win? (Example: If $N = 37$, then a possible sequence of turns is: Derek takes one coin, Kevin takes $36$ coins, and Kevin wins.)
Let $P$ be the set of prime numbers. Consider a subset $M$ of $P$ with at least three elements. We assume that, for each non empty and finite subset $A$ of $M$, with $A \neq M$, the prime divisors of the integer $( \prod_{p \in A} ) - 1$ belong to $M$. Prove that $M = P$.
Function $f$ satisfies the equation $f(\cos x) = \cos (17x)$. Prove that it also satisfies the equation $f(\sin x) = \sin (17x)$.
A tennis competition takes place over four days, the number of participants is $2n$ with $n \ge 5$. Each participant plays exactly once a day (a couple of participants may be more times). Prove that such competition can end with exactly one winner and exactly three players in second place and such that there are no players with four lost games,
Let $ABCD$ a quadrilateral inscribed in a circumference, $l_1$ the parallel to $BC$ through $A$, and $l_2$ the parallel to $AD$ through $B$. The line $DC$ intersects $l_1$ and $l_2$ at $E$ and $F$, respectively. The perpendicular to $l_1$ through $A$ intersects $BC$ at $P$, and the perpendicular to $l_2$ through $B$ cuts $AD$ at $Q$. Let $\Gamma_1$ and $\Gamma_2$ be the circumferences that pass through the vertex of triangles $ADE$ and $BFC$, respectively. Prove that $\Gamma_1$ and $\Gamma_2$ are tangent to each other if and only if $DP$ is perpendicular to $CQ$.
In the interior of a square $ABCD$ we construct the equilateral triangles $ABK, BCL, CDM, DAN.$ Prove that the midpoints of the four segments $KL, LM, MN, NK$ and the midpoints of the eight segments $AK, BK, BL, CL, CM, DM, DN, AN$ are the 12 vertices of a regular dodecagon.
Let $x, y,$ and $N$ be real numbers, with $y$ nonzero, such that the sets $\{(x+y)^2, (x-y)^2, xy, x/y\}$ and $\{4, 12.8, 28.8, N\}$ are equal. Compute the sum of the possible values of $N.$
Let \( I \) and \( M \) be the incenter and the centroid of a scalene triangle \( ABC \), respectively. A line passing through point \( I \) parallel to \( BC \) intersects \( AC \) and \( AB \) at points \( E \) and \( F \), respectively. Reconstruct triangle \( ABC \) given only the marked points \( E, F, I, \) and \( M \). [i]Proposed by Hryhorii Filippovskyi[/i]
The shorthand of a clock has the length 3, the longhand has the length 4. Determine the distance between the endpoints of the hands at the time, where their distance increases the most.
Tuesday’s high temperature was 4°C warmer than that of Monday’s. Wednesday’s high temperature was 6°C cooler than that of Monday’s. If Tuesday’s high temperature was 22°C, what was Wednesday’s high temperature? $\textbf{(A)}\ 20 \qquad \textbf{(B)}\ 24 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 32 \qquad \textbf{(E)}\ 16$
Let $\alpha$ be an arbitrary angle and let $x = cos\alpha, y = cosn\alpha$ ($n \in Z$). i) Prove that to each value $x \in [-1, 1]$ corresponds one and only one value of $y$. Thus we can write $y$ as a function of $x, y = T_n(x)$. Compute $T_1(x), T_2(x)$ and prove that $T_{n+1}(x) = 2xT_n(x) - T_{n-1}(x)$. From this it follows that $T_n(x)$ is a polynomial of degree $n$. ii) Prove that the polynomial $T_n(x$) has $n$ distinct roots in $[-1, 1]$.
Let $a$ and $b$ be positive integers such that $\text{gcd}(a, b) + \text{lcm}(a, b)$ is a multiple of $a+1$. If $b \le a$, show that $b$ is a perfect square.
The number of cubic feet in the volume of a cube is the same as the number of square inches in its surface area. The length of the edge expressed as a number of feet is $\textbf{(A) }6\qquad\textbf{(B) }864\qquad\textbf{(C) }1728\qquad\textbf{(D) }6\times 1728\qquad \textbf{(E) }2304$
Let $n$ be a positive with $n\geq 3$. Consider a board of $n \times n$ boxes. In each step taken the colors of the $5$ boxes that make up the figure bellow change color (black boxes change to white and white boxes change to black) The figure can be rotated $90°, 180°$ or $270°$. Firstly, all the boxes are white.Determine for what values of $n$ it can be achieved, through a series of steps, that all the squares on the board are black.
Suppose that a sequence $a_0, a_1, \ldots$ of real numbers is defined by $a_0=1$ and \[a_n=\begin{cases}a_{n-1}a_0+a_{n-3}a_2+\cdots+a_0a_{n-1} & \text{if }n\text{ odd}\\a_{n-1}a_1+a_{n-3}a_3+\cdots+a_1a_{n-1} & \text{if }n\text{ even}\end{cases}\] for $n\geq1$. There is a positive real number $r$ such that \[a_0+a_1r+a_2r^2+a_3r^3+\cdots=\frac{5}{4}.\] If $r$ can be written in the form $\frac{a\sqrt{b}-c}{d}$ for positive integers $a,b,c,d$ such that $b$ is not divisible by the square of any prime and $\gcd (a,c,d)=1,$ then compute $a+b+c+d$. [i]Proposed by Tristan Shin[/i]
Point $P$ lies inside of parallelogram $ABCD$. Perpendicular lines to $PA,PB,PC$ and $PD$ through $A,B,C$ and $D$ construct convex quadrilateral $XYZT$. Prove that $S_{XYZT}\geq 2S_{ABCD}$. [i]Proposed by Siamak Ahmadpour[/i]
Today is Barbara's birthday, and Alberto wants to give her a gift playing the following game. The numbers 0,1,2,...,1024 are written on a blackboard. First Barbara erases $2^{9}$ numbers, then Alberto erases $2^{8}$ numbers, then Barbara $2^{7}$ and so on, until there are only two numbers a,b left. Now Barbara earns $|a-b|$ euro. Find the maximum number of euro that Barbara can always win, independently of Alberto's strategy.
Let $\Gamma$ be a circle with center $O$ and $AE$ be a diameter. Point $D$ lies on segment $OE$ and point $B$ is the midpoint of one of the arcs $\widehat{AE}$ of $\Gamma$. Construct point $C$ such that $ABCD$ is a parallelogram. Lines $EB$ and $CD$ meet at $F$. Line $OF$ meets the minor arc $\widehat{EB}$ at $I$. Prove that $EI$ bisects $\angle BEC$.
Every positive integer greater than $1000$ is colored in red or blue, such that the product of any two distinct red numbers is blue. Is it possible to happen that no two blue numbers have difference $1$?