Prove that for an arbitrary pair of vectors $f$ and $g$ in the space the inequality \[af^2 + bfg +cg^2 \geq 0\] holds if and only if the following conditions are fulfilled: \[a \geq 0, \quad c \geq 0, \quad 4ac \geq b^2.\]

Positive real numbers $a$, $b$, $c$ satisfy $a+b+c=1$. Find the smallest possible value of $$E(a,b,c)=\frac{a^3}{1-a^2}+\frac{b^3}{1-b^2}+\frac{c^3}{1-c^2}.$$

Consider the positive integers written in the decimal system with $n$ digits, the start of which is not zero and where there are no two sevens next to each other. The number of these numbers is called $u_n$. Derive a relation that expresses $u_{n+2}$ in terms of $u_{n+1}$ and $u_n$.

Let $n$ be an integer greater than $1.$ $n$ pupils are seated around a round table, each having a certain number of candies (it is possible that some pupils don't have a candy) such that the sum of all the candies they possess is a multiple of $n.$ They exchange their candies as follows: For each student's candies at first, there is at least a student who has more candies than the student sitting to his/her right side, in which case, the student on the right side is given a candy by that student. After a round of exchanging, if there is at least a student who has candies greater than the right side student, then he/she will give a candy to the next student sitting to his/her right side. Prove that after the exchange of candies is completed (ie, when it reaches equilibrium), all students have the same number of candies.

Let $n$ be a positive integer. Elfie the Elf travels in $\mathbb{R}^3$. She starts at the origin: $(0,0,0)$. In each turn she can teleport to any point with integer coordinates which lies at distance exactly $\sqrt{n}$ from her current location. However, teleportation is a complicated procedure: Elfie starts off [i]normal[/i] but she turns [i]strange[/i] with her first teleportation. Next time she teleports she turns [i]normal[/i] again, then [i]strange [/i]again... etc. For which $n$ can Elfie travel to any point with integer coordinates and be [i]normal [/i]when she gets there?

For which integers $n \geq 3$ does there exist a regular $n$-gon in the plane such that all its vertices have integer coordinates in a rectangular coordinate system?

A subset of $\{1, 2, 3, ... ... , 2015\}$ is called good if the following condition is fulfilled: for any element $x$ of the subset, the sum of all the other elements in the subset has the same last digit as $x$. For example, $\{10, 20, 30\}$ is a good subset since $10$ has the same last digit as $20 + 30 = 50$, $20$ has the same last digit as $10 + 30 = 40$, and $30$ has the same last digit as $10 + 20 = 30$. (a) Find an example of a good subset with 400 elements. (b) Prove that there is no good subset with 405 elements.

Let $n$ be a positive integer. Let $D_n$ be the set of all divisors of $n$ and let $f(n)$ denote the smallest natural $m$ such that the elements of $D_n$ are pairwise distinct in mod $m$. Show that there exists a natural $N$ such that for all $n \geq N$, one has $f(n) \leq n^{0.01}$.

Let $p$ be an odd prime number and $\mathbb{Z}_{>0}$ be the set of positive integers. Suppose that a function $f:\mathbb{Z}_{>0}\times\mathbb{Z}_{>0}\to\{0,1\}$ satisfies the following properties: [list] [*] $f(1,1)=0$. [*] $f(a,b)+f(b,a)=1$ for any pair of relatively prime positive integers $(a,b)$ not both equal to 1; [*] $f(a+b,b)=f(a,b)$ for any pair of relatively prime positive integers $(a,b)$. [/list] Prove that $$\sum_{n=1}^{p-1}f(n^2,p) \geqslant \sqrt{2p}-2.$$

Nine people sit down for dinner where there are three choices of meals. Three people order the beef meal, three order the chicken meal, and three order the fish meal. The waiter serves the nine meals in random order. Find the number of ways in which the waiter could serve the meal types to the nine people such that exactly one person receives the type of meal ordered by that person.

A TV station holds a math talent competition, where each participant will be scored by 8 people. The scores are F (failed), G (good), or E (exceptional). The competition is participated by three people, A, B, and C. In the competition, A and B get the same score from exactly 4 people. C states that he has differing scores with A from at least 4 people, and also differing scores with B from at least 4 people. Assuming C tells the truth, how many scoring schemes can occur?

Let $ABC$ be an acute triangle. Let $D$ be the reflection of point $B$ with respect to the line $AC$. Let $E$ be the reflection of point $C$ with respect to the line $AB$. Let $\Gamma_1$ be the circle that passes through $A, B$, and $D$. Let $\Gamma_2$ be the circle that passes through $A, C$, and $E$. Let $P$ be the intersection of $\Gamma_1$ and $\Gamma_2$ , other than $A$. Let $\Gamma$ be the circle that passes through $A, B$, and $C$. Show that the center of $\Gamma$ lies on line $AP$.

Solve in positive integers the equation $1005^x + 2011^y = 1006^z$.

For every natural number $n$, denote $Q(n)$ the sum of the digits in the decimal representation of $n$. Prove that there are infinitely many natural numbers $k$ with $Q(3^{k})>Q(3^{k+1})$.

Let $R=(8,6)$. The lines whose equations are $8y=15x$ and $10y=3x$ contain points $P$ and $Q$, respectively, such that $R$ is the midpoint of $\overline{PQ}$. The length of $PQ$ equals $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $ABC$ be a triangle with a right angle at $C$. Let $I$ be the incentre of triangle $ABC$, and let $D$ be the foot of the altitude from $C$ to $AB$. The incircle $\omega$ of triangle $ABC$ is tangent to sides $BC$, $CA$, and $AB$ at $A_1$, $B_1$, and $C_1$, respectively. Let $E$ and $F$ be the reflections of $C$ in lines $C_1A_1$ and $C_1B_1$, respectively. Let $K$ and $L$ be the reflections of $D$ in lines $C_1A_1$ and $C_1B_1$, respectively. Prove that the circumcircles of triangles $A_1EI$, $B_1FI$, and $C_1KL$ have a common point.

For every natural $n$ let $a_n=20\dots 018$ with $n$ ceros, for example, $a_1=2018, a_3=200018, a_7=2000000018$. Prove that there are infinity values of $n$ such that $2018$ divides $a_n$

Let $K$ be a number field which is neither $\mathbb{Q}$ nor a quadratic imaginary extension of $\mathbb{Q}$. Denote by $\mathcal{L}(K)$ the set of integers $n\ge 3$ for which we can find units $\varepsilon_1,\ldots,\varepsilon_n\in K$ for which $$\varepsilon_1+\dots+\varepsilon_n=0,$$but $\displaystyle\sum_{i\in I}\varepsilon_i\neq 0$ for any nonempty proper subset $I$ of $\{1,2,\dots,n\}$. Prove that $\mathcal{L}(K)$ is infinite, and that its smallest element can be bounded from above by a function of the degree and discriminant of $K$. Further, show that for infinitely many $K$, $\mathcal{L}(K)$ contains infinitely many even and infinitely many odd elements.

For a positive integer $n,$ the factorial notation $n!$ represents the product of the integers from $n$ to $1.$ (For example, $6! = 6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1.$) What value of $N$ satisfies the following equation? $$5! \cdot 9! = 12 \cdot N!$$ $\textbf{(A) }10 \qquad \textbf{(B) }11 \qquad \textbf{(C) }12 \qquad \textbf{(D) }13 \qquad \textbf{(E) }14$

The altitudes $AA_1$ and $CC_1$ of an acute-angled triangle $ABC$ meet at point $H$. Point $Q$ is the reflection of the midpoint of $AC$ in line $AA_1$, point $P$ is the midpoint of segment $A_1C_1$. Prove that $\angle QPH = 90^o$. (D.Shvetsov)

A collection of $n > 2$ numbers is called [i]crowded [/i] if each of them is less than their sum divided by $n - 1$ . Let $\{a, b, c, ,...\}$ be a crowded collection of $n$ numbers whose sum equals $S$. Prove that: (a) each of the numbers is positive, (b) we always have $a + b > c$, (c) we always have $a + b \ge \frac{S}{n-1}$ . (Regina Schleifer)

Consider a parabola. The [i]parabolic length[/i] of a segment is the length of the projection of this segment on a straight line perpendicular to the axis of symmetry of the parabola. In the parabola, two chords $AB$ and $CD$ are drawn, intersecting at the point $N{}$. Prove that the product of the parabolic lengths of the segments $AN$ and $BN$ is equal to the product of the parabolic lengths of the segments $CN$ and $DN$. [i]Proposed by M. Panov[/i]

[b]a)[/b] Prove that $ 0=\inf\{ |x\sqrt 2+y\sqrt 3+y\sqrt 5|\big| x,y,z\in\mathbb{Z} ,x^2+y^2+z^2>0 \} $ [b]b)[/b] Prove that there exist three positive rational numbers $ a,b,c $ such that the expression $ E(x,y,z):=xa+yb+zc $ vanishes for infinitely many integer triples $ (x,y,z), $ but it doesn´t get arbitrarily close to $ 0. $

There are two math exams called A and B. 2014 students took the A exam and/or the B exam. Each student took one or both exams, so the total number of exam papers was between 2014 and 4028, inclusive. The score for each exam is an integer from 0 through 40. The average score of all the exam papers was 20. The grade for a student is the best score from one or both exams that she took. The average grade of all 2014 students was 14. Let $G$ be the [i]greatest[/i] possible number of students who took both exams. Let $L$ be the [i]least[/i] possible number of students who took both exams. Compute $G - L$.

Point $M$ lies inside an isosceles right $\triangle ABC$ with hypotenuse $AB$ such that $MA=5$, $MB=7$, $MC=4\sqrt{2}$. Find $\angle AMC$.