Found problems: 85335
$(BUL 5)$ Let $Z$ be a set of points in the plane. Suppose that there exists a pair of points that cannot be joined by a polygonal line not passing through any point of $Z.$ Let us call such a pair of points unjoinable. Prove that for each real $r > 0$ there exists an unjoinable pair of points separated by distance $r.$
Let $X_1, X_2$ be independent, identically distributed random variables such that $X_i\geq 0$ for all $i$. Let $\mathrm EX_i=m$, $\mathrm{Var} (X_i)=\sigma ^2<\infty$. Show that, for all $0<\alpha\leq 1$
$$\lim_{n\to\infty} n\,\mathrm{Var} \left( \left[ \frac{X_1+\ldots +X_n}{n}\right] ^\alpha\right)=\frac{\alpha ^ 2 \sigma ^ 2}{m^{2(1-\alpha)}}$$
[Gy. Michaletzki]
If $x,y, z$ are arbitrary positive numbers with $xyz = 1$, prove the inequality
$$x^2+y^2+z^2 + xy+yz + zx \ge 2(\sqrt{x} +\sqrt{y}+ \sqrt{z})$$.
Ten closed intervals, each of length $1$, are placed in the interval $[0,4]$. Show that there is a point in the larger interval that belongs to at least four of the smaller intervals.
Solve in the reals the following system.
$$ \left\{ \begin{matrix} \log_2|x|\cdot\log_2|y| =3/2 \\x^2+y^2=12 \end{matrix} \right. $$
[i]Gheorghe Marchitan[/i]
Kelvin the Frog is trying to hop across a river. The river has $10$ lilypads on it, and he must hop on them in a specific order (the order is unknown to Kelvin). If Kelvin hops to the wrong lilypad at any point, he will be thrown back to the wrong side of the river and will have to start over. Assuming Kelvin is infinitely intelligent, what is the minimum number of hops he will need to guarantee reaching the other side?
Let $ K $ be the group of Klein. Prove that:
[b]a)[/b] There is an unique division ring (up to isomorphism), $ D, $ such that $ (D,+)\cong K. $
[b]b)[/b] There are no division rings $ A $ such that $ (A\setminus\{ 0\} ,+)\cong K. $
The numbers $1,2,...,n$ ($n \ge 5$) are written on the circle in the clockwise order. Per move it is allowed to exchange any couple of consecutive numbers $a, b$ to the couple $\frac{a+b}{2}, \frac{a+b}{2}$.
Is it possible to make all numbers equal using these operations?
[b]7.1[/b] A rectangle that is not a square is inscribed in a square. Prove that its semi-perimeter is equal to the diagonal of the square.
[b]7.2[/b] Find five numbers whose pairwise sums are 0, 2, 4,5, 7, 9, 10, 12, 14, 17.
[b]7.3 [/b] In a $1000$-digit number, all but one digit is a five. Prove that this number is not a perfect square.
[b]7.4 / 6.5[/b] Several teams took part in the volleyball tournament. Team A is considered stronger than team B if either A beat B or there is a team C such that A beat C, and C beat B. Prove that if team T is the winner of the tournament, then it is the strongest the rest of the teams.
[b]7.5[/b] In a pentagon $ABCDE$, $K$ is the midpoint of $AB$, $L$ is the midpoint of $BC$, $M$ is the midpoint of $CD$, $N$ is the midpoint of $DE$, $P$ is the midpoint of $KM$, $Q$ is the midpoint of $LN$. Prove that the segment $ PQ$ is parallel to side $AE$ and is equal to its quarter.
[img]https://cdn.artofproblemsolving.com/attachments/2/5/be8e9b0692d98115dbad04f960e8a856dc593f.png[/img]
[b]7.6 / 8.4[/b] Several circles are arbitrarily placed in a circle of radius $3$, the sum of their radii is $25$. Prove that there is a straight line that intersects at least $9$ of these circles.
PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988084_1968_leningrad_math_olympiad]here[/url].
The circle $\Omega$ centered at $O$ is the circumcircle of the triangle $ABC$. Point $D$ is chosen so that $BD \perp BC$ and points $A$ and $D$ lie in different half-planes with respect to the line $BC$. Let $E$ be a point such that $\angle ADB=\angle BDE$ and $\angle EBD+\angle ACB=90$. Point $P$ is chosen on the line $AD$ so that $OP \perp BC$. Let $Q$ be an arbitrary point on $\Omega$, and $R$ be a point on the line $BQ$ such that $PQ \parallel DR$. Prove that $\angle ARB=\angle BRE$. (All angles are oriented in the same way)
For an $n$-tuple of integers, define a transformation to be:
$$(a_1,a_2,\cdots,a_{n-1},a_n)\rightarrow (a_1+a_2, a_2+a_3, \cdots, a_{n-1}+a_n, a_n+a_1)$$
Find all ordered pairs of integers $(n,k)$ with $n,k\geq 2$, such that for any $n$-tuple of integers $(a_1,a_2,\cdots,a_{n-1},a_n)$, after a finite number of transformations, every element in the of the $n$-tuple is a multiple of $k$.
Prove that for every positive integer $n,$ the set $\{2,3,4,\ldots,3n+1\}$ can be partitioned into $n$ triples in such a way that the numbers from each triple are the lengths of the sides of some obtuse triangle.
[i]Proposed by Canada[/i]
How many real numbers $x$ are solutions to the equation $|x - 2| - 4 =\frac{1}{|x - 3|}$ ?
In a non-recent edition of [i]Ripley's Believe It or Not[/i], it was stated that the number
$N = 526315789473684210$
is a [i]persistent number[/i], that is, if multiplied by any positive integer the resulting number always contains the ten digits $0, 1, 2, 3,..., 8, 9$ in some order with possible repetitions.
a) Prove or disprove the above statement.
b) Are there any persistent numbers smaller than the above number?
$S$ is a subset of $\{1,2, . . . ,100\}$. What is the maximum number of elements in $S$ such that the product of any two of them is not a perfect square?
Does there exist a function $ f(x,y)$ of two real variables that takes natural numbers as its values and for which $ f(x,y)\equal{}f(y,z)$ implies $ x\equal{}y\equal{}z?$
[i]A. Hajnal[/i]
Convex quadrilateral $ ABCD$ is inscribed in a circle, $ \angle{A}\equal{}60^o$, $ BC\equal{}CD\equal{}1$, rays $ AB$ and $ DC$ intersect at point $ E$, rays $ BC$ and $ AD$ intersect each other at point $ F$. It is given that the perimeters of triangle $ BCE$ and triangle $ CDF$ are both integers. Find the perimeter of quadrilateral $ ABCD$.
In a badminton competition, $16$ players participate, of which $10$ are professionals and $6$ are amateurs. In the first phase, eight games are drawn. Among the eight winners of these games, four games are drawn. The four winners qualify for the semi-finals of the competition. Assuming that, whenever a professional player and an amateur play each other, the professional wins the game, what is the probability that an amateur player will reach the semi-finals of the competition?
Find all the finite sets $A$ of real positive numbers having at least two elements, with the property that $a^2 + b^2 \in A$ for every $a, b \in A$ with $a \ne b$
A circle is divided into $2n$ equal sectors, $n \in \mathbb{N}$. Vitya and Masha are playing the following game. At first, Vitya writes one number in every sector from the set $\{1,2,\ldots,n\}$ and every number is used exatly twice. After that Masha chooses $n$ consecutive sectors and writes $1$ in the first sector, $2$ in the second, $n$ in the last. Vitya wins if at least in one sector two equal number will be written, otherwise Masha wins.
Find all $n$ for which Vitya can guarantee his win.
Georg investigates which integers are expressible in the form $$\pm 1^2 \pm 2^2 \pm 3^2 \pm \dots \pm n^2.$$
For example, the number $3$ can be expressed as $ -1^2 + 2^2$, and the number $-13$ can be expressed as
$+1^2 + 2^2 + 3^2 - 4^2 + 5^2 - 6^2$. Are all integers expressible in this form?
Let $a, b, c$ be the roots of $x^3-7x^2-6x+5=0$. Compute $(a+b)(a+c)(b+c)$.
Let $f$ be an injective function from ${1,2,3,\ldots}$ in itself. Prove that for any $n$ we have: $\sum_{k=1}^{n} f(k)k^{-2} \geq \sum_{k=1}^{n} k^{-1}.$
Erica intends to construct a subset $T$ of $S=\{ I,J,K,L,M,N \}$, but if she is unsure about including an element $x$ of $S$ in $T$, she will write $x$ in bold and include it in $T$. For example, $\{ I,J \},$ $\{ J,\mathbf{K},L \},$ and $\{ \mathbf{I},\mathbf{J},\mathbf{M},\mathbf{N} \}$ are valid examples of $T$, while $\{ I,J,\mathbf{J},K \}$ is not. Find the total number of such subsets $T$ that Erica can construct.
In the plane a circle $C$ of unit radius is given. For any line $l$, a number $s(l)$ is defined in the following way: If $l$ and $C$ intersect in two points, $s(l)$ is their distance; otherwise, $s(l) = 0$. Let $P$ be a point at distance $r$ from the center of $C$. One defines $M(r)$ to be the maximum value of the sum $s(m) + s(n)$, where $m$ and $n$ are variable mutually orthogonal lines through $P$. Determine the values of $r$ for which $M(r) > 2$.