Found problems: 85335
Let $ABC$ be a triangle, $O{}$ be its circumcenter, $I{}$ its incenter and $I_A,I_B,I_C$ the excenters. Let $M$ be the midpoint of $BC$ and $H_1$ and $H_2$ be the orthocenters of the triangles $MII_A$ and $MI_BI_C$. Prove that the parallel to $BC$ through $O$ passes through the midpoint of the segment $H_1H_2$.
[i]Proposed by David Anghel[/i]
Find all prime numbers $p$ and $q$ such that $\frac{(7^{p}-2^{p})(7^{q}-2^{q})}{pq}$ is an integer.
Find all real numbers $x$ such that: \[ x = \sqrt{ x - \frac{1}{x} } + \sqrt{ 1 - \frac{1}{x} } \]
Reconstruct the triangle$ ABC$, in which $\angle B - \angle C = 90^o$ , by the orthocenter $H$ and points $M_1$ and $L_1$ the feet of the median and angle bisector drawn from vertex $A$, respectively.
(Gryhoriy Filippovskyi)
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.
Each side and diagonal of a regular $n$-gon ($n \ge 3$) for odd $n$ is colored red or blue. One may choose a vertex and change the color of all segments emanating from that vertex. Prove that, no matter how the edges were colored initially, one can achieve that the number of blue segments at each vertex is even. Prove also that the resulting coloring depends only on the initial coloring.
Let $ABCD$ be a rectangle. Point $E$ lies on side $AB$, and point $F$ lies on segment $CE$. Prove that if triangles $ADE$ and $CDF$ have equal areas, then triangles $BCE$ and $DEF$ also have equal areas.
For integers $a$ and $b$ with $0 \leq a,b < {2010}^{18}$ let $S$ be the set of all polynomials in the form of $P(x)=ax^2+bx.$ For a polynomial $P$ in $S,$ if for all integers n with $0 \leq n <{2010}^{18}$ there exists a polynomial $Q$ in $S$ satisfying $Q(P(n)) \equiv n \pmod {2010^{18}},$ then we call $P$ as a [i]good polynomial.[/i]
Find the number of [i]good polynomials.[/i]
Let $P,Q,R,S$ be the midpoints of the sides $BC,CD,DA,AB$ of a convex quadrilateral, respectively. Prove that
\[4(AP^2+BQ^2+CR^2+DS^2)\le 5(AB^2+BC^2+CD^2+DA^2)\]
How many decreasing sequences $a_1, a_2, \ldots, a_{2019}$ of positive integers are there such that $a_1\le 2019^2$ and $a_n + n$ is even for each $1 \le n \le 2019$?
Given real numbers $ x_i $, $ y_i $ ($ i = 1, 2, \ldots, n $) such that $$ \qquad x_1 \geq x_2 \geq \ldots \geq x_n \geq 0, \ \ y_1 > y_2 > \ldots > y_n \geq 0,$$
and $$ \prod_{i=1}^k x_i \geq \prod_{i=1}^k y_i, \ \ \text{ for } \ \ k=1,2,\ldots, n.$$
Prove that
$$
\sum_{i=1}^n x_i > \sum_{i=1}^n y_i.$$
Let $N$ be a positive integer. Alberto and Barbara write numbers on a blackboard taking turns, according to the following rules. Alberto starts writing $1$, and thereafter if a player has written $n$ on a certain move, his adversary is allowed to write $n+1$ or $2n$ as long as he/she does not obtain a number greater than $N$. The player who writes $N$ wins.
$(a)$ Determine which player has a winning strategy for $N=2005$.
$(b)$ Determine which player has a winning strategy for $N=2004$.
$(c)$ Find for how many integers $N\le 2005$ Barbara has a winning strategy.
Let $A$ and $B$ be the two foci of an ellipse and let $P$ be a point on this ellipse. Prove that the focal radii of $P$ (that is, the segments $\overline{AP}$ and $\overline{BP}$ ) form equal angles with the tangent to the ellipse at $P$.
In plane,let a circle $(O)$ and two fixed points $B,C$ lies in $(O)$
such that $BC$ not is the diameter.Consider a point $A$ varies in
$(O)$ such that $A\neq B,C$ and $AB\neq AC$.Call $D$ and $E$
respective is intersect of $BC$ and internal and external bisector
of $\widehat{BAC}$,$I$ is midpoint of $DE$.The line that pass through
orthocenter of $\triangle ABC$
and perpendicular with $AI$ intersects $AD,AE$ respective at $M,N$.
1/Prove that $MN$ pass through a fixed point
2/Determint the place of $A$ such that $S_{AMN}$ has maxium value
It holds: $N,a > 0$. Prove that $\frac12 \left(\frac{N}{a}+a \right) \ge \sqrt{N}$, and if $N \ge 1$ and $a = [\sqrt{N}]$.
Prove that if $a \ne \sqrt{N}: \frac12 \left(\frac{N}{a}+a \right)$ is a better approximation for $\sqrt{N}$ than $a$.
Consider the sequence of polynomials $P_0(x) = 2$, $P_1(x) = x$ and $P_n(x) = xP_{n-1}(x) - P_{n-2}(x)$ for $n \geq 2$. Let $x_n$ be the greatest zero of $P_n$ in the the interval $|x| \leq 2$. Show that $$\lim \limits_{n \to \infty}n^2\left(4-2\pi +n^2\int \limits_{x_n}^2P_n(x)dx\right)=2\pi - 4-\frac{\pi^3}{12}$$
How many ways are there to arrange the $6$ permutations of the tuple $(1, 2, 3)$ in a sequence, such that each pair of adjacent permutations contains at least one entry in common?
For example, a valid such sequence is given by $(3, 2, 1) - (2, 3, 1) - (2, 1, 3) - (1, 2, 3) - (1, 3, 2) - (3, 1, 2)$.
Let $n\geq 2$ be an integer, and let $0 < a_1 < a_2 < \cdots < a_{2n+1}$ be real numbers. Prove the inequality
\[ \sqrt[n]{a_1} - \sqrt[n]{a_2} + \sqrt[n]{a_3} - \cdots + \sqrt[n]{a_{2n+1}} < \sqrt[n]{a_1 - a_2 + a_3 - \cdots + a_{2n+1}}. \]
[i]Bogdan Enescu, Romania[/i]
The vertices of the regular $n$-gon are marked with some colours (each vertex -- with one colour) in such a way, that the vertices of one colour represent the right polygon. Prove that there are two equal ones among the smaller polygons.
In given triangle $\triangle ABC$, difference between sizes of each pair of sides is at least $d>0$. Let $G$ and $I$ be the centroid and incenter of $\triangle ABC$ and $r$ be its inradius. Show that $$[AIG]+[BIG]+[CIG]\ge\frac{2}{3}dr,$$ where $[XYZ]$ is (nonnegative) area of triangle $\triangle XYZ$.
Find all three digit numbers such that the square of that number is equal to the sum of their digits in power of $5$ .
Evaluate the sum of all positive irreducible fractions less than $1$ and having the denominator $1991$.
Giraldo wrote five distinct natural numbers on the vertices of a pentagon. And next he wrote on each side of the pentagon the least common multiple of the numbers written of the two vertices who were on that side and noticed that the five numbers written on the sides were equal. What is the smallest number Giraldo could have written on the sides?
Let $m_{1},m_{2},\ldots,m_{k}$ be integers with $2\leq m_{1}$ and $2m_{1}\leq m_{i+1}$ for all $i$. Show that for any integers $a_{1},a_{2},\ldots,a_{k}$ there are infinitely many integers $x$ which do not satisfy any of the congruences \[x\equiv a_{i}\ (\bmod \ m_{i}),\ i=1,2,\ldots k.\]
In Oddland there are stamps with values of $1$ cent, $3$ cents, $5$ cents, etc., each for odd number there is exactly one stamp type. Oddland Post dictates: For two different values on a letter must be the number of stamps of the lower one value must be at least as large as the number of tokens of the higher value.
In Squareland, on the other hand, there are stamps with values of $1$ cent, $4$ cents, $9$ cents, etc. there is exactly one stamp type for each square number. Brands can be found in Squareland can be combined as required without further regulations.
Prove for every positive integer $n$: there are the same number in the two countries possibilities to send a letter with stamps worth a total of $n$ cents. It makes no difference if you have the same stamps on arrange a letter differently.
(Stephan Wagner)