Found problems: 85335
$PQR$ is an acute scalene triangle. The altitude $PL$ and the bisector $RK$ of $\angle QRP$ meet at $H$ ($L$ on $QR$ and $K$ on $PQ$). $KM$ is the altitude of triangle $PKR$; it meets $PL$ at $N$. The circumcircle of $\triangle NKR$ meets $QR$ at $S$ other than $Q$. Prove that $SHK$ is an isosceles triangle.
We say that a strictly increasing sequence of positive integers $n_1, n_2,\ldots$ is [i]non-decelerating[/i] if $n_{k+1}-n_k\le n_{k+2}-n_{k+1}$ holds for all positive integers $k$. We say that a strictly increasing sequence $n_1, n_2, \ldots$ is [i]convergence-inducing[/i], if the following statement is true for all real sequences $a_1, a_2, \ldots$: if subsequence $a_{m+n_1}, a_{m+n_2}, \ldots$ is convergent and tends to $0$ for all positive integers $m$, then sequence $a_1, a_2, \ldots$ is also convergent and tends to $0$. Prove that a non-decelerating sequence $n_1, n_2,\ldots$ is convergence-inducing if and only if sequence $n_2-n_1$, $n_3-n_2$, $\ldots$ is bounded from above.
[i]Proposed by András Imolay[/i]
For any two different real numbers $x$ and $y$, we define $D(x,y)$ to be the unique integer $d$ satisfying $2^d\le |x-y| < 2^{d+1}$. Given a set of reals $\mathcal F$, and an element $x\in \mathcal F$, we say that the [i]scales[/i] of $x$ in $\mathcal F$ are the values of $D(x,y)$ for $y\in\mathcal F$ with $x\neq y$. Let $k$ be a given positive integer.
Suppose that each member $x$ of $\mathcal F$ has at most $k$ different scales in $\mathcal F$ (note that these scales may depend on $x$). What is the maximum possible size of $\mathcal F$?
A child's wading pool contains $200$ gallons of water. If water evaporates at the rate of $0.5$ gallons per day and no other water is added or removed, how many gallons of water will be in the pool after $30$ days?
$ \text{(A)}\ 140\qquad\text{(B)}\ 170\qquad\text{(C)}\ 185\qquad\text{(D)}\ 198.5\qquad\text{(E)}\ 199.85 $
Determine whether $712! + 1$ is a prime number.
Let $n\geqslant 1$ be an integer, and let $x_0,x_1,\ldots,x_{n+1}$ be $n+2$ non-negative real numbers that satisfy $x_ix_{i+1}-x_{i-1}^2\geqslant 1$ for all $i=1,2,\ldots,n.$ Show that \[x_0+x_1+\cdots+x_n+x_{n+1}>\bigg(\frac{2n}{3}\bigg)^{3/2}.\][i]Pakawut Jiradilok and Wijit Yangjit, Thailand[/i]
Let $G$ be a simple graph with 100 vertices such that for each vertice $u$, there exists a vertice $v \in N \left ( u \right )$ and $ N \left ( u \right ) \cap N \left ( v \right ) = \o $. Try to find the maximal possible number of edges in $G$. The $ N \left ( . \right )$ refers to the neighborhood.
Let $ABC$ be a triangle in which $AB =AC$ and $\angle CAB = 90^{\circ}$. Suppose that $M$ and $N$ are points on the hypotenuse $BC$ such that $BM^2 + CN^2 = MN^2$. Prove that $\angle MAN = 45^{\circ}$.
Find rational $x$ in $(3,4)$ such that $\sqrt{x-3}$ and $\sqrt{x+1}$ are rational.
If $f$ is a polynomial sends $\mathbb Z$ to $\mathbb Z$ and for $n\in\mathbb N_{\ge2}$, there exists $x\in\mathbb Z$ so that $n\nmid f(x)$, show that for every $k\in\mathbb Z$, there is a non-negative integer $t$ and $a_1,\ldots,a_t\in\{-1,1\}$ such that
$$a_1f(1)+\ldots+a_tf(t)=k.$$
For which integers $n>1$ does there exist a rectangle that can be subdivided into $n$ pairwise noncongruent rectangles similar to the original rectangle?
Aidan rolls a pair of fair, six sided dice. Let$ n$ be the probability that the product of the two numbers at the top is prime. Given that $n$ can be written as $a/b$ , where $a$ and $b$ are relatively prime positive integers, find $a +b$.
[i]Proposed by Aidan Duncan[/i]
We put a figure of a king on some $6 \times 6$ chessboard. It can in one thrust jump either vertically or horizontally. The length of this jump is alternately one and two squares, whereby a jump of one (i.e. to the adjacent square) of the piece begins. Decide whether you can choose the starting position of the pieces so that after a suitable sequence $35$ jumps visited each box of the chessboard just once.
a) $101$ numbers are selected from the set $1, 2, . . . , 200$. Prove that among the numbers selected there is a pair in which one number is divisible by the other.
b) One number less than $16$, and $99$ other numbers are selected from the set $1, 2, . . . , 200$. Prove that among the selected numbers there are two such that one divides the other.
The perpendicular line issued from the center of the circumcircle to the bisector of angle $C$ in a triangle $ABC$ divides the segment of the bisector inside $ABC$ into two segments with ratio of lengths $\lambda$. Given $b = AC$ and $a = BC$, find the length of side $c.$
Is it possible to divide the plane into polygons so that each polygon is transformed into itself under some rotation by $360/7$ degrees about some point? All sides of these polygons must be greater than $1$ cm.
(A polygon is the part of a plane bounded by one non-self-intersect-ing closed broken line, not necessarily convex.)
(A. Andjans, Riga)
Find all pairs of positive integers $a, b$ such that $\sqrt{a+2\sqrt{b}}=\sqrt{a-2\sqrt{b}}+\sqrt{b}$
.
Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$.
[i]Alternative formulation[/i]:
Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial
\[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}.
\]
Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$
[i]Proposed by Federico Ardila, Colombia[/i]
The lengths of the altitudes of a triangle are positive integers, and the length of the radius of the incircle is a prime number.
Find the lengths of the sides of the triangle.
Let $m<n$ be two positive integers and $x_m<x_{m+1}<\cdots<x_n$ be a sequence of rational numbers. Suppose that $kx_k$ is an integer for all integers $k$ which $m\leq k\leq n$. Prove that
$$x_n-x_m\geq \frac{1}{m}-\frac{1}{n}.$$
Let $ T$ be a finite set of positive integers, satisfying the following conditions:
1. For any two elements of $ T$, their greatest common divisor and their least common multiple are also elements of $ T$.
2. For any element $ x$ of $ T$, there exists an element $ x'$ of $ T$ such that $ x$ and $ x'$ are relatively prime, and their least common multiple is the largest number in $ T$.
For each such set $ T$, denote by $ s(T)$ its number of elements. It is known that $ s(T) < 1990$; find the largest value $ s(T)$ may take.
An urn initially contains one red ball and one blue ball. In each step, we choose a uniform random ball from the urn. If it is red, then another red ball and another blue ball are placed in the urn. And when we choose a blue ball for the $k$-th time, we put a blue ball and $2k + 1$ red balls in the urn. (The chosen balls are not removed; they remain in the urn.)
Let $G_n$ denote the number of red balls in the urn after $n$ steps. Prove that there exist constants $0 < c, \alpha < \infty$ such that $\frac{G_n}{n^\alpha} \to c$ almost surely.
Two real numbers $ x $ and $ y $ are both chosen at random from the closed interval $ [-10, 10] $. Find
the probability that $ x^2 + y^2 < 10 $. Express your answer as a common fraction in terms of $ \pi $.
We are given a map divided into $13\times 13$ fields. It is also known that at one of the fields a tank of the enemy is stationed, which we must destroy. To achieve this we need to hit it twice with shots aimed at the centre of some field. When the tank gets hit it gets moved to a neighbouring field out of precaution. At least how many shots must we fire, so that the tank gets destroyed certainly?
[i]We can neither see the tank, nor get any other feedback regarding its position.[/i]
For a given positive integer $n$, we consider the set $M$ of all intervals of the form $[l, r]$, where the integers $l$ and $r$ satisfy the condition $0 \leq l < r \leq n$. What largest number of elements of $M$ can be chosen so that each chosen interval completely contains at most one other selected interval?
[i]Proposed by Anton Trygub[/i]