Found problems: 85335
Four digits $a, b, c, d$, different from each other and different from zero, are chosen and the list of all the four-digit numbers that are obtained by exchanging the digits $a, b, c, d$ is written. What digits must be chosen so that the list has the greatest possible number of four-digit numbers that are multiples of $36$?
Compute the number of digits is $2015!$. Your score will be given by $\max\{\lfloor125(\min\{\tfrac{A}{C},\tfrac{C}{A}\}-\tfrac{1}{5})\rfloor,0\}$, where $A$ is your answer and $C$ is the actual answer.
On some cells of a $2n \times 2n$ board are placed white and black markers (at most one marker on every cell). We first remove all black markers which are in the same column with a white marker, then remove all white markers which are in the same row with a black one. Prove that either the number of remaining white markers or that of remaining black markers does not exceed $n^2$.
In the tetrahedron $ABCD,$ on the continuation of the edges $AB, AC$ and $AD$, three points were marked for point $A{},$ located from $A{}$ at a distance equal to the semi-perimeter of the triangle $BCD.$ Similarly, we marked three points corresponding to vertices $B, C$ and $D.$ Prove that if there is a sphere touching all the edges of the tetrahedron $ABCD$, then the marked 12 points lie on the same sphere.
[i]Proposed by V. Alexandrov[/i]
On the sides of the convex hexagon $ABCDEF$ into the outer side were built equilateral triangles $ABC_1$, $BCD_1$, $CDE_1$, $DEF_1$, $EFA_1$ and $FAB_1$. The triangle $B_1D_1F_1$ is equilateral too. Prove that, the triangle $A_1C_1E_1$ is also equilateral.
Find the remainder when $333^{333}$ is divided by $33$.
Let $a, b$ and $c$ be positive real numbers. Prove that
\[\frac{\sqrt{a^2+bc}}{b+c}+\frac{\sqrt{b^2+ca}}{c+a}+\frac{\sqrt{c^2+ab}}{a+b}\ge\sqrt{\frac{a}{b+c}}+\sqrt{\frac{b}{c+a}}+\sqrt{\frac{c}{a+b}}\]
Let $1 \leq n \leq 2021$ be a positive integer. Jack has $2021$ coins arranged in a line where each coin has an $H$ on one side and a $T$ on the other. At the beginning, all coins show $H$ except the nth coin. Jack can repeatedly perform the following operation: he chooses a coin showing $T$, and turns over the coins next to it to the left and to the right (if any). Determine all $n$ such that Jack can make all coins show $T$ after a finite number of operations.
All diagonals are drawn in a regular octagon. At how many distinct points in the interior of the octagon (not on the boundary) do two or more diagonals intersect?
$\textbf{(A)} \ 49 \qquad \textbf{(B)} \ 65 \qquad \textbf{(C)} \ 70 \qquad \textbf{(D)} \ 96 \qquad \textbf{(E)} \ 128$
Three standard six-sided dice are rolled. What is the probability that the product of the values on the top faces of the three dice is a perfect cube?
Let $ABC$ be a triangle and $P$ an exterior point in the plane of the triangle. Suppose the lines $AP$, $BP$, $CP$ meet the sides $BC$, $CA$, $AB$ (or extensions thereof) in $D$, $E$, $F$, respectively. Suppose further that the areas of triangles $PBD$, $PCE$, $PAF$ are all equal. Prove that each of these areas is equal to the area of triangle $ABC$ itself.
Let $p$ and $q$ be real numbers. The quadratic equation $$x^2 + px + q = 0$$
has the real solutions $x_1$ and $x_2$. In addition, the following two conditions apply:
(i) The numbers $x_1$ and $x_2$ differ from each other by exactly $ 1$.
(ii) The numbers $p$ and $q$ differ from each other by exactly $ 1$.
Show that then $p$, $q$, $x_1$ and $x_2$ are integers.
(G. Kirchner, University of Innsbruck)
Call a positive integer $n$ [b]practical[/b] if every positive integer less than or equal to $n$ can be written as the sum of distinct divisors of $n$.
For example, the divisors of 6 are 1, 2, 3, and 6. Since
\[ \centerline{1={\bf 1}, ~~ 2={\bf 2}, ~~ 3={\bf 3}, ~~ 4={\bf 1}+{\bf 3}, ~~ 5={\bf 2}+ {\bf 3}, ~~ 6={\bf 6},} \]
we see that 6 is practical.
Prove that the product of two practical numbers is also practical.
Find
(i) $\lim_{n\to \infty} \sum_{i=1}^{n} \frac{1}{\sqrt{n^2 +i^{2}}}$.
(ii) $\lim_{n\to \infty} \sum_{i=1}^{n} \frac{1}{\sqrt{n^2 +i}}$.
(iii) $\lim_{n\to \infty} \sum_{i=1}^{n^{2}} \frac{1}{\sqrt{n^2 +i}}$.
Prove that there is no finite set which contains more than $ 2N,$ with $ N > 3,$ pairwise non-collinear vectors of the plane, and to which the following two characteristics apply:
1) for $ N$ arbitrary vectors from this set there are always further $ N\minus{}1$ vectors from this set so that the sum of these is $ 2N\minus{}1$ vectors is equal to the zero-vector;
2) for $ N$ arbitrary vectors from this set there are always further $ N$ vectors from this set so that the sum of these is $ 2N$ vectors is equal to the zero-vector.
A convex $1994$-gon $M$ is given in the plane. A closed polygonal line consists of $997$ of its diagonals. Every vertex is adjacent to exactly one diagonal. Each diagonal divides $M$ into two sides, and the smaller of the numbers of edges on the two sides of $M$ is defined to be the length of the diagonal. Is it posible to have
(a) $991$ diagonals of length $3$ and $6$ of length $2$?
(b) $985$ diagonals of length $6, 4$ of length $8$, and $8$ of length $3$?
Determine all real-coefficient polynomials $P(x)$ such that
\[ P(\lfloor x \rfloor) = \lfloor P(x) \rfloor \]for every real numbers $x$.
[b]1.[/b] For each real number $r$ between $0$ and $1$ we can represent $r$ as an infinite decimal $r = 0.r_1r_2r_3\dots$ with $0 \leq r_i \leq 9$. For example, $\frac{1}{4} = 0.25000\dots$, $\frac{1}{3} = 0.333\dots$ and $\frac{1}{\sqrt{2}} = 0.707106\dots$.
a) Show that we can choose two rational numbers $p$ and $q$ between $0$ and $1$ such that, from their decimal representations $p = 0.p_1p_2p_3\dots$ and $q = 0.q_1q_2q_3\dots$, it's possible to construct an irrational number $\alpha = 0.a_1a_2a_3\dots$ such that, for each $i = 1, 2, 3, \dots$, we have $a_i = p_1$ or $a_1 = q_i$.
b) Show that there's a rational number $s = 0.s_1s_2s_3\dots$ and an irrational number $\beta = 0.b_1b_2b_3\dots$ such that, for all $N \geq 2017$, the number of indexes $1 \leq i \leq N$ satisfying $s_i \neq b_i$ is less than or equal to $\frac{N}{2017}$.
Let $f : \mathbb N \to \mathbb N$ be an injective function such that there exists a positive integer $k$ for which $f(n) \leq n^k$. Prove that there exist infinitely many primes $q$ such that the equation $f(x) \equiv 0 \pmod q$ has a solution in prime numbers.
Let $\mathbb{R}^+$ denote the set of positive real numbers. Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ such that for any $x,y\in\mathbb{R}^+$, we have \[ f(x)f(y)=f(y)f\Big(xf(y)\Big)+\frac{1}{xy}.\]
We say that $(a,b,c)$ form a [i]fantastic triplet[/i] if $a,b,c$ are positive integers, $a,b,c$ form a geometric sequence, and $a,b+1,c$ form an arithmetic sequence. For example, $(2,4,8)$ and $(8,12,18)$ are fantastic triplets. Prove that there exist infinitely many fantastic triplets.
Let $ABC$ be a triangle and $A'$ be the reflection of $A$ about $BC$. Let $P$ and $Q$ be points on $AB$ and $AC$, respectively, such that $PA'=PC$ and $QA'=QB$. Prove that the perpendicular from $A'$ to $PQ$ passes through the circumcenter of $\triangle ABC$.
[i]Fedir Yudin[/i]
Let $(x_n)$ be a sequence of positive integers defined by $x_1=2$ and $x_{n+1}=2x_n^3+x_n$ for all integers $n\ge1$. Determine the largest power of $5$ that divides $x_{2014}^2+1$.
Circles ${{w} _ {1}}$ and ${{w} _ {2}}$ with centers at points ${{O} _ {1}}$ and ${{ O} _ {2}}$ intersect at points $A$ and $B$, respectively. Around the triangle ${{O} _ {1}} {{O} _ {2}} B$ circumscribe a circle $w$ centered at the point $O$, which intersects the circles ${{w } _ {1}}$ and ${{w} _ {2}}$ for the second time at points $K$ and $L$, respectively. The line $OA$ intersects the circles ${{w} _ {1}}$ and ${{w} _ {2}}$ at the points $M$ and $N$, respectively. The lines $MK$ and $NL$ intersect at the point $P$. Prove that the point $P$ lies on the circle $w$ and $PM = PN$.
(Vadym Mitrofanov)
At an international conference there are four official languages. Any two participants can speak in one of these languages. Show that at least $60\%$ of the participants can speak the same language.
[i]Mihai Baluna[/i]