Find a right triangle that can be cut into $365$ equal triangles.

Let $ABCD$ be a parallelogram. Let $X$ and $Y$ be arbitrary points on sides $BC$ and $CD$, respectively. Segments $BY$ and $DX$ intersect at $P$. Prove that the line going through the midpoints of segments $BD$ and $XY$ is either parallel to or coincides with line $AP$.

What should the angle at the vertex of an isosceles triangle be so that it is possible to construct a triangle with sides equal to the height, base, and one of the other sides of the isosceles triangle?

Find $$ \inf_{\substack{ n\ge 1 \\ a_1,\ldots ,a_n >0 \\ a_1+\cdots +a_n <\pi }} \left( \sum_{j=1}^n a_j\cos \left( a_1+a_2+\cdots +a_j \right)\right) . $$

Let triangle $ABC$ be an acute scalene triangle with orthocenter $H$. The foot of perpendicular from $A$ to $BC$ is $O$, and denote $K,L$ by the midpoints of $AB, AC$, respectively. For a point $D(\neq O,B,C)$ on segment $BC$, let $E,F$ be the orthocenters of triangles $ABD, ACD$, respectively, and denote $M,N$ by the midpoints of $DE,DF$. The perpendicular line from $M$ to $KH$ cuts the perpendicular line from $N$ to $LH$ at $P$. If $Q$ is the midpoint of $EF$, and $S$ is the orthocenter of triangle $HPQ$, then prove that as $D$ varies on $BC$, the ratio $\frac{OS}{OH}$, $\frac{OQ}{OP}$ remains constant.

Let $ABC$ be a triangle with circumcenter $O$ and $\angle BAC = 60^{\circ}$. The internal angle bisector of $\angle BAC$ meets line $BC$ and the circumcircle of $\triangle ABC$ in points $M,L$ respectively. Let $K$ denote the reflection of $BL\cap AC$ over the line $BC$. Let $D$ be on the line $CO$ with $DM$ perpendicular to $KL$. Prove that points $K,A,D$ are collinear. [i]Proposed by Sanjana Philo Chacko[/i]

There are 2018 points marked on a sphere. A zebra wants to paint each point white or black and, perhaps, connect some pairs of points of different colors with a segment. Find the residue modulo 5 of the number of ways to do this.

In the country of Sikinia there are finitely many cities. From each city, exactly three roads go out and each road goes to another Sikinian city. A tourist starts a trip from city $A$ and drives according to the following rule: he turns left at the first city, then right at the next city, and so on, alternately. Show that he will eventually return to $A.$

Two parabolas, $y = ax^2 + bx + c$ and $y = -ax^2- bx - c$, intersect at $x = 2$ and $x = -2$. If the $y$-intercepts of the two parabolas are exactly $2$ units apart from each other, compute $|a+b+c|$.

Let $f (x) = x^2 + ax + b$ be a quadratic function with real coefficients $a, b$. It is given that the equation $f (f (x)) = 0$ has $4$ distinct real roots and the sum of $2$ roots among these roots is equal to $-1$. Prove that $b \le -\frac14$

Given sequences $a_n=\frac{1}{n}{\sqrt[n] {_{2n}P_n}},\ b_n=\frac{1}{n^2}{\sqrt[n] {_{4n}P_{2n}}}$ and $c_n=\sqrt[n]{\frac{_{8n}P_{4n}}{_{6n}P_{4n}}}$, find $\lim_{n\to\infty} a_n,\ \lim_{n\to\infty} b_n$and $\lim_{n\to\infty} c_n.$

$\frac{3}{2}+\frac{5}{4}+\frac{9}{8}+\frac{17}{16}+\frac{33}{32}+\frac{65}{64}-7=$ $\textbf{(A) }-\frac{1}{64}\qquad\textbf{(B) }-\frac{1}{16}\qquad\textbf{(C) }0\qquad\textbf{(D) }\frac{1}{16}\qquad\textbf{(E) }\frac{1}{64}$

Let $x, y, z$ be positive numbers such that $\frac{1}{x} + \frac{1}{y} + \frac{1}{z} = 1$. Prove that $$\sqrt{x + yz} +\sqrt{y + zx} +\sqrt{z + xy} \ge\sqrt{xyz}+\sqrt{x }+\sqrt{y} +\sqrt{z}$$

A frog is placed at the origin on a number line, and moves according to the following rule: in a given move, the frog advanced to either the closest integer point with a greater integer coordinate that is a multiple of 3, or to the closest integer point with a greater integer coordinate that is a multiple of 13. A [i]move sequence[/i] is a sequence of coordinates which correspond to valid moves, beginning with 0, and ending with 39. For example, 0, 3, 6, 13, 15, 26, 39 is a move sequence. How many move sequences are possible for the frog?

