Found problems: 85335
Prove that for all $ x, y \in \[0, 1\] $ the inequality $ 5 (x^2+ y^2) ^2 \leq 4 + (x +y) ^4$ holds.
There are eight rooms on the first floor of a hotel, with four rooms on each side of the corridor, symmetrically situated (that is each room is exactly opposite to one other room). Four guests have to be accommodated in four of the eight rooms (that is, one in each) such that no two guests are in adjacent rooms or in opposite rooms. In how many ways can the guests be accommodated?
Suppose that $a > b > c > 1$. One of solutions of the equation
$\frac{(x - a)(x - b)}{(c - a)(c - b)}+\frac{(x - b)(x - c)}{(a - b)(a - c)}+\frac{(x - c)(x - a)}{(b - c)(b - a)}= x$ is
(A): $-1$, (B): $-2$, (C): $0$, (D): $1$, (E): None of the above.
Let $ABC$ be an acute triangle and let $D$ be the foot of the $A$-bisector. Moreover, let $M$ be the midpoint of $AD$. The circle $\omega_1$ with diameter $AC$ meets $BM$ at $E$, while the circle $\omega_2$ with diameter $AB$ meets $CM$ at $F$. Assume that $E$ and $F$ lie inside $ABC$. Prove that $B$, $E$, $F$, $C$ are concyclic.
Members of "Professionous Riddlous" society have been divided into some groups, and groups are changed in a special way each weekend: In each group, one of the members is specified as the best member, and the best members of all groups separate from their previous group and form a new group. If a group has only one member, that member joins the new group and the previous group will be removed. Suppose that the society has $n$ members at first, and all the members are in one group. Prove that a week will come, after which number of members of each group will be at most $1+\sqrt{2n}$.
The circles $\gamma_1$ and $\gamma_2$ intersect at the points $Q$ and $R$ and internally touch a circle $\gamma$ at $A_1$ and $A_2$ respectively. Let $P$ be an arbitrary point on $\gamma$. Segments $PA_1$ and $PA_2$ meet $\gamma_1$ and $\gamma_2$ again at $B_1$ and $B_2$ respectively.
a) Prove that the tangent to $\gamma_{1}$ at $B_{1}$ and the tangent to $\gamma_{2}$ at $B_{2}$ are parallel.
b) Prove that $B_{1}B_{2}$ is the common tangent to $\gamma_{1}$ and $\gamma_{2}$ iff $P$ lies on $QR$.
Let $a, b$, and $c$ be distinct positive integers such that $a + 2b + 3c < 12$.
Which of the following inequalities must be true?
A. $a + b + c < 7$
B. $a- b + c < 4$
C. $b + c- a < 3$
D. $a + b- c <5 $
E. $5a + 3b + c < 27$
Prove that for any real numbers $a,b,c$ satisfying $abc = 1$ the following inequality holds
\[\dfrac{1} {2a^2+b^2+3}+\dfrac {1} {2b^2+c^2+3}+\dfrac{1} {2c^2+a^2+3}\leq \dfrac {1} {2}.\]
[i]Proposed by V. Aksenov[/i]
Let $ABC$ be a right-angled triangle with $\angle B = 90^{\circ}$. Let the length of the altitude $BD$ be equal to $12$. What is the minimum possible length of $AC$, given that $AC$ and the perimeter of triangle $ABC$ are integers?
The numbers from $1$ to $2025$ are arranged in some order in the cells of the $1 \times 2025$ strip. Let's call a [i]flip[/i] an operation that takes two arbitrary cells of a strip and swaps the numbers written in them, but only if the larger of these numbers is located to the left of the smaller one. A [i]flop[/i] is a set of several flips that do not contain common cells that are executed simultaneously. (For example, a simultaneous flip between the 2nd and 8th cells and a flip between the 5th and 101st cells.) Prove that there exists a sequence of $66$ flops such that for any initial arrangement, applying this sequence of flops to it will result in the numbers being ordered from left to right in ascending order.
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.
Using a ruler with a length of $20$ cm and a compass with a maximum deviation of $10$ cm to connect the segment given two points lying at a distance of $1$ m.
For a natural number $N$, consider all distinct perfect squares that can be obtained from $N$ by deleting one digit from its decimal representation. Prove that the number of such squares is bounded by some value that doesn't depend on $N$.
There are $11$ phrases written on $11$ pieces of paper (one per sheet):
1) To the left of this sheet there are no sheets with false statements.
2) Exactly one sheet to the left of this one contains a false statement.
3) Exactly $2$ sheets to the left of this one contain false statements
...
11) Exactly $10$ sheets to the left of this one contain false statements.
The sheets of paper were laid out in some order in a row, going from left to right. After this, some of the written statements became true and some became false. What is the greatest possible number of true statements?
Let $0<\alpha<\beta <\gamma\in \mathbb{R}$. Let $K=\{(x,y,z)\in \mathbb{R}^{3}\;|\; x,y,z\geq 0\; \text{and}\; x^{\beta}+y^{\beta}+z^{\beta}=1\}$. Define $f:K\rightarrow \mathbb{R},\; (x,y,z)\mapsto x^{\alpha}+y^{\beta}+z^{\gamma}$. At what points of $K$ does $f$ assume its minimal and maximal values?
For a prime $p$, a subset $S$ of residues modulo $p$ is called a [i]sum-free multiplicative subgroup[/i] of $\mathbb F_p$ if
$\bullet$ there is a nonzero residue $\alpha$ modulo $p$ such that $S = \left\{ 1, \alpha^1, \alpha^2, \dots \right\}$ (all considered mod $p$), and
$\bullet$ there are no $a,b,c \in S$ (not necessarily distinct) such that $a+b \equiv c \pmod p$.
Prove that for every integer $N$, there is a prime $p$ and a sum-free multiplicative subgroup $S$ of $\mathbb F_p$ such that $\left\lvert S \right\rvert \ge N$.
[i]Proposed by Noga Alon and Jean Bourgain[/i]
Define the [i]mexth[/i] of \(k\) sets as the \(k\)th smallest positive integer that none of them contain, if it exists. Does there exist a family \(\mathcal F\) of sets of positive integers such that [list] [*]for any nonempty finite subset \(\mathcal G\) of \(\mathcal F\), the mexth of \(\mathcal G\) exists, and [*]for any positive integer \(n\), there is exactly one nonempty finite subset \(\mathcal G\) of \(\mathcal F\) such that \(n\) is the mexth of \(\mathcal G\). [/list]
[i]Proposed by Espen Slettnes[/i]
Let $n\ge 2$ be an integer. A sequence $\alpha = (a_1, a_2,..., a_n)$ of $n$ integers is called [i]Lima [/i] if $\gcd \{a_i - a_j \text{ such that } a_i> a_j \text{ and } 1\le i, j\le n\} = 1$, that is, if the greatest common divisor of all the differences $a_i - a_j$ with $a_i> a_j$ is $1$. One operation consists of choosing two elements $a_k$ and $a_{\ell}$ from a sequence, with $k\ne \ell $ , and replacing $a_{\ell}$ by $a'_{\ell} = 2a_k - a_{\ell}$ .
Show that, given a collection of $2^n - 1$ Lima sequences, each one formed by $n$ integers, there are two of them, say $\beta$ and $\gamma$, such that it is possible to transform $\beta$ into $\gamma$ through a finite number of operations.
Notes.
The sequences $(1,2,2,7)$ and $(2,7,2,1)$ have the same elements but are different.
If all the elements of a sequence are equal, then that sequence is not Lima.
Find the number of ordered triples of positive integers $(a, b, c)$, where $a, b,c$ is a strictly increasing arithmetic progression, $a + b + c = 2019$, and there is a triangle with side lengths $a, b$, and $c$.
Consider an $n\times n$ unit-square board. The main diagonal of the board is the $n$ unit squares along the diagonal from the top left to the bottom right. We have an unlimited supply of tiles of this form:
[asy]
size(1.5cm);
draw((0,1)--(1,1)--(1,2)--(0,2)--(0,1)--(0,0)--(1,0)--(2,0)--(2,1)--(1,1)--(1,0));
[/asy]
The tiles may be rotated. We wish to place tiles on the board such that each tile covers exactly three unit squares, the tiles do not overlap, no unit square on the main diagonal is covered, and all other unit squares are covered exactly once. For which $n\geq 2$ is this possible?
[i]Proposed by Daniel Kohen[/i]
A convex polyhedron $P$ has 26 vertices, 60 edges, and 36 faces, 24 of which are triangular, and 12 of which are quadrilaterals. A space diagonal is a line segment connecting two non-adjacent vertices that do not belong to the same face. How many space diagonals does $P$ have?
Let $a$, $b$, $c$, $x$, $y$, and $z$ be positive integers such that \[ \frac{a^2-2}{x} = \frac{b^2-37}{y} = \frac{c^2-41}{z} = a+b+c. \] Let $S=a+b+c+x+y+z$. Compute the sum of all possible values of $S$.
[i]Proposed by Luke Robitaille[/i]
A real polynomial of odd degree has all positive coefficients. Prove that there is a (possibly trivial) permutation of the coefficients such that the resulting polynomial has exactly one real zero.
Find all positive integer $k$s for which such $f$ exists and unique:
$f(mn)=f(n)f(m)$ for $n, m \in \mathbb{Z^+}$
$f^{n^k}(n)=n$ for all $n \in \mathbb{Z^+}$ for which $f^x (n)$ means the n times operation of function $f$(i.e. $f(f(...f(n))...)$)
How many ways are there for Nick to travel from $(0,0)$ to $(16,16)$ in the coordinate plane by moving one unit in the positive $x$ or $y$ direction at a time, such that Nick changes direction an odd number of times?