Found problems: 85335
2007 IMO Shortlist, 4
Let $ A_0 \equal{} (a_1,\dots,a_n)$ be a finite sequence of real numbers. For each $ k\geq 0$, from the sequence $ A_k \equal{} (x_1,\dots,x_k)$ we construct a new sequence $ A_{k \plus{} 1}$ in the following way.
1. We choose a partition $ \{1,\dots,n\} \equal{} I\cup J$, where $ I$ and $ J$ are two disjoint sets, such that the expression
\[ \left|\sum_{i\in I}x_i \minus{} \sum_{j\in J}x_j\right|
\]
attains the smallest value. (We allow $ I$ or $ J$ to be empty; in this case the corresponding sum is 0.) If there are several such partitions, one is chosen arbitrarily.
2. We set $ A_{k \plus{} 1} \equal{} (y_1,\dots,y_n)$ where $ y_i \equal{} x_i \plus{} 1$ if $ i\in I$, and $ y_i \equal{} x_i \minus{} 1$ if $ i\in J$.
Prove that for some $ k$, the sequence $ A_k$ contains an element $ x$ such that $ |x|\geq\frac n2$.
[i]Author: Omid Hatami, Iran[/i]
2021 South East Mathematical Olympiad, 2
Let $p\geq 5$ be a prime number, and set $M=\{1,2,\cdots,p-1\}.$ Define $$T=\{(n,x_n):p|nx_n-1\ \textup{and}\ n,x_n\in M\}.$$ If $\sum_{(n,x_n)\in T}n\left[\dfrac{nx_n}{p}\right]\equiv k \pmod {p},$ with $0\leq k\leq p-1,$ where $\left[\alpha\right]$ denotes the largest integer that does not exceed $\alpha,$ determine the value of $k.$
2019 SAFEST Olympiad, 6
Let $ABC$ be a triangle with circumcircle $\Omega$ and incentre $I$. A line $\ell$ intersects the lines $AI$, $BI$, and $CI$ at points $D$, $E$, and $F$, respectively, distinct from the points $A$, $B$, $C$, and $I$. The perpendicular bisectors $x$, $y$, and $z$ of the segments $AD$, $BE$, and $CF$, respectively determine a triangle $\Theta$. Show that the circumcircle of the triangle $\Theta$ is tangent to $\Omega$.
2010 Contests, 4
Let $a,b,c$ be positive real numbers such that $ab+bc+ca\le 3abc$. Prove that
\[\sqrt{\frac{a^2+b^2}{a+b}}+\sqrt{\frac{b^2+c^2}{b+c}}+\sqrt{\frac{c^2+a^2}{c+a}}+3\le \sqrt{2} (\sqrt{a+b}+\sqrt{b+c}+\sqrt{c+a})\]
2021 Science ON grade X, 2
Let $X$ be a set with $n\ge 2$ elements. Define $\mathcal{P}(X)$ to be the set of all subsets of $X$. Find the number of functions $f:\mathcal{P}(X)\mapsto \mathcal{P}(X)$ such that
$$|f(A)\cap f(B)|=|A\cap B|$$
whenever $A$ and $B$ are two distinct subsets of $X$.
[i] (Sergiu Novac)[/i]
2008 IMS, 2
Let $ f$ be an entire function on $ \mathbb C$ and $ \omega_1,\omega_2$ are complex numbers such that $ \frac {\omega_1}{\omega_2}\in{\mathbb C}\backslash{\mathbb Q}$. Prove that if for each $ z\in \mathbb C$, $ f(z) \equal{} f(z \plus{} \omega_1) \equal{} f(z \plus{} \omega_2)$ then $ f$ is constant.
2008 Tournament Of Towns, 7
Each of three lines cuts chords of equal lengths in two given circles. The points of intersection of these lines form a triangle. Prove that its circumcircle passes through the midpoint of the segment joining the centres of the circles.
2019 ASDAN Math Tournament, 5
Trapezoid $ABCD$ has properties $AB \parallel CD$, $AB = 15$, $CD = 27$, and $BC = AD = 10$. A smaller trapezoid $EF GH$ is drawn within$ ABCD$ with $AB\parallel EF$, $BC\parallel F G$, $CD\parallel GH$, and $DA\parallel HE$ such that each edge in $ABCD$ is a distance $2$ away from the corresponding edge in $EF GH$. Compute the area of $EF GH$.
2010 Contests, 2
Determine the least $n\in\mathbb{N}$ such that $n!=1\cdot 2\cdot 3\cdots (n-1)\cdot n$ has at least $2010$ positive factors.
2014 Stars Of Mathematics, 4
At the junction of some countably infinite number of roads sits a greyhound. On one of the roads a hare runs, away from the junction. The only thing known is that the (maximal) speed of the hare is strictly less than the (maximal) speed of the greyhound (but not their precise ratio). Does the greyhound have a strategy for catching the hare in a finite amount of time?
([i]Dan Schwarz[/i])
2006 German National Olympiad, 3
For which positive integer n can you color the numbers 1,2...2n with n colors, such that every color is used twice and the numbers 1,2,3...n occur as difference of two numbers of the same color exatly once.
2023/2024 Tournament of Towns, 6
6. The baker has baked a rectangular pancake. He then cut it into $n^{2}$ rectangles by making $n-1$ horizontal and $n-1$ vertical cuts. Being rounded to the closest integer, the areas of resulting rectangles equal to all positive integers from 1 to $n^{2}$ in some order. For which maximal $n$ could this happen? (Half-integers are rounded upwards.)
Georgy Karavaev
2018 MIG, 24
The sides of $\triangle ABC$ form an arithmetic sequence of integers. Incircle $I$ is tangent to $AB$, $BC$, and $CA$ at $D$, $E$, and $F$, respectively. Given that $DB = \tfrac32$, $FA = \tfrac12$, find the radius of $I$.
$\textbf{(A) } \dfrac12\qquad\textbf{(B) } \dfrac{\sqrt{15}}7\qquad\textbf{(C) } \dfrac{\sqrt{15}}6\qquad\textbf{(D) } \dfrac{2\sqrt{15}}{9}\qquad\textbf{(E) } \dfrac{\sqrt{15}}{4}$
2011 Oral Moscow Geometry Olympiad, 4
In the trapezoid $ABCD, AB = BC = CD, CH$ is the altitude. Prove that the perpendicular from $H$ on $AC$ passes through the midpoint of $BD$.
2014 Contests, 1
Find the smallest possible value of the expression \[\left\lfloor\frac{a+b+c}{d}\right\rfloor+\left\lfloor\frac{b+c+d}{a}\right\rfloor+\left\lfloor\frac{c+d+a}{b}\right\rfloor+\left\lfloor\frac{d+a+b}{c}\right\rfloor\]
in which $a,~ b,~ c$, and $d$ vary over the set of positive integers.
(Here $\lfloor x\rfloor$ denotes the biggest integer which is smaller than or equal to $x$.)
1997 Flanders Math Olympiad, 1
Write the number 1997 as the sum of positive integers for which the product is maximal, and prove there's no better solution.
2003 District Olympiad, 2
Let $M \subset R$ be a finite set containing at least two elements. We say that the function $f$ has property $P$ if $f : M \to M$ and there are $a \in R^*$ and $b \in R$ such that $f(x) = ax + b$.
(a) Show that there is at least a function having property $P$.
(b) Show that there are at most two functions having property $P$.
(c) If $M$ has $2003$ elements with sum $0$ and if there are two functions with property $P$, prove that $0 \in M$.
2011 USAJMO, 2
Let $a, b, c$ be positive real numbers such that $a^2+b^2+c^2+(a+b+c)^2\leq4$. Prove that
\[\frac{ab+1}{(a+b)^2}+\frac{bc+1}{(b+c)^2}+\frac{ca+1}{(c+a)^2}\geq 3.\]
1968 IMO, 5
Let $f$ be a real-valued function defined for all real numbers, such that for some $a>0$ we have \[ f(x+a)={1\over2}+\sqrt{f(x)-f(x)^2} \] for all $x$.
Prove that $f$ is periodic, and give an example of such a non-constant $f$ for $a=1$.
2014 China Team Selection Test, 3
Let the function $f:N^*\to N^*$ such that
[b](1)[/b] $(f(m),f(n))\le (m,n)^{2014} , \forall m,n\in N^*$;
[b](2)[/b] $n\le f(n)\le n+2014 , \forall n\in N^*$
Show that: there exists the positive integers $N$ such that $ f(n)=n $, for each integer $n \ge N$.
(High School Affiliated to Nanjing Normal University )
2021 HMNT, 1
A domino has a left end and a right end, each of a certain color. Alice has four dominos, colored red-red, red-blue, blue-red, and blue-blue. Find the number of ways to arrange the dominos in a row end-to-end such that adjacent ends have the same color. The dominos cannot be rotated.
2004 Bosnia and Herzegovina Team Selection Test, 4
On competition which has $16$ teams, it is played $55$ games. Prove that among them exists $3$ teams such that they have not played any matches between themselves.
2001 Saint Petersburg Mathematical Olympiad, 11.7
Rectangles $1\times20$, $1\times 19$, ..., $1\times 1$ were cut out of $20\times20$ table. Prove that at least 85 dominoes(1×2 rectangle) can be removed from the remainder.
Proposed by S. Berlov
2005 District Olympiad, 3
We denote with $m_a$, $m_g$ the arithmetic mean and geometrical mean, respectively, of the positive numbers $x,y$.
a) If $m_a+m_g=y-x$, determine the value of $\dfrac xy$;
b) Prove that there exists exactly one pair of different positive integers $(x,y)$ for which $m_a+m_g=40$.
2011 Tournament of Towns, 4
There are $n$ red sticks and $n$ blue sticks. The sticks of each colour have the same total length, and can be used to construct an $n$-gon. We wish to repaint one stick of each colour in the other colour so that the sticks of each colour can still be used to construct an $n$-gon. Is this always possible if
(a) $n = 3$,
(b) $n > 3$ ?