Found problems: 85335
* On a plane two points $A$ and $B$ are on the same side of a line. Find point $M$ on the line such that $MA +MB$ is equal to a given length.
A convex quadrilateral $ABCD$ has an inscribed circle with center $I$. Let $I_a, I_b, I_c$ and $I_d$ be the incenters of the triangles $DAB, ABC, BCD$ and $CDA$, respectively. Suppose that the common external tangents of the circles $AI_bI_d$ and $CI_bI_d$ meet at $X$, and the common external tangents of the circles $BI_aI_c$ and $DI_aI_c$ meet at $Y$. Prove that $\angle{XIY}=90^{\circ}$.
Determine all positive integers that cannot be written as $\frac{a}{b} + \frac{a+1}{b+1}$ where $a$ and $b$ are positive integers.
An increasing arithmetic sequence with infinitely many terms is determined as follows. A single die is thrown and the number that appears is taken as the first term. The die is thrown again and the second number that appears is taken as the common difference between each pair of consecutive terms. Determine with proof how many of the 36 possible sequences formed in this way contain at least one perfect square.
Let $p > 3$ be a prime number, and let $F_p$ denote the (fi nite) set of residue classes modulo $p$.
Let $S_d$ denote the set of $2$-variable polynomials $P(x, y)$ with coefficients in $F_p$, total degree $\le d$, and satisfying $P(x, y) = P(y,- x -y)$. Show that $$|S_d| = p^{\lceil (d+1)(d+2)/6 \rceil}$$.
[i]The total degree of a $2$-variable polynomial $P(x, y)$ is the largest value of $i + j$ among monomials $x^iy^j$
[/i] appearing in $P$.
Let $2\mathbb{Z} + 1$ denote the set of odd integers. Find all functions $f:\mathbb{Z} \mapsto 2\mathbb{Z} + 1$ satisfying \[ f(x + f(x) + y) + f(x - f(x) - y) = f(x+y) + f(x-y) \] for every $x, y \in \mathbb{Z}$.
Let $O$ be a point in the plane and let $F$ be a (not necessary convex) polygon. Let $P$ be the perimeter of $F$, let $D$ be sum of the distances of the point $O$ from the vertices of $F$, and let $H$ be sum of the distances of the point $O$ from the lines that pass through the vertices of $F$. Show that
\[D^2-H^2 \geq \frac{P^2}{4}.\]
Let $M$ be an interior point of the triangle $ABC$ such that $AMC = 90^\circ$, $AMB = 150^\circ$, and $BMC = 120^\circ$. The circumcenters of the triangles $AMC$, $AMB$, and $BMC$ are $P$, $Q$, and $R$ respectively. Prove that the area of $\Delta PQR$ is greater than or equal to the area of $\Delta ABC$.
A prison has $2004$ cells, numbered $1$ through $2004$. A jailer, carrying out the terms of a partial amnesty, unlocked every cell. Next he locked every second cell. Then he turned the key in every third cell, locking the opened cells, and unlocking the locked ones. He continued this way, on $n^{\text{th}}$ trip, turning the key in every $n^{\text{th}}$ cell, and he finished his mission after $2004$ trips. How many prisoners were released?
Let $f : [0, 1] \to \mathbb R$ be continuous and satisfy:
\[ \begin{cases}bf(2x) = f(x), &\mbox{ if } 0 \leq x \leq 1/2,\\ f(x) = b + (1 - b)f(2x - 1), &\mbox{ if } 1/2 \leq x \leq 1,\end{cases}\]
where $b = \frac{1+c}{2+c}$, $c > 0$. Show that $0 < f(x)-x < c$ for every $x, 0 < x < 1.$
In a certain tournament bracket, a player must be defeated three times to be eliminated. If 512 contestants enter the tournament, what is the greatest number of games that could be played?
\[\int_1^\infty \frac{\lfloor x \rfloor}{9x^3-x}\mathrm dx\]
[i]Proposed by Robert Trosten and Connor Gordon[/i]
[i](5 pts)[/i] Let $n$ be a positive integer, $K = \{1, 2, \dots, n\}$, and $\sigma : K \rightarrow K$ be a function with the property that $\sigma(i) = \sigma(j)$ if and only if $i = j$ (in other words, $\sigma$ is a \textit{bijection}). Show that there is a positive integer $m$ such that
\[ \underbrace{\sigma(\sigma( \dots \sigma(i) \dots ))}_\textrm{$m$ times} = i \]
for all $i \in K$.
Given set $S = \{ xy\left( {x + y} \right)\; |\; x,y \in \mathbb{N}\}$.Let $a$ and $n$ natural numbers such that $a+2^k\in S$ for all $k=1,2,3,...,n$.Find the greatest value of $n$.
Prove for any $M>2$, there exists an increasing sequence of positive integers $a_1<a_2<\ldots $ satisfying:
1) $a_i>M^i$ for any $i$;
2) There exists a positive integer $m$ and $b_1,b_2,\ldots ,b_m\in\left\{ -1,1\right\}$, satisfying $n=a_1b_1+a_2b_2+\ldots +a_mb_m$ if and only if $n\in\mathbb{Z}/ \{0\}$.
Five pairs of twins are randomly arranged around a circle. Then they perform zero or more swaps, where each swap switches the positions of two adjacent people. They want to reach a state where no one is adjacent to their twin. Compute the expected value of the smallest number of swaps needed to reach such a state.
On the sides $AB, \, \, BC, \, \, CA$ of the triangle $ABC$ the points ${{C} _ {1}}, \, \, {{A} _ { 1}},\, \, {{B} _ {1}}$ are selected respectively, that are different from the vertices. It turned out that $\Delta {{A} _ {1}} {{B} _ {1}} {{C} _ {1}}$ is equilateral, $\angle B{{C}_{1}}{{A}_{1}}=\angle {{C}_{1}}{{B}_{1}}A$ and $\angle B{{A}_{1}}{{C}_{1}}=\angle {{A}_{1}}{{B}_{1}}C$ . Is $ \Delta ABC$ equilateral?
On the sides $AB, BC, CA$ of triangle $ABC$, points $C', A', B'$ are taken.
Prove that for the areas of the corresponding triangles, the inequality holds:
$$S_{ABC}S^2_{A'B'C'}\ge 4S_{AB'C'}S_{BC'A'}S_{CA'B'}$$
and equality is achieved if and only if the lines $AA', BB', CC'$ intersect at one point.
Let $ ABC$ be a non-obtuse triangle with $ CH$ and $ CM$ are the altitude and median, respectively. The angle bisector of $ \angle BAC$ intersects $ CH$ and $ CM$ at $ P$ and $ Q$, respectively. Assume that \[ \angle ABP\equal{}\angle PBQ\equal{}\angle QBC,\]
(a) prove that $ ABC$ is a right-angled triangle, and
(b) calculate $ \dfrac{BP}{CH}$.
[i]Soewono, Bandung[/i]
Three faces $X , Y, Z$ of a unit cube share a common vertex. Suppose the projections of $X , Y, Z$ onto a fixed plane $P$ have areas $x, y, z$, respectively. If $x : y : z = 6 : 10 : 15$, then $x + y + z$ can be written as $m/n$ , where $m, n$ are positive integers and $gcd(m, n) = 1$. Find $100m + n$.
Let $ A$ and $ B$ be two disjoint sets in the interval $ (0,1)$ . Denoting by $ \mu$ the Lebesgue measure on the real line, let $ \mu(A)>0$ and $ \mu(B)>0$ . Let further $ n$ be a positive integer and $ \lambda \equal{}\frac1n$ . Show that there exists a subinterval $ (c,d)$ of $ (0,1)$ for which $ \mu(A\cap (c,d))\equal{}\lambda \mu(A)$ and $ \mu(B\cap (c,d))\equal{}\lambda \mu(B)$ . Show further that this is not true if $ \lambda$ is not of the form $ \frac1n$.
Let $a_1,\ldots , a_{p-2}{}$ be nonzero residues modulo an odd prime $p{}$. For every $d\mid p - 1$ there are at least $\lfloor(p - 2)/d\rfloor$ indices $i{}$ for which $p{}$ does not divide $a_i^d-1$. Prove that the product of some of $a_1,\ldots , a_{p-2}$ gives the remainder two modulo $p{}$.
Six points are marked inside the $3\times 4$ rectangle. Prove that there is a pair of marked points with the distance between them not greater than $\sqrt5$.
[b]10.[/b] Prove that if a graph with $2n+1$ vertices has at least $3n+1$ edges, then the graph contains a circuit having an even number of edges. Prove further that this statemente does not hold for $3n$ edges. (By a circuit, we mean a closed line which does not intersect itself.) [b](C. 5)[/b]
Let $f$ be continuous and nowhere monotone on $[0,1]$. Show that the set of points on which $f$ obtains a local minimum is dense.