Found problems: 85335
Let $A_1 A_2...A_n$ be a convex $n$-gon. What’s the number of $m$-gons with vertices from $A_1,A_2,...,A_n$ such that between each two adjacent vertices of the $m$-gon there are at least $k$ vertices from the $n$-gon?
Two circles $O, O'$ meet each other at points $A, B$. A line from $A$ intersects the circle $O$ at $C$ and the circle $O'$ at $D$ ($A$ is between $C$ and $D$). Let $M,N$ be the midpoints of the arcs $BC, BD$, respectively (not containing $A$), and let $K$ be the midpoint of the segment $CD$. Show that $\angle KMN = 90^\circ$.
Prove that
\[ x^4y+y^4z+z^4x+xyz(x^3+y^3+z^3) \geq (x+y+z)(3xyz-1) \]
for all positive real numbers $x, y, z$.
[b]a)[/b] Prove that $ \lim_{x\to\infty } \sqrt{x}\cdot\sum_{k=1}^{\lfloor \sqrt{x} \rfloor} \frac{1}{k+x}=1. $
[b]b)[/b] Show that $ \lim_{x\to\infty } \left( -\left\lfloor\sqrt{x}\right\rfloor +x\cdot\sum_{k=1}^{\lfloor \sqrt{x} \rfloor} \frac{1}{k+x} \right) =\frac{-1}{2} $
[b]c)[/b] What about $ \lim_{x\to\infty } \left( -\sqrt{x} +x\cdot\sum_{k=1}^{\lfloor \sqrt{x} \rfloor} \frac{1}{k+x} \right) ? $
For a positive integer \( n \geq 6 \), find the smallest integer \( S(n) \) such that any graph with \( n \) vertices and at least \( S(n) \) edges must contain at least two disjoint cycles (cycles with no common vertices).
If $x,y$ are integers and $17$ divides both $x^2 -2xy + y^2 -5x + 7y$ and $x^2 - 3xy + 2y^2 + x - y$ , then prove that $17$ divides $xy - 12x + 15y$.
Prove that for any polynomial $P$ with integer coefficients and any natural number $k$ there exists a natural number $n$ such that $P(1) + P(2) + ...+ P(n)$ is divisible by $k$.
Given a positive integer $n$, we say that a polynomial $P$ with real coefficients is $n$-pretty if the equation $P(\lfloor x \rfloor)=\lfloor P(x) \rfloor$ has exactly $n$ real solutions. Show that for each positive integer $n$
[list=a]
[*] there exists an n-pretty polynomial;
[*] any $n$-pretty polynomial has a degree of at least $\tfrac{2n+1}{3}$.
[/list]
([i]Remark.[/i] For a real number $x$, we denote by $\lfloor x \rfloor$ the largest integer smaller than or equal to $x$.)
Let $ a_1,a_2, \cdots ,a_{2015} $ be $2015$-tuples of positive integers (not necessary distinct) and let $ k $ be a positive integers. Denote $\displaystyle f(i)=a_i+\frac{a_1a_2 \cdots a_{2015}}{a_i} $.
a) Prove that if $ k=2015^{2015} $, there exist $ a_1, a_2, \cdots , a_{2015} $ such that $ f(i)= k $ for all $1\le i\le 2015 $.\\
b) Find the maximum $k_0$ so that for $k\le k_0$, there are no $k$ such that there are at least $ 2 $ different $2015$-tuples which fulfill the above condition.
Let $a,b,c$ be positive reals such that $a+b+c=3$. Prove the inequality
\[\frac{a^2}{a+b^2}+\frac{b^2}{b+c^2}+\frac{c^2}{c+a^2}\geq \frac{3}{2}.\]
The four congruent circles below touch one another and each has radius 1.
[asy]
unitsize(30);
fill(box((-1,-1), (1, 1)), gray);
filldraw(circle((1, 1), 1), white);
filldraw(circle((1, -1), 1), white);
filldraw(circle((-1, 1), 1), white);
filldraw(circle((-1, -1), 1), white);
[/asy]
What is the area of the shaded region?
Find all positive real solutions to: \begin{eqnarray*} (x_1^2-x_3x_5)(x_2^2-x_3x_5) &\le& 0 \\ (x_2^2-x_4x_1)(x_3^2-x_4x_1) &\le& 0 \\ (x_3^2-x_5x_2)(x_4^2-x_5x_2) &\le& 0 \\ (x_4^2-x_1x_3)(x_5^2-x_1x_3) &\le & 0 \\ (x_5^2-x_2x_4)(x_1^2-x_2x_4) &\le& 0 \\ \end{eqnarray*}
p is a prime number, k is a positive integer
Find all (p, k): $k!=(p^3-1)(p^3-p)(p^3-p^2)$
Let $AH_A$ and $BH_B$ be the altitudes of a triangle $ABC$. The line $H_AH_B$ meets the circumcircle of $ABC$ at points $P$ and $Q$. Let $A'$ be the reflection of $A$ about $BC$, and $B'$ be the reflection of $B$ about $CA$. Prove that $A',B', P,Q$ are concyclic.
Al, Betty, and Clara are in the same class of 50 students total, but are not friends with each other. Al is friends with 24 students, Betty is friends with 39, and Clara is friends with 20. What is the greatest number of students that could be friends with all 3 of them?
Two points on a circle are joined by a broken line shorter than the diameter of the circle. Prove that there exists a diameter which does not intersect this broken line.
(Folklor )
$8$ singers take part in a festival. The organiser wants to plan $m$ concerts. For every concert there are $4$ singers who go on stage, with the restriction that the times of which every two singers go on stage in a concert are all equal. Find a schedule that minimises $m$.
A [i]magic[/i] octagon is an octagon whose sides follow the lines of the checkerboard's checkers and the side lengths are $1, 2, 3, 4, 5, 6, 7, 8$ (in any order). What is the largest possible area of the magic octagon?
[hide=original wording]Burvju astoņstūris ar astoņstūris, kura malas iet pa rūtiņu lapas rūtiņu līnijām un malu garumi ir 1, 2,3, 4, 5, 6, 7, 8 (jebkādā secībā). Kāds ir lielākais iespējamais burvju astoņstūra laukums?[/hide]
A circle $\omega$ with radius $1$ is given. A collection $T$ of triangles is called [i]good[/i], if the following conditions hold:
[list=1]
[*] each triangle from $T$ is inscribed in $\omega$;
[*] no two triangles from $T$ have a common interior point.
[/list]
Determine all positive real numbers $t$ such that, for each positive integer $n$, there exists a good collection of $n$ triangles, each of perimeter greater than $t$.
Solve in $(\mathbb{R}_{+}^{*})^{4}$ the following system :
$\left\{\begin{matrix}
x+y+z+t=4\\
\frac{1}{x}+\frac{1}{y}+\frac{1}{z}+\frac{1}{t}=5-\frac{1}{xyzt}
\end{matrix}\right.$
On a table lie 2022 matches and a regular dice that has the number $a$ on top. Now Max and Moritz play the following game:
Alternately, they take away matches according to the following rule, where Max begins: The player to make a move rolls the dice over one of its edges and then takes a way as many matches as the top number shows. The player that cannot make legal move after some number of moves loses.
For which $a$ can Moritz force Max to lose?
Determine whether there exists a positive integer $a$ such that $$2015a,2016a,\dots,2558a$$ are all perfect power.
A natural number $k$ is such that $k^2 < 2014 < (k +1)^2$. What is the largest prime factor of $k$?
Let $a, b$ be coprime positive integers. A positive integer $n$ is said to be [i]weak[/i] if there do not exist any nonnegative integers $x, y$ such that $ax+by=n$. Prove that if $n$ is a [i]weak[/i] integer and $n < \frac{ab}{6}$, then there exists an integer $k \geq 2$ such that $kn$ is [i]weak[/i].
For any nonempty set of integers $X$, define the function $$f(X) = \frac{(-1)^{|X|}}{ \left(\prod_{k\in X} k \right)^2}$$ where $|X|$ denotes the number of elements in $X$.
Consider the set $S = \{2, 3, . . . , 13\}$ . Note that $1$ is not an element of $S$.
Compute $$\sum_{T\subseteq S, T \ne \emptyset} f(T).$$
where the sum is taken over all nonempty subsets $T$ of $S$.