Found problems: 85335
Let $n$ be a natural number. At first the cells of a table $2n$ x $2n$ are colored in white. Two players $A$ and $B$ play the following game. First is $A$ who has to color $m$ arbitrary cells in red and after that $B$ chooses $n$ rows and $n$ columns and color their cells in black. Player $A$ wins, if there is at least one red cell on the board. Find the least value of $m$ for which $A$ wins no matter how $B$ plays.
In an acute-angled triangle $ABC$ on the side $AC$, point $P$ is chosen in such a way that $2AP = BC$. Points $X$ and $Y$ are symmetric to $P$ with respect to vertices $A$ and $C$, respectively. It turned out that $BX = BY$. Find $\angle BCA$.
Let $ABCD$ be a convex quadrilateral with $AB = BC = CD$ and $P$ its intersection of diagonals. Denote by $O_1$, $O_2$ the circumcenters of triangles $ABP$, $CDP$, respectively. Prove that $O_1BCO_2$ is a parallelogram.
[i] (Patrik Bak)[/i]
Let $\overline{a_1a_2a_3\ldots a_n}$ be the representation of a $n-$digits number in base $10.$ Prove that there exists a one-to-one function like $f : \{0, 1, 2, 3, \ldots, 9\} \to \{0, 1, 2, 3, \ldots, 9\}$ such that $f(a_1) \neq 0$ and the number $\overline{ f(a_1)f(a_2)f(a_3) \ldots f(a_n) }$ is divisible by $3.$
Suppose that $ ABC$ is an isosceles triangle with $ AB \equal{} AC$. Let $ P$ be the point on side $ AC$ so that $ AP \equal{} 2CP$. Given that $ BP \equal{} 1$, determine the maximum possible area of $ ABC$.
A point $ M$ is chosen on the side $ AC$ of the triangle $ ABC$ in such a way that the radii of the circles inscribed in the triangles $ ABM$ and $ BMC$ are equal. Prove that
\[ BM^{2} \equal{} X \cot \left( \frac {B}{2}\right)
\]
where X is the area of triangle $ ABC.$
Let \(ABC\) be a triangle with \(AB < AC\) and let \(\omega\) be its circumcircle. Let \(M\) denote the midpoint of side \(BC\) and \(N\) the midpoint of arc \(BC\) of \(\omega\) that contains \(A\). The circumcircle of triangle \(AMN\) intersects sides \(AB\) and \(AC\) at points \(P\) and \(Q\), respectively. Prove that \(BP = CQ\).
Prove that $ \prod_{i\equal{}1}^{n}(1\plus{}x_{1}\plus{}x_{2}\plus{}...\plus{}x_{i})\geq\sqrt{(n\plus{}1)^{n\plus{}1}x_{1}x_{2}...x_{n}}\forall x_{1},...,x_{n}> 0$.
Circles with centres $O_1$ and $O_2$ intersect in two points, let one of which be $A$. The common tangent of these circles touches them respectively in points $P$ and $Q$. It is known that points $O_1, A$ and $Q$ are on a common straight line and points $O_2, A$ and $P$ are on a common straight line. Prove that the radii of the circles are equal.
In the square, the midpoints of the two sides were marked and the segments shown in the figure on the left were drawn. Which of the shaded quadrilaterals has the largest area?
[img]https://cdn.artofproblemsolving.com/attachments/d/f/2be7bcda3fa04943687de9e043bd8baf40c98c.png[/img]
Let $ p=\sum\limits_{k=0}^n a_kX^k\in R[X] $ a polynomial such that all his roots lie in the half plane $ \{z\in C| Re(z)<0 \}. $ Prove that $ a_ka_{k+3}<a_{k+1}a_{k+2}, $ for every k=0,1,2...,n-3.
How many integer values satisfy $|x|<3\pi$?
$\textbf{(A) }9 \qquad \textbf{(B) }10 \qquad \textbf{(C) }18 \qquad \textbf{(D) }19 \qquad \textbf{(E) }20$
Prove that for every integer $n > 1$ there exist integers $x$ and $y$ such that $$\frac{1}{n}=\frac{1}{x(x+1)}+\frac{1}{(x+1)(x+2)}+...+\frac{1}{y(y+1)}.$$
Sequences $ (x_n)$ and $ (y_n)$ are constructed as follows: $ x_0 \equal{} 365$, $ x_{n\plus{}1} \equal{} x_n\left(x^{1986} \plus{} 1\right) \plus{} 1622$, and $ y_0 \equal{} 16$, $ y_{n\plus{}1} \equal{} y_n\left(y^3 \plus{} 1\right) \minus{} 1952$, for all $ n \ge 0$. Prove that $ \left|x_n\minus{} y_k\right|\neq 0$ for any positive integers $ n$, $ k$.
Which one is true for a quadrilateral $ABCD$ such that perpendicular bisectors of $[AB]$ and $[CD]$ meet on the diagonal $[AC]$?
$\textbf{(A)}\ |BA| + |AD| \leq |BC| + |CD| \\
\textbf{(B)}\ |BD| \leq |AC| \\
\textbf{(C)}\ |AC| \leq |BD| \\
\textbf{(D)}\ |AD| + |DC| \leq |AB| + |BC| \\
\textbf{(E)}\ \text{None}$
Let $a$ and $b$ be arbitrary distinct numbers.
Prove that the equation $(x +a) (x+b)=2x+a+b$ has two different roots.
How many multiples of $11$ of four digits, of the form $\overline{abcd}$, satisfy that $a\neq b, b\neq c$ and $c\neq a$?
Let $M$ be the point of intersection of the diagonals of a cyclic quadrilateral $ABCD$. Let $I_1$ and $I_2$ are the incenters of triangles $AMD$ and $BMC$, respectively, and let $L$ be the point of intersection of the lines $DI_1$ and $CI_2$. The foot of the perpendicular from the midpoint $T$ of $I_1I_2$ to $CL$ is $N$, and $F$ is the midpoint of $TN$. Let $G$ and $J$ be the points of intersection of the line $LF$ with $I_1N$ and $I_1I_2$, respectively. Let $O_1$ be the circumcenter of triangle $LI_1J$, and let $\Gamma_1$ and $\Gamma_2$ be the circles with diameters $O_1L$ and $O_1J$, respectively. Let $V$ and $S$ be the second points of intersection of $I_1O_1$ with $\Gamma_1$ and $\Gamma_2$, respectively. If $K$ is point where the circles $\Gamma_1$ and $\Gamma_2$ meet again, prove that $K$ is the circumcenter of the triangle $SVG$.
How many handles has the Riemann surface of the function
\[w=\sqrt{1+z^n}\]
Let $ m \equal{} 2007^{2008}$, how many natural numbers n are there such that $ n < m$ and $ n(2n \plus{} 1)(5n \plus{} 2)$ is divisible by $ m$ (which means that $ m \mid n(2n \plus{} 1)(5n \plus{} 2)$) ?
In a triangle $ABC$, points $H,M,L$ are the feet of the altitude from $C$, the median from $A$, and the angle bisector from $B$, respectively. Show that if triangle $HML$ is equilateral, then so is triangle $ABC$.
Let $f:\mathbb C\to\mathbb C$ be a holomorphic function with the property that $|f(z)|=1$ for all $z\in\mathbb C$ such that $|z|=1$. Prove that there exists a $\theta\in\mathbb R$ and a $k\in\{0,1,2,\ldots\}$ such that
$$f(z)=e^{i\theta}z^k$$for all $z\in\mathbb C$.
Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$.
Determine the smallest number of pieces Paul needs to make in order to accomplish this.
We are given two mutually tangent circles in the plane, with radii $r_1, r_2$. A line intersects these circles in four points, determining three segments of equal length. Find this length as a function of $r_1$ and $r_2$ and the condition for the solvability of the problem.
Petro and Vasyl play the following game. They take turns making moves and Petro goes first. In one turn, a player chooses one of the numbers from $1$ to $2023$ that wasn't selected before and writes it on the board. The first player after whose turn the product of the numbers on the board will be divisible by $2023$ loses. Who wins if every player wants to win?
[i]Proposed by Mykhailo Shtandenko[/i]