Found problems: 85335
A grid is called $k$-special if in each cell is written a distinct integer such that the set of integers in the grid is precisely the set of positive divisors of $k$. A grid is called $k$-awesome if it is $k$-special and for each positive divisor $m$ of $k$, there exists an $m$-special grid within this $k$-special grid (within meaning you could draw a box in this grid to obtain the new grid). Find the sum of the $4$ smallest integers $k$ for which no $k$-awesome grid exists.
[i]Proposed by Oliver Hayman[/i]
Let $ABCD$ be a parallelogram. Let $W, X, Y,$ and $Z$ be points on sides $AB, BC, CD,$ and $DA$, respectively, such that the incenters of triangles $AWZ, BXW, CYX,$ and $DZY$ form a parallelogram. Prove that $WXYZ$ is a parallelogram.
Initially, there are $14$ numbers written on the board - zeros and ones. Every minute, Anton chooses half of the numbers on the board and adds $1$ to each of them, while Mykhailo multiplies all the other numbers by $8$. At some point (possibly initially), all the numbers on the board become equal. How many ones could have been on the board initially?
[i]Proposed by Oleksii Masalitin[/i]
Prove that for any $n$ ($n \geq 2$) pairwise distinct fractions in the interval $(0,1)$, the sum of their denominators is no less than $\frac{1}{3} n^{\frac{3}{2}}$.
Suppose $a,\,b,$ and $c$ are three complex numbers with product $1$. Assume that none of $a,\,b,$ and $c$ are real or have absolute value $1$. Define
\begin{tabular}{c c c}
$p=(a+b+c)+\left(\dfrac 1a+\dfrac 1b+\dfrac 1c\right)$ & \text{and} & $q=\dfrac ab+\dfrac bc+\dfrac ca$.
\end{tabular}
Given that both $p$ and $q$ are real numbers, find all possible values of the ordered pair $(p,q)$.
[i]David Altizio[/i]
How many sums $$x_1+x_2+x_3, \ \ 1\leq x_j\leq 300, \ j=1,2,3$$ are multiples of $3$;
The real numbers $ a,b$ fulfil the conditions
(i) $ 0<a<a\plus{}\frac12\le b$;
(ii) $ a^{40}\plus{}b^{40}\equal{}1$.
Prove that $ b$ has the first 12 digits after the decimal point equal to 9.
[i]Mircea Fianu[/i]
The cells of a $100 \times 100$ table are colored white. In one move, it is allowed to select some $99$ cells from the same row or column and recolor each of them with the opposite color. What is the smallest number of moves needed to get a table with a chessboard coloring?
[i]S. Berlov[/i]
Let $ ABCDEF$ be a convex hexagon with all the sides of length 1. Prove that one of the radii of the circumcircles of triangles $ ACE$ or $ BDF$ is at least 1.
If $\theta$ is the unique solution in $(0,\pi)$ to the equation $2\sin(x)+3\sin(\tfrac{3x}{2})+\sin(2x)+3\sin(\tfrac{5x}{2})=0,$ then $\cos(\theta)=\tfrac{a-\sqrt{b}}{c}$ for positive integers $a,b,c$ such that $a$ and $c$ are relatively prime. Find $a+b+c.$
Given a triangle $ \triangle{ABC} $ whose incenter is $ I $ and $ A $-excenter is $ J $. $ A' $ is point so that $ AA' $ is a diameter of $ \odot\left(\triangle{ABC}\right) $. Define $ H_{1}, H_{2} $ to be the orthocenters of $ \triangle{BIA'} $ and $ \triangle{CJA'} $. Show that $ H_{1}H_{2} \parallel BC $
Let $ABC$ be a triangle with integral side lengths such that $\angle A=3\angle B$. Find the minimum value of its perimeter.
Let be a natural number $ n, $ and $ n $ real numbers $ a_1,a_2,\ldots ,a_n . $ Then,
$$ \sum_{1\le i<j\le n} \cos\left( a_i-a_j \right)\ge -n/2. $$
If $ AD$ is the altitude, $ BE$ the angle bisector, and $ CF$ the median of a triangle $ ABC$, prove that $ AD,BE,$ and $ CF$ are concurrent if and only if:
$ a^2(a\minus{}c)\equal{}(b^2\minus{}c^2)(a\plus{}c),$
where $ a,b,c$ are the lengths of the sides $ BC,CA,AB$, respectively.
Show that for every natural number $n$ there are $n$ natural numbers $ x_1 < x_2 < ... < x_n $ such that
$$\frac{1}{x_1}+\frac{1}{x_2}+...+\frac{1}{x_n}-\frac{1}{x_1x_2...x_n}\in \mathbb{N}\cup {0}$$
(15 points )
Let $ f(x) \equal{} 1 \minus{} \cos x \minus{} x\sin x$.
(1) Show that $ f(x) \equal{} 0$ has a unique solution in $ 0 < x < \pi$.
(2) Let $ J \equal{} \int_0^{\pi} |f(x)|dx$. Denote by $ \alpha$ the solution in (1), express $ J$ in terms of $ \sin \alpha$.
(3) Compare the size of $ J$ defined in (2) with $ \sqrt {2}$.
On a circle there are $99$ natural numbers. If $a,b$ are any two neighbouring numbers on the circle, then $a-b$ is equal to $1$ or $2$ or $ \frac{a}{b}=2 $. Prove that there exists a natural number on the circle that is divisible by $3$.
[i]S. Berlov[/i]
Let $a_1$, $a_2$, $\ldots$, $a_n$ be a geometric progression with $a_1 = \sqrt{2}$ and $a_2 = \sqrt[3]{3}$. What is \[\displaystyle{\frac{a_1+a_{2013}}{a_7+a_{2019}}}?\]
Let $B_1$ be the foot of the altitude from the vertex $B$ in the acute-angled $\triangle ABC$. Let $D$ be the midpoint of side $AB$, and $O$ be the circumcentre of $\triangle ABC$. Line $B_1D$ meets line $CO$ at $E$. Prove that the points $B, C, B_1$, and $E$ lie on a circle.
Find all numbers $n$ that can be expressed in the form $n=k+2\lfloor\sqrt{k}\rfloor+2$ for some nonnegative integer $k$.
Let [i]n[/i] $\ge$ 3 be an integer and let ([i]$p_1$[/i], [i]$p_2$[/i], [i]$p_3$[/i], $\dots$, [i]$p_n$[/i]) be a permutation of {1, 2, 3, $\dots$ [i]n[/i]}. For this permutation we say that [i]$p_t$[/i] is a [i]turning point[/i] if 2$\le$ [i]t[/i] $\le$ [i]n[/i]-1 and
([i]$p_t$[/i] - [i]$p_{t-1}$[/i])([i]$p_t$[/i] - [i]$p_{t+1}$[/i]) > 0
For example, for [i]n[/i] = 8, the permutation (2, 4, 6, 7, 5, 1, 3, 8) has two turning points: [i]$p_4$[/i] = 7 and [i]$p_6$[/i] = 1.
For fixed [i]n[/i], let [i]q[/i]([i]n)[/i] denote the number of permutations of {1, 2, 3, $\dots$ [i]n[/i]} with exactly one turning point. Find all [i]n[/i] $\ge$ 3 for which [i]q[/i]([i]n)[/i] is a perfect square.
For all $x,y,z\in \mathbb{R}\backslash \{1\}$, such that $xyz=1$, prove that \[ \frac{x^2}{(x-1)^2}+\frac{y^2}{(y-1)^2}+\frac{z^2}{(z-1)^2}\ge 1 \]
$a,b,c,d,e$ are equal to $1,2,3,4,5$ in some order, such that no two of $a,b,c,d,e$ are equal to the same integer. Given that $b \leq d, c \geq a,a \leq e,b \geq e,$ and that $d\neq5,$ determine the value of $a^b+c^d+e.$
There are $n$ hoops on a circle.
Rik numbers all hoops with a natural number so that all numbers from $1$ to $n$ occur exactly once. Then he makes one walk from hoop to hoop. He starts in hoop $1$ and then follows the following rule: if he gets to hoop $k$, then he walks to the hoop that places $k$ clockwise without getting into the intermediate hoops. The walk ends when Rik has to walk to a hoop he has already been to. The length of the walk is the number of hoops he passed on the way.
For example, for $n = 6$ Rik can take a walk of length $5$ as the hoops are numbered as shown in the figure.
[img]https://cdn.artofproblemsolving.com/attachments/2/a/3d4b7edbba4d145c7e00368f9b794f39572dc5.png[/img]
(a) Determine for every even $n$ how Rik can number the hoops so that he has one walk of length $n$.
(b) Determine for every odd $n$ how Rik can number the hoops so that he has one walk of length $n - 1$.
(c) Show that for an odd $n$ there is no such numbering of the hoops that Rik can make a walk of length $n$.
A list of $2018$ positive integers has a unique mode, which occurs exactly $10$ times. What is the least number of distinct values that can occur in the list?
$\textbf{(A)}\ 202\qquad\textbf{(B)}\ 223\qquad\textbf{(C)}\ 224\qquad\textbf{(D)}\ 225\qquad\textbf{(E)}\ 234$