On sides $AB$ and $BC$ of a square $ABCD$ the respective points $E$ and $F$ have been chosen so that $BE = BF$. Let $BN$ be the altitude in triangle $BCE$. Prove that $\angle DNF = 90$.

What necessary and sufficient condition should the coefficients $ a $, $ b $, $ c $, $ d $ satisfy so that the equation $$ax^3 + bx^2 + cx + d = 0$$ has two opposite roots?

Let $ABC$ be a triangle with $AB < AC,$ $I$ its incenter, and $M$ the midpoint of the side $BC$. If $IA=IM,$ determine the smallest possible value of the angle $AIM$.

Let $a_1,a_2,\cdots$ be a strictly increasing sequence on positive integers. Is it always possible to partition the set of natural numbers $\mathbb{N}$ into infinitely many subsets with infinite cardinality $A_1,A_2,\cdots$, so that for every subset $A_i$, if we denote $b_1<b_2<\cdots$ be the elements of $A_i$, then for every $k\in \mathbb{N}$ and for every $1\le i\le a_k$, it satisfies $b_{i+1}-b_{i}\le k$?

Let $a, b, c$ be positive real numbers such that $a^2 + b^2 + c^2 = 3$. Prove that $$\frac{1}{a}+\frac{3}{b}+\frac{5}{c} \ge 4a^2 + 3b^2 + 2c^2$$ When does the equality hold? Marius Stanean

Prove that for any real number $ x$ the following inequality is true: $ \max\{|\sin x|, |\sin(x\plus{}2010)|\}>\dfrac1{\sqrt{17}}$

Consider all positive multiples of $77$ less than $1,000,000.$ What is the sum of all the odd digits that show up?

There are $20$ beads of $10$ colours, two of each colour. They are put in $10$ boxes. It is known that one bead can be selected from each of the boxes so that each colour is represented. Prove that the number of such selections is a non-zero power of $2$. (A Grishin)

Let $PQRS$ be a square piece of paper. $P$ is folded onto $R$ and then $Q$ is folded onto $S$. The area of the resulting figure is 9 square inches. Find the perimeter of square $PQRS$. [asy] draw((0,0)--(2,0)--(2,2)--(0,2)--cycle); label("$P$",(0,2),SE); label("$Q$",(2,2),SW); label("$R$",(2,0),NW); label("$S$",(0,0),NE);[/asy] $ \text{(A)}\ 9\qquad\text{(B)}\ 16\qquad\text{(C)}\ 18\qquad\text{(D)}\ 24\qquad\text{(E)}\ 36 $

Consider the following subsets of the plane:$$C_1=\Big\{(x,y)~:~x>0~,~y=\frac1x\Big\} $$ and $$C_2=\Big\{(x,y)~:~x<0~,~y=-1+\frac1x\Big\}$$ Given any two points $P=(x,y)$ and $Q=(u,v)$ of the plane, their distance $d(P,Q)$ is defined by $$d(P,Q)=\sqrt{(x-u)^2+(y-v)^2}$$ Show that there exists a unique choice of points $P_0\in C_1$ and $Q_0\in C_2$ such that $$d(P_0,Q_0)\leqslant d(P,Q)\quad\forall ~P\in C_1~\text{and}~Q\in C_2.$$

Given is a table 4x4 and in every square there is 0 or 1. In a move we choose row or column and we change the numbers there. Call the square "zero" if we cannot decrease the number of zeroes in it. Call "degree of the square" the number zeroes in a "zero" square. Find all possible values of the degree.

$ABCD$ is a square. $E$ is a point on the side $BC$ such that $BE =1/3 BC$, and $F$ is a point on the ray $DC$ such that $CF =1/2 DC$. Prove that the lines $AE$ and $BF$ intersect on the circumcircle of the square. [img]https://cdn.artofproblemsolving.com/attachments/e/d/09a8235d0748ce4479e21a3bb09b0359de54b5.png[/img]

You have a large number of congruent equilateral triangular tiles on a table and you want to fit $n$ of them together to make a convex equiangular hexagon (i.e. one whose interior angles are $120^o$) . Obviously, $n$ cannot be any positive integer. The first three feasible $n$ are $6, 10$ and $13$. Show that $12$ is not feasible but $14$ is.

Let $O(4,\mathbb Z)$ be the set of all $4\times4$ orthogonal matrices over $\mathbb Z$, i.e., $A^tA=I=AA^t$. Then $|O(4,\mathbb Z)|$ is

