Found problems: 85335
2009 BMO TST, 4
Find all the polynomials $P(x)$ of a degree $\leq n$ with real non-negative coefficients such that $P(x) \cdot P(\frac{1}{x}) \leq [P(1)]^2$ , $ \forall x>0$.
2008 IMO Shortlist, 5
For every $ n\in\mathbb{N}$ let $ d(n)$ denote the number of (positive) divisors of $ n$. Find all functions $ f: \mathbb{N}\to\mathbb{N}$ with the following properties: [list][*] $ d\left(f(x)\right) \equal{} x$ for all $ x\in\mathbb{N}$.
[*] $ f(xy)$ divides $ (x \minus{} 1)y^{xy \minus{} 1}f(x)$ for all $ x$, $ y\in\mathbb{N}$.[/list]
[i]Proposed by Bruno Le Floch, France[/i]
2019 Online Math Open Problems, 29
Let $n$ be a positive integer and let $P(x)$ be a monic polynomial of degree $n$ with real coefficients. Also let $Q(x)=(x+1)^2(x+2)^2\dots (x+n+1)^2$. Consider the minimum possible value $m_n$ of $\displaystyle\sum_{i=1}^{n+1} \dfrac{i^2P(i^2)^2}{Q(i)}$. Then there exist positive constants $a,b,c$ such that, as $n$ approaches infinity, the ratio between $m_n$ and $a^{2n} n^{2n+b} c$ approaches $1$. Compute $\lfloor 2019 abc^2\rfloor$.
[i]Proposed by Vincent Huang[/i]
2008 Indonesia TST, 1
Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.
2015 CHMMC (Fall), 10
Let $P$ be the parabola in the plane determined by the equation $y = x^2$ . Suppose a circle $C$ in the plane intersects $P$ at four distinct points. If three of these points are $(-28, 784)$,$(-2, 4)$, and $(13, 169)$, find the sum of the distances from the focus of $P$ to all four of the intersection points
1930 Eotvos Mathematical Competition, 1
How many five-digit multiples of 3 end with the digit 6 ?
2024 ELMO Problems, 3
For some positive integer $n,$ Elmo writes down the equation
\[x_1+x_2+\dots+x_n=x_1+x_2+\dots+x_n.\]
Elmo inserts at least one $f$ to the left side of the equation and adds parentheses to create a valid functional equation. For example, if $n=3,$ Elmo could have created the equation
\[f(x_1+f(f(x_2)+x_3))=x_1+x_2+x_3.\]
Cookie Monster comes up with a function $f: \mathbb{Q}\to\mathbb{Q}$ which is a solution to Elmo's functional equation. (In other words, Elmo's equation is satisfied for all choices of $x_1,\dots,x_n\in\mathbb{Q})$. Is it possible that there is no integer $k$ (possibly depending on $f$) such that $f^k(x)=x$ for all $x$?
[i]Srinivas Arun[/i]
2018 Hanoi Open Mathematics Competitions, 10
Let $T=\frac{1}{4}x^{2}-\frac{1}{5}y^{2}+\frac{1}{6}z^{2}$ where $x,y,z$ are real numbers such that $1 \leq x,y,z \leq 4$ and $x-y+z=4$.
Find the smallest value of $10 \times T$.
1993 Mexico National Olympiad, 3
Given a pentagon of area $1993$ and $995$ points inside the pentagon, let $S$ be the set containing the vertices of the pentagon and the $995$ points. Show that we can find three points of $S$ which form a triangle of area $\le 1$.
2020 Sharygin Geometry Olympiad, 3
Let $ABC$ be a triangle with $\angle C=90^\circ$, and $D$ be a point outside $ABC$, such that $\angle ADC=\angle BAC$. The segments $CD$ and $AB$ meet at point $E$. It is known that the distance from $E$ to $AC$ is equal to the circumradius of triangle $ADE$. Find the angles of triangle $ABC$.
2018 Middle European Mathematical Olympiad, 3
A graup of pirates had an argument and not each of them holds some other two at gunpoint.All the pirates are called one by one in some order.If the called pirate is still alive , he shoots both pirates he is aiming at ( some of whom might already be dead .) All shorts are immediatcly lethal . After all the pirates have been called , it turns out the exactly $28$ pirates got killed . Prove that if the pirates were called in whatever other order , at least $10$ pirates would have been killed anyway.
2018 India National Olympiad, 2
For any natural number $n$, consider a $1\times n$ rectangular board made up of $n$ unit squares. This is covered by $3$ types of tiles : $1\times 1$ red tile, $1\times 1$ green tile and $1\times 2$ domino. (For example, we can have $5$ types of tiling when $n=2$ : red-red ; red-green ; green-red ; green-green ; and blue.) Let $t_n$ denote the number of ways of covering $1\times n$ rectangular board by these $3$ types of tiles. Prove that, $t_n$ divides $t_{2n+1}$.
2014 JBMO Shortlist, 7
$a,b,c\in\mathbb{R^+}$ and $a^2+b^2+c^2=48$. Prove that \[a^2\sqrt{2b^3+16}+b^2\sqrt{2c^3+16}+c^2\sqrt{2a^3+16}\le24^2\]
2010 Postal Coaching, 5
Let $a, b, c$ be integers such that \[\frac ab+\frac bc+\frac ca= 3\] Prove that $abc$ is a cube of an integer.
2014 German National Olympiad, 5
There are $9$ visually indistinguishable coins, and one of them is fake and thus lighter. We are given $3$ indistinguishable balance scales to find the fake coin; however, one of the scales is defective and shows a random result each time. Show that the fake coin can still be found with $4$ weighings.
1956 Poland - Second Round, 2
Prove that if $ H $ is the point of intersection of the altitudes of a non-right triangle $ ABC $, then the circumcircles of the triangles $ AHB $, $ BHC $, $ CHA $ and $ ABC $ are equal.
2018 China Team Selection Test, 6
Suppose $a_i, b_i, c_i, i=1,2,\cdots ,n$, are $3n$ real numbers in the interval $\left [ 0,1 \right ].$ Define $$S=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k<1 \right \}, \; \; T=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k>2 \right \}.$$ Now we know that $\left | S \right |\ge 2018,\, \left | T \right |\ge 2018.$ Try to find the minimal possible value of $n$.
2008 iTest Tournament of Champions, 3
Simon and Garfunkle play in a round-robin golf tournament. Each player is awarded one point for a victory, a half point for a tie, and no points for a loss. Simon beat Garfunkle in the first game by a record margin as Garfunkle sent a shot over the bridge and into troubled waters on the final hole. Garfunkle went on to score $8$ total victories, but no ties at all. Meanwhile, Simon wound up with exactly $8$ points, including the point for a victory over Garfunkle. Amazingly, every other player at the tournament scored exactly $n$. Find the sum of all possible values of $n$.
2002 Federal Competition For Advanced Students, Part 1, 1
Determine all integers $a$ and $b$ such that
\[(19a + b)^{18} + (a + b)^{18} + (a + 19b)^{18}\]
is a perfect square.
2004 Tournament Of Towns, 1
Is it possible to arrange numbers from 1 to 2004 in some order so that the sum of any 10 consecutive numbers is divisble by 10?
2011 Romania National Olympiad, 2
Find all numbers $ n $ for which there exist three (not necessarily distinct) roots of unity of order $ n $ whose sum is $
1. $
2013 District Olympiad, 4
Let$f:\mathbb{R}\to \mathbb{R}$be a monotone function.
a) Prove that$f$ have side limits in each point ${{x}_{0}}\in \mathbb{R}$.
b) We define the function $g:\mathbb{R}\to \mathbb{R}$, $g\left( x \right)=\underset{t\nearrow x}{\mathop{\lim }}\,f\left( t \right)$( $g\left( x \right)$ with limit at at left in $x$). Prove that if the $g$ function is continuous, than the function $f$ is continuous.
2023 Thailand TSTST, 4
Find all pairs $(p, n)$ with $n>p$, consisting of a positive integer $n$ and a prime $p$, such that $n^{n-p}$ is an $n$-th power of a positive integer.
2024-25 IOQM India, 24
Consider the set $F$ of all polynomials whose coefficients are in the set of $\{0,1\}$. Let $q(x) = x^3 + x +1$. The number of polynomials $p(x)$ in $F$ of degree $14$ such that the product $p(x)q(x)$ is also in $F$ is:
2004 Romania Team Selection Test, 8
Let $\Gamma$ be a circle, and let $ABCD$ be a square lying inside the circle $\Gamma$. Let $\mathcal{C}_a$ be a circle tangent interiorly to $\Gamma$, and also tangent to the sides $AB$ and $AD$ of the square, and also lying inside the opposite angle of $\angle BAD$. Let $A'$ be the tangency point of the two circles. Define similarly the circles $\mathcal{C}_b$, $\mathcal{C}_c$, $\mathcal{C}_d$ and the points $B',C',D'$ respectively.
Prove that the lines $AA'$, $BB'$, $CC'$ and $DD'$ are concurrent.