Are there integers $k$ and $m$ for which $$\frac{(k-3)(k-2)(k-1)k+1}{(k+1)(k+2)(k+3)(k+4)+1}=m(m+1)+(m+1)(m+2)+(m+2)m \,\, ?$$

We define a sequence of positive integers $a_1,a_2,a_3,\dots$ as follows: Let $a_1=1$ and iteratively, for $k =2,3,\dots$ let $a_k$ be the largest prime factor of $1+a_1a_2\cdots a_{k-1}$. Show that the number $11$ is not an element of this sequence.

Let $n\ge 2$ be an integer. Elwyn is given an $n\times n$ table filled with real numbers (each cell of the table contains exactly one number). We define a [i]rook set[/i] as a set of $n$ cells of the table situated in $n$ distinct rows as well as in n distinct columns. Assume that, for every rook set, the sum of $n$ numbers in the cells forming the set is nonnegative.\\ \\ By a move, Elwyn chooses a row, a column, and a real number $a,$ and then he adds $a$ to each number in the chosen row, and subtracts $a$ from each number in the chosen column (thus, the number at the intersection of the chosen row and column does not change). Prove that Elwyn can perform a sequence of moves so that all numbers in the table become nonnegative.

How many ways are there to paint each of the integers $2, 3, \dots, 9$ either red, green, or blue so that each number has a different color from each of its proper divisors? $\textbf{(A)}\ 144\qquad\textbf{(B)}\ 216\qquad\textbf{(C)}\ 256\qquad\textbf{(D)}\ 384\qquad\textbf{(E)}\ 432$

An experiment consists of performing $n$ independent tests. The $i$-th test is successful with the probability equal to $p_i$. Let $r_k$ be the probability that exactly $k$ tests succeed. Prove that $$\sum_{i=1}^n p_i =\sum_{k=0}^n kr_k.$$

In a tetrahedron $ABCD$, the medians of the faces $ABD$, $ACD$, $BCD$ from $D$ make equal angles with the corresponding edges $AB$, $AC$, $BC$. Prove that each of these faces has area less than or equal to the sum of the areas of the other two faces. [hide="Comment"][i]Equivalent version of the problem:[/i] $ABCD$ is a tetrahedron. $DE$, $DF$, $DG$ are medians of triangles $DBC$, $DCA$, $DAB$. The angles between $DE$ and $BC$, between $DF$ and $CA$, and between $DG$ and $AB$ are equal. Show that: area $DBC$ $\leq$ area $DCA$ + area $DAB$. [/hide]

Rectangular sheet of paper $ABCD$ is folded as shown in the figure. Find the rato $DK: AB$, given that $C_1$ is the midpoint of $AD$. [img]https://3.bp.blogspot.com/-9EkSdxpGnPU/W6dWD82CxwI/AAAAAAAAJHw/iTkEOejlm9U6Dbu427vUJwKMfEOOVn0WwCK4BGAYYCw/s400/Yasinsky%2B2017%2BVIII-IX%2Bp1.png[/img]

A [i]lattice point[/i] in the Cartesian plane is a point whose coordinates are both integers. A [i]lattice polygon[/i] is a polygon all of whose vertices are lattice points. Let $\Gamma$ be a convex lattice polygon. Prove that $\Gamma$ is contained in a convex lattice polygon $\Omega$ such that the vertices of $\Gamma$ all lie on the boundary of $\Omega$, and exactly one vertex of $\Omega$ is not a vertex of $\Gamma$.

Let $f$ be a function on nonnegative integers such that $f(0)=0$ and $$f(3n+2)=f(3n+1)=f(3n)+1=3f(n)+1$$ for all integers $n \ge 0.$ Compute the sum of all nonnegative integers $m$ such that $f(m)=13.$

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

a) $r_1, r_2, ... , r_{100}, c_1, c_2, ... , c_{100}$ are distinct reals. The number $r_i + c_j$ is written in position $i, j$ of a $100 \times 100$ array. The product of the numbers in each column is $1$. Show that the product of the numbers in each row is $-1$. b) $r_1, r_2, ... , r_{2n}, c_1, c_2, ... , c_{2n}$ are distinct reals. The number $r_i + c_j$ is written in position $i, j$ of a $2n \times 2n$ array. The product of the numbers in each column is the same. Show that the product of the numbers in each row is also the same.