On top of a rectangular card with sides of length $1$ and $2+\sqrt{3}$, an identical card is placed so that two of their diagonals line up, as shown ($\overline{AC}$, in this case). [asy] defaultpen(fontsize(12)+0.85); size(150); real h=2.25; pair C=origin,B=(0,h),A=(1,h),D=(1,0),Dp=reflect(A,C)*D,Bp=reflect(A,C)*B; pair L=extension(A,Dp,B,C),R=extension(Bp,C,A,D); draw(L--B--A--Dp--C--Bp--A); draw(C--D--R); draw(L--C^^R--A,dashed+0.6); draw(A--C,black+0.6); dot("$C$",C,2*dir(C-R)); dot("$A$",A,1.5*dir(A-L)); dot("$B$",B,dir(B-R)); [/asy] Continue the process, adding a third card to the second, and so on, lining up successive diagonals after rotating clockwise. In total, how many cards must be used until a vertex of a new card lands exactly on the vertex labeled $B$ in the figure? $\textbf{(A) }6\qquad\textbf{(B) }8\qquad\textbf{(C) }10\qquad\textbf{(D) }12\qquad\textbf{(E) }\text{No new vertex will land on }B.$

Let $ G$ be a finite non-commutative group of order $ t \equal{} 2^nm$, where $ n, m$ are positive and $ m$ is odd. Prove, that if the group contains an element of order $ 2^n$, then (i) $ G$ is not simple; (ii) $ G$ contains a normal subgroup of order $ m$.

(1) For $ 0 < x < 1$, prove that $ (\sqrt {2} \minus{} 1)x \plus{} 1 < \sqrt {x \plus{} 1} < \sqrt {2}.$ (2) Find $ \lim_{a\rightarrow 1 \minus{} 0} \frac {\int_a^1 x\sqrt {1 \minus{} x^2}\ dx}{(1 \minus{} a)^{\frac 32}}$.

For all positive numbers $a, b, c$ satisfying $\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = 1$, prove that: $$ \frac{a}{a+bc} + \frac{b}{b+ca} + \frac{c}{c+ab} \geq \frac{3}{4} .$$

The triangle $ ABC$ is inscribed in a circle. The interior bisectors of the angles $ A,B$ and $ C$ meet the circle again at $ A', B'$ and $ C'$ respectively. Prove that the area of triangle $ A'B'C'$ is greater than or equal to the area of triangle $ ABC.$

Let $p$ be a prime number and $n \ge 2$ a positive integer, such that $p | (n^6 -1)$. Prove that $n > \sqrt{p}-1$.

In a triangle with integer side lengths, one side is three times as long as a second side, and the length of the third side is $17$. What is the greatest possible perimeter of the triangle?

In unit square $ABCD,$ the inscribed circle $\omega$ intersects $\overline{CD}$ at $M,$ and $\overline{AM}$ intersects $\omega$ at a point $P$ different from $M.$ What is $AP?$ $\textbf{(A) } \frac{\sqrt5}{12} \qquad \textbf{(B) } \frac{\sqrt5}{10} \qquad \textbf{(C) } \frac{\sqrt5}{9} \qquad \textbf{(D) } \frac{\sqrt5}{8} \qquad \textbf{(E) } \frac{2\sqrt5}{15}$

A bug starts at one vertex of a cube and moves along the edges of the cube according to the following rule. At each vertex the bug will choose to travel along one of the three edges emanating from that vertex. Each edge has equal probability of being chosen, and all choices are independent. What is the probability that after seven moves the bug will have visited every vertex exactly once? $ \textbf{(A) } \frac {1}{2187} \qquad \textbf{(B) } \frac {1}{729} \qquad \textbf{(C) } \frac {2}{243} \qquad \textbf{(D) } \frac {1}{81} \qquad \textbf{(E) } \frac {5}{243}$

Prove that every integer from $1$ to $2019$ can be represented as an arithmetic expression consisting of up to $17$ symbols $2$ and an arbitrary number of additions, subtractions, multiplications, divisions and brackets. The $2$'s may not be used for any other operation, for example, to form multidigit numbers (such as $222$) or powers (such as $2^2$). Valid examples: $$\left((2\times 2+2)\times 2-\frac{2}{2}\right)\times 2=22 \;\;, \;\; (2\times2\times 2-2)\times \left(2\times 2 +\frac{2+2+2}{2}\right)=42$$ [i]Proposed by Stephan Wagner, Austria[/i]

Find the least real number $m$ such that with all $5$ equilaterial triangles with sum of areas $m$ we can cover an equilaterial triangle with side 1. [i]O. Mushkarov, N. Nikolov[/i]