Found problems: 85335
2021 Nigerian MO Round 3, Problem 5
Let $f(x)=\frac{P(x)}{Q(x)}$, where $P(x), Q(x)$ are two non-constant polynomials with no common zeros and $P(0)=P(1)=0$. Suppose $f(x)f\left(\frac{1}{x}\right)=f(x)+f\left(\frac{1}{x}\right)$ for infinitely many values of $x$.
a) Show that $\text{deg}(P)<\text{deg}(Q)$.
b) Show that $P'(1)=2Q'(1)-\text{deg}(Q)\cdot Q(1)$.
Here, $P'(x)$ denotes the derivative of $P(x)$ as usual.
1995 Romania Team Selection Test, 4
A convex set $S$ on a plane, not lying on a line, is painted in $p$ colors.
Prove that for every $n \ge 3$ there exist infinitely many congruent $n$-gons whose vertices are of the same color.
1998 Iran MO (3rd Round), 3
Let $ABC$ be a given triangle. Consider any painting of points of the plane in red and green. Show that there exist either two red points on the distance $1$, or three green points forming a triangle congruent to triangle $ABC$.
2022 Princeton University Math Competition, A7
Let $\vartriangle ABC$ be a triangle with $BC = 7$, $CA = 6$, and, $AB = 5$. Let $I$ be the incenter of $\vartriangle ABC$. Let the incircle of $\vartriangle ABC$ touch sides $BC$, $CA$, and $AB$ at points $D,E$, and $F$. Let the circumcircle of $\vartriangle AEF$ meet the circumcircle of $\vartriangle ABC$ for a second time at point $X\ne A$. Let $P$ denote the intersection of $XI$ and $EF$. If the product $XP \cdot IP$ can be written as $\frac{m}{n}$ for relatively prime positive integers $m, n$, find $m + n$.
2021-2022 OMMC, 5
A frog starts a journey at $(6,9).$ A skip is the act of traveling a positive integer number of units straight south or a positive integer number of units straight west. A jump is the act of traveling one unit straight west. A hop consists of any skip followed by a jump. How many different sequences of hops can the frog take so that the frog's final destination is $(0,0)$?
[i]Proposed by Jack Ma[/i]
2006 Germany Team Selection Test, 3
Suppose we have a $n$-gon. Some $n-3$ diagonals are coloured black and some other $n-3$ diagonals are coloured red (a side is not a diagonal), so that no two diagonals of the same colour can intersect strictly inside the polygon, although they can share a vertex. Find the maximum number of intersection points between diagonals coloured differently strictly inside the polygon, in terms of $n$.
[i]Proposed by Alexander Ivanov, Bulgaria[/i]
2011 Germany Team Selection Test, 1
A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$
[i]Proposed by Gerhard Wöginger, Austria[/i]
2022 CCA Math Bonanza, L5.1
Alistar wants to wreak havoc on Jhin's yard, which is a 2D plane of grass. First, he selects a number $n$, randomly and uniformly from $[0,1]$, and then he eats all grass within $n$ meters from where he's standing. He then moves 2 meters in a random direction, and repeats his process. He stops if any of the grass that he wants to eat (or, in other words, in his intended eating territory) is already eaten. Estimate the amount of grass Alistar is expected to eat. An estimate $E$ earns $\frac{2}{1+|A-E|}$ points, where $A$ is the actual answer.
[i]2022 CCA Math Bonanza Lightning Round 5.1[/i]
MIPT Undergraduate Contest 2019, 1.4
Suppose that in a unit sphere in Euclidean space, there are $2m$ points $x_1, x_2, ..., x_{2m}.$ Prove that it's possible to partition them into two sets of $m$ points in such a way that the centers of mass of these sets are at a distance of at most $\frac{2}{\sqrt{m}}$ from one another.
2024 AMC 12/AHSME, 9
Let $M$ be the greatest integer such that both $M + 1213$ and $M + 3773$ are perfect squares. What is the units digit of $M$?
$
\textbf{(A) }1 \qquad
\textbf{(B) }2 \qquad
\textbf{(C) }3 \qquad
\textbf{(D) }6 \qquad
\textbf{(E) }8 \qquad
$
2023 CMIMC Geometry, 4
A rhombus $\mathcal R$ has short diagonal of length $1$ and long diagonal of length $2023$. Let $\mathcal R'$ be the rotation of $\mathcal R$ by $90^\circ$ about its center. If $\mathcal U$ is the set of all points contained in either $\mathcal R$ or $\mathcal R'$ (or both; this is known as the [i]union[/i] of $\mathcal R$ and $\mathcal R'$) and $\mathcal I$ is the set of all points contained in both $\mathcal R$ and $\mathcal R'$ (this is known as the [i]intersection[/i] of $\mathcal R$ and $\mathcal R'$, compute the ratio of the area of $\mathcal I$ to the area of $\mathcal U$.
[i]Proposed by Connor Gordon[/i]
1989 AMC 8, 8
$(2\times 3\times 4)\left(\frac{1}{2}+\frac{1}{3}+\frac{1}{4}\right) =$
$\text{(A)}\ 1 \qquad \text{(B)}\ 3 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 24 \qquad \text{(E)}\ 26$
2022-IMOC, G3
Let $\vartriangle ABC$ be an acute triangle. $R$ is a point on arc $BC$. Choose two points $P, Q$ on $AR$ such that $B,P,C,Q$ are concyclic. Let the second intersection of $BP$, $CP$, $BQ$, $CQ$ and the circumcircle of $\vartriangle ABC$ is $P_B$, $P_C$, $Q_B$, $Q_C$, respectively. Let the circumcenter of $\vartriangle P P_BP_C$ and $\vartriangle QQ_BQ_C$ are $O_P$ and $O_Q$, respectively. Prove that $A,O_P,O_Q,R$ are concylic.
[i]proposed by andychang[/i]
2018 HMNT, 9
$20$ players are playing in a Super Mario Smash Bros. Melee tournament. They are ranked $1-20$, and player $n$ will always beat player $m$ if $n<m$. Out of all possible tournaments where each player plays $18$ distinct other players exactly once, one is chosen uniformly at random. Find the expected number of pairs of players that win the same number of games.
1992 Irish Math Olympiad, 2
If $a_1$ is a positive integer, form the sequence $a_1,a_2,a_3,\dots$ by letting $a_2$ be the product of the digits of $a_1$, etc.. If $a_k$ consists of a single digit, for some $k\ge 1$, $a_k$ is called a [i]digital root[/i] of $a_1$. It is easy to check that every positive integer has a unique root. $($For example, if $a_1=24378$, then $a_2=1344$, $a_3=48$, $a_4=32$, $a_5=6$, and thus $6$ is the digital root of $24378.)$ Prove that the digital root of a positive integer $n$ equals $1$ if, and only if, all the digits of $n$ equal $1$.
2025 Belarusian National Olympiad, 11.5
Find the smallest positive integer $n$ such that both $n^3-n$ and $(n+1)^3-(n+1)$ are divisible by $2025$.
[i]V. Kamianetski[/i]
1999 Mongolian Mathematical Olympiad, Problem 1
The plane is divided into unit cells, and each of the cells is painted in one of two given colors. Find the minimum possible number of cells in a figure consisting of entire cells which contains each of the $16$ possible colored $2\times2$ squares.
1989 India National Olympiad, 1
Prove that the Polynomial $ f(x) \equal{} x^{4} \plus{} 26x^{3} \plus{} 56x^{2} \plus{} 78x \plus{} 1989$ can't be expressed as a product $ f(x) \equal{} p(x)q(x)$ , where $ p(x)$ and $ q(x)$ are both polynomial with integral coefficients and with degree at least $ 1$.
2010 Saint Petersburg Mathematical Olympiad, 7
Incircle of $ABC$ tangent $AB,AC,BC$ in $C_1,B_1,A_1$. $AA_1$ intersect incircle in $E$. $N$ is midpoint $B_1A_1$. $M$ is symmetric to $N$ relatively $AA_1$. Prove that $\angle EMC= 90$
2016 IMC, 1
Let $(x_1,x_2,\ldots)$ be a sequence of positive real numbers satisfying ${\displaystyle \sum_{n=1}^{\infty}\frac{x_n}{2n-1}=1}$. Prove that $$ \displaystyle \sum_{k=1}^{\infty} \sum_{n=1}^{k} \frac{x_n}{k^2} \le2. $$
(Proposed by Gerhard J. Woeginger, The Netherlands)
2009 IMO, 5
Determine all functions $ f$ from the set of positive integers to the set of positive integers such that, for all positive integers $ a$ and $ b$, there exists a non-degenerate triangle with sides of lengths
\[ a, f(b) \text{ and } f(b \plus{} f(a) \minus{} 1).\]
(A triangle is non-degenerate if its vertices are not collinear.)
[i]Proposed by Bruno Le Floch, France[/i]
2011 QEDMO 10th, 9
Let $X = Q-\{-1,0,1\}$. We consider the function $f: X\to X$ given by $f (x) = x -\frac{1}{x} .$ Is there an $a \in X$ such that for every natural number n there is a $y \in X$ with $f (f (...( f (y)) ...)) = a$ where $f$ occurs exactly $n$ times on the left side?
2022 CHMMC Winter (2022-23), Individual
[b]p1.[/b] Given any four digit number $X = \underline{ABCD}$, consider the quantity $Y(X) = 2 \cdot \underline{AB}+\underline{CD}$. For example, if $X = 1234$, then $Y(X) = 2 \cdot 12+34 = 58$. Find the sum of all natural numbers $n \le 10000$ such that over all four digit numbers $X$, the number $n$ divides $X$ if and only if it also divides $Y(X)$.
[b]p2.[/b] A sink has a red faucet, a blue faucet, and a drain. The two faucets release water into the sink at constant but different rates when turned on, and the drain removes water from the sink at a constant rate when opened. It takes $5$ minutes to fill the sink (from empty to full) when the drain is open and only the red faucet is on, it takes $10$ minutes to fill the sink when the drain is open and only the blue faucet is on, and it takes $15$ seconds to fill the sink when both faucets are on and the drain is closed. Suppose that the sink is currently one-thirds full of water, and the drain is opened. Rounded to the nearest integer, how many seconds will elapse before the sink is emptied (keeping the two faucets closed)?
[b]p3.[/b] One of the bases of a right triangular prism is a triangle $XYZ$ with side lengths $XY = 13$, $YZ = 14$, $ZX = 15$. Suppose that a sphere may be positioned to touch each of the five faces of the prism at exactly one point. A plane parallel to the rectangular face of the prism containing $\overline{YZ}$ cuts the prism and the sphere, giving rise to a cross-section of area $A$ for the prism and area $15\pi$ for the sphere. Find the sum of all possible values of $A$.
[b]p4.[/b] Albert, Brian, and Christine are hanging out by a magical tree. This tree gives each of them a stick, each of which have a non-negative real length. Say that Albert gets a branch of length $x$, Brian a branch of length $y$, and Christine a branch of length $z$, and the lengths follow the condition that $x+y+z = 2$. Let $m$ and $n$ be the minimum and maximum possible values of $xy+yz+xz-xyz$, respectively. What is $m+n$?
[b]p5.[/b] Let $S := MATHEMATICSMATHEMATICSMATHE...$ be the sequence where $7$ copies of the word $MATHEMATICS$ are concatenated together. How many ways are there to delete all but five letters of $S$ such that the resulting subsequence is $CHMMC$?
[b]p6.[/b] Consider two sequences of integers $a_n$ and $b_n$ such that $a_1 = a_2 = 1$, $b_1 = b_2 = 1$ and that the following recursive relations are satisfied for integers $n > 2$:
$$a_n = a_{n-1}a_{n-2}-b_{n-1}b_{n-2},$$
$$b_n = b_{n-1}a_{n-2}+a_{n-1}b_{n-2}.$$
Determine the value of $$\sum_{1\le n\le2023,b_n \ne 0} \frac{a_n}{b_n}.$$
[b]p7.[/b] Suppose $ABC$ is a triangle with circumcenter $O$. Let $A'$ be the reflection of $A$ across $\overline{BC}$. If $BC =12$, $\angle BAC = 60^o$, and the perimeter of $ABC$ is $30$, then find $A'O$.
[b]p8.[/b] A class of $10$ students wants to determine the class president by drawing slips of paper from a box. One of the students, Bob, puts a slip of paper with his name into the box. Each other student has a $\frac12$ probability of putting a slip of paper with their own name into the box and a $\frac12$ probability of not doing so. Later, one slip is randomly selected from the box. Given that Bob’s slip is selected, find the expected number of slips of paper in the box before the slip is selected.
[b]p9.[/b] Let $a$ and $b$ be positive integers, $a > b$, such that $6! \cdot 11$ divides $x^a -x^b$ for all positive integers $x$. What is the minimum possible value of $a+b$?
[b]p10.[/b] Find the number of pairs of positive integers $(m,n)$ such that $n < m \le 100$ and the polynomial $x^m+x^n+1$ has a root on the unit circle.
[b]p11.[/b] Let $ABC$ be a triangle and let $\omega$ be the circle passing through $A$, $B$, $C$ with center $O$. Lines $\ell_A$, $\ell_B$, $\ell_C$ are drawn tangent to $\omega$ at $A$, $B$, $C$ respectively. The intersections of these lines form a triangle $XYZ$ where $X$ is the intersection of $\ell_B$ and $\ell_C$, $Y$ is the intersection of $\ell_C$ and $\ell_A$, and $Z$ is the intersection of $\ell_A$ and $\ell_B$. Let $P$ be the intersection of lines $\overline{OX}$ and $\overline{YZ}$. Given $\angle ACB = \frac32 \angle ABC$ and $\frac{AC}{AB} = \frac{15}{16}$ , find $\frac{ZP}{YP}$.
[b]p12.[/b] Compute the remainder when $$\sum_{1\le a,k\le 2021} a^k$$ is divided by $2022$ (in the above summation $a,k$ are integers).
[b]p13.[/b] Consider a $7\times 2$ grid of squares, each of which is equally likely to be colored either red or blue. Madeline would like to visit every square on the grid exactly once, starting on one of the top two squares and ending on one of the bottom two squares. She can move between two squares if they are adjacent or diagonally adjacent. What is the probability that Madeline may visit the squares of the grid in this way such that the sequence of colors she visits is alternating (i.e., red, blue, red,... or blue, red, blue,... )?
[b]p14.[/b] Let $ABC$ be a triangle with $AB = 8$, $BC = 10$, and $CA = 12$. Denote by $\Omega_A$ the $A$-excircle of $ABC$, and suppose that $\Omega_A$ is tangent to $\overline{AB}$ and $\overline{AC}$ at $F$ and $E$, respectively. Line $\ell \ne \overline{BC}$ is tangent to $\Omega_A$ and passes through the midpoint of $\overline{BC}$. Let $T$ be the intersection of $\overline{EF}$ and $\ell$. Compute the area of triangle $ATB$.
[b]p15.[/b] For any positive integer $n$, let $D_n$ be the set of ordered pairs of positive integers $(m,d)$ such that $d$ divides $n$ and gcd$(m,n) = 1$, $1 \le m \le n$. For any positive integers $a$, $b$, let $r(a,b)$ be the non-negative remainder when $a$ is divided by $b$. Denote by $S_n$ the sum $$S_n = \sum_{(m,d)\in D_n} r(m,d).$$ Determine the value of $S_{396}$.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2018 Romania Team Selection Tests, 4
Given an non-negative integer $k$, show that there are infinitely many positive integers $n$ such that the product of any $n$ consecutive integers is divisible by $(n+k)^2+1$.
1963 AMC 12/AHSME, 25
Point $F$ is taken in side $AD$ of square $ABCD$. At $C$ a perpendicular is drawn to $CF$, meeting $AB$ extended at $E$. The area of $ABCD$ is $256$ square inches and the area of triangle $CEF$ is $200$ square inches. Then the number of inches in $BE$ is:
[asy]
size(6cm);
pair A = (0, 0), B = (1, 0), C = (1, 1), D = (0, 1), E = (1.3, 0), F = (0, 0.7);
draw(A--B--C--D--cycle);
draw(F--C--E--B);
label("$A$", A, SW);
label("$B$", B, S);
label("$C$", C, N);
label("$D$", D, NW);
label("$E$", E, SE);
label("$F$", F, W);
//Credit to MSTang for the asymptote
[/asy]
$\textbf{(A)}\ 12 \qquad
\textbf{(B)}\ 14 \qquad
\textbf{(C)}\ 15 \qquad
\textbf{(D)}\ 16 \qquad
\textbf{(E)}\ 20$