Found problems: 85335
Let $1<t<2$ be a real number. Prove that for all sufficiently large positive integers like $d$, there is a monic polynomial $P(x)$ of degree $d$, such that all of its coefficients are either $+1$ or $-1$ and
$$\left|P(t)-2019\right| <1.$$
[i]Proposed by Navid Safaei[/i]
Let $a, b, c, d, e$ be positive and [b]different [/b] divisors of $n$ where $n \in Z^{+}$. If $n=a^4+b^4+c^4+d^4+e^4$ let's call $n$ "marvelous" number.
$a)$ Prove that all "marvelous" numbers are divisible by $5$.
$b)$ Can count of "marvelous" numbers be infinity?
Let $ABC$ be a right triangle, right at $B$, and let $M$ be the midpoint of the side $BC$. Let $P$ be the point in
bisector of the angle $ \angle BAC$ such that $PM$ is perpendicular to $BC (P$ is outside the triangle $ABC$). Determine the triangle area $ABC$ if $PM = 1$ and $MC = 5$.
The mean number of days per month in $2020$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
In a triangle $ABC$, let $D$ be the point on the segment $BC$ such that $AB+BD=AC+CD$. Suppose that the points $B$, $C$ and the centroids of triangles $ABD$ and $ACD$ lie on a circle. Prove that $AB=AC$.
Let $a_1,a_2,\ldots ,a_n\ge 0.$ For all $1\le k\le n$ define
$$b_k:=\min_{1\le i<j\le n,j-i\le 2}|2a_k-a_i-a_j|.$$
Here the index mod $n.$ Find the maximum value of $\frac{b_1+b_2+\cdots +b_n}{a_1+a_2+\cdots +a_n}.$
[i]Proposed by Zheng Wang[/i]
For a positive integer $n$, let $s(n)$ be the number of ways that $n$ can be written as the sum of strictly increasing perfect $2010^{\text{th}}$ powers. For instance, $s(2) = 0$ and $s(1^{2010} + 2^{2010}) = 1$. Show that for every real number $x$, there exists an integer $N$ such that for all $n > N$,
\[\frac{\max_{1 \leq i \leq n} s(i)}{n} > x.\]
[i]Alex Zhu.[/i]
Let $ABC$ be a triangle with $AB < BC$, and let $E$ and $F$ be points in $AC$ and $AB$ such that $BF = BC = CE$, both on the same halfplane as $A$ with respect to $BC$.
Let $G$ be the intersection of $BE$ and $CF$. Let $H$ be a point in the parallel through $G$ to $AC$ such that $HG = AF$ (with $H$ and $C$ in opposite halfplanes with respect to $BG$). Show that $\angle EHG = \frac{\angle BAC}{2}$.
Let $1\le k\le n$ be integers. At most how many $k$-element subsets can we select from $\{1,2,\dots,n\}$ such that for any two selected subsets, one of the subsets consists of the $k$ smallest elements of their union?
Let $p_1 = 2, p_2 = 3, p_3 = 5 ...$ be the sequence of prime numbers. Find the least positive even integer $n$ so that $p_1 + p_2 + p_3 + ... + p_n$ is not prime.
Find the functions $f: \mathbb{R} \to (0, \infty)$ which satisfy $$2^{-x-y} \le \frac{f(x)f(y)}{(x^2+1)(y^2+1)} \le \frac{f(x+y)}{(x+y)^2+1},$$ for all $x,y \in \mathbb{R}.$
$P(x)$ is a nonzero polynomial with integer coefficients. Prove that there exists infinitely many prime numbers $q$ such that for some natural number $n$, $q|2^n+P(n)$.
[i]Proposed by Mohammad Gharakhani[/i]
A student has $100$ cards on which the integers $1$ to $100$ are printed, as well as a sufficiently large number of cards on which the symbols $+$ and $=$ are printed. What is the maximal number of correct equalities the student can construct, if each card is used at most once?
(R Zhenodarov)
Danyang is doing math. He starts to draw an isosceles triangle, but only manages to draws an angle of $70^{\circ}$ before he has to leave for recess. Find the sum of all possible values for the smallest angle in Danyang's triangle.
Each cell of a $10 \times 10$ board is painted red, blue or white, with exactly twenty of them red. No two adjacent cells are painted in the same colour. A domino consists of two adjacent cells, and it is said to be good if one cell is blue and the other is white.
(a) Prove that it is always possible to cut out $30$ good dominoes from such a board.
(b) Give an example of such a board from which it is possible to cut out $40$ good dominoes.
(c) Give an example of such a board from which it is not possible to cut out more than $30$ good dominoes.
Show that \[\cos(56^{\circ}) \cdot \cos(2 \cdot 56^{\circ}) \cdot \cos(2^2\cdot 56^{\circ})\cdot . . . \cdot \cos(2^{23}\cdot 56^{\circ}) = \frac{1}{2^{24}} .\]
Given triangle $ABC$. Find the locus of points $M$ such that there is a rotation with center at $M$ that takes $C$ to a certain point on side $AB$.
Let $f(x)$ be an even twice differentiable function such that $f''(0)\ne0$. Prove that $f(x)$ has a local extremum at $x=0$.
It's given a right-angled triangle $ABC (\angle{C}=90^{\circ})$ and area $S$. Let $S_1$ be the area of the circle with diameter $AB$ and $k=\frac{S_1}{S}$\\
a) Compute the angles of $ABC$, if $k=2\pi$
b) Prove it is not possible for k to be $3$
A circle $\omega$ is strictly inside triangle $ABC$. The tangents from $A$ to $\omega$ intersect $BC$ in $A_1,A_2$ define $B_1,B_2,C_1,C_2$ similarly. Prove that if five of six points $A_1,A_2,B_1,B_2,C_1,C_2$ lie on a circle the sixth one lie on the circle too.
The diagram below shows a $ 4\times4$ rectangular array of points, each of which is $ 1$ unit away from its nearest neighbors.
[asy]unitsize(0.25inch);
defaultpen(linewidth(0.7));
int i, j;
for(i = 0; i < 4; ++i)
for(j = 0; j < 4; ++j)
dot(((real)i, (real)j));[/asy]Define a [i]growing path[/i] to be a sequence of distinct points of the array with the property that the distance between consecutive points of the sequence is strictly increasing. Let $ m$ be the maximum possible number of points in a growing path, and let $ r$ be the number of growing paths consisting of exactly $ m$ points. Find $ mr$.
Two men at points $R$ and $S$, $76$ miles apart, set out at the same time to walk towards each other. The man at $R$ walks uniformly at the rate of $4\dfrac{1}{2}$ miles per hour; the man at $S$ walks at the constant rate of $3\dfrac{1}{4}$ miles per hour for the first hour, at $3\dfrac{3}{4}$ miles per hour for the second hour,
and so on, in arithmetic progression. If the men meet $x$ miles nearer $R$ than $S$ in an integral number of hours, then $x$ is:
$\textbf{(A)}\ 10 \qquad
\textbf{(B)}\ 8 \qquad
\textbf{(C)}\ 6 \qquad
\textbf{(D)}\ 4 \qquad
\textbf{(E)}\ 2$
Let $a, b$ be two real numbers such that $$\sqrt[3]{a}- \sqrt[3]{b} = 10, ,\,\,\,\,\,\, ab = \left( \frac{8 - a - b}{6}\right)^3$$ Find $a - b$.
A cube lies on the plane. After being rolled a few times (over its edges), it is brought back to its initial location with the same face up. Could the top face have been rotated by 90 degrees?
[i](5 points)[/i]
$n>1$ and distinct positive integers $a_1,a_2,\ldots,a_{n+1}$ are given. Does there exist a polynomial $p(x)\in\Bbb{Z}[x]$ of degree $\le n$ that satisfies the following conditions?
a. $\forall_{1\le i < j\le n+1}: \gcd(p(a_i),p(a_j))>1 $
b. $\forall_{1\le i < j < k\le n+1}: \gcd(p(a_i),p(a_j),p(a_k))=1 $
[i]Proposed by Mojtaba Zare[/i]