$N\geq9$ distinct real numbers are written on a blackboard. All these numbers are nonnegative, and all are less than $1$. It happens that for very $8$ distinct numbers on the board, the board contains the ninth number distinct from eight such that the sum of all these nine numbers is integer. Find all values $N$ for which this is possible. [i](F. Nilov)[/i]

Suppose that one of every $500$ people in a certain population has a particular disease, which displays no symptoms. A blood test is available for screening for this disease. For a person who has this disease, the test always turns out positive. For a person who does not have the disease, however, there is a $2\%$ false positive rate; in other words, for such people, $98\%$ of the time the test will turn out negative, but $2\%$ of the time the test will turn out positive and will incorrectly indicate that the person has the disease. Let $p$ be the probability that a person who is chosen at random from the population and gets a positive test result actually has the disease. Which of the following is closest to $p$? $ \textbf{(A)}\ \frac{1}{98}\qquad\textbf{(B)}\ \frac{1}{9}\qquad\textbf{(C)}\ \frac{1}{11}\qquad\textbf{(D)}\ \frac{49}{99}\qquad\textbf{(E)}\ \frac{98}{99}$

Let $\mathbb X$ be the set of all bijective functions from the set $S=\{1,2,\cdots, n\}$ to itself. For each $f\in \mathbb X,$ define \[T_f(j)=\left\{\begin{aligned} 1, \ \ \ & \text{if} \ \ f^{(12)}(j)=j,\\ 0, \ \ \ & \text{otherwise}\end{aligned}\right.\] Determine $\sum_{f\in\mathbb X}\sum_{j=1}^nT_{f}(j).$ (Here $f^{(k)}(x)=f(f^{(k-1)}(x))$ for all $k\geq 2.$)

Find all pairs of integers $(x, y)$ such that $5x^{2}-6xy+7y^{2}=383$.

In the city built are $2019$ metro stations. Some pairs of stations are connected. tunnels, and from any station through the tunnels you can reach any other. The mayor ordered to organize several metro lines: each line should include several different stations connected in series by tunnels (several lines can pass through the same tunnel), and in each station must lie at least on one line. To save money no more than $k$ lines should be made. It turned out that the order of the mayor is not feasible. What is the largest $k$ it could to happen?

Let $ABC$ be an acute triangle. The point $B'$ of the line $CA$ is such that $A$, $C$ and $B'$ are in that order on the line and $B'C=AB$; the point $C'$ of the line $AB$ is such that $A$, $B$ and $C'$ are in that order on the line and $C'B=AC$. Prove that the circumcenter of triangle $AB'C'$ belongs to the circumcircle of triangle $ABC$.

Al wishes to label the faces of his cube with the integers $2009,2010,$ and $2011,$ with one integer per face, such that adjacent faces (faces that share an edge) have integers that differ by at most $1.$ Determine the number of distinct ways in which he can label the cube, given that two configurations that can be rotated on to each other are considered the same, and that we disregard the orientation in which each number is written on to the cube.

Determine whether there exist an odd positive integer $n$ and $n\times n$ matrices $A$ and $B$ with integer entries, that satisfy the following conditions: [list=1] [*]$\det (B)=1$;[/*] [*]$AB=BA$;[/*] [*]$A^4+4A^2B^2+16B^4=2019I$.[/*] [/list] (Here $I$ denotes the $n\times n$ identity matrix.) [i]Proposed by Orif Ibrogimov, ETH Zurich and National University of Uzbekistan[/i]

Let $f$ be a real function defined in the interval $[0, +\infty )$ and suppose that there exist two functions $f', f''$ in the interval $[0, +\infty )$ such that \[f''(x)=\frac{1}{x^2+f'(x)^2 +1} \qquad \text{and} \qquad f(0)=f'(0)=0.\] Let $g$ be a function for which \[g(0)=0 \qquad \text{and} \qquad g(x)=\frac{f(x)}{x}.\] Prove that $g$ is bounded.

Does there exist a number $\alpha, 0 < \alpha < 1$ such that there is an infinite sequence $\{a_n\}$ of positive numbers satisfying \[ 1 + a_{n+1} \leq a_n + \frac{\alpha}{n} \cdot \alpha_n, n = 1,2, \ldots? \]

We say that a rook is "attacking" another rook on a chessboard if the two rooks are in the same row or column of the chessboard and there is no piece directly between them. Let $n$ be the maximum number of rooks that can be placed on a $6\times 6$ chessboard such that each rook is attacking at most one other. How many ways can $n$ rooks be placed on a $6\times 6$ chessboard such that each rook is attacking at most one other?

$AB$ is a diameter of a circle with center $O$. Let $C$ and $D$ be two different points on the circle on the same side of $AB$, and the lines tangent to the circle at points $C$ and $D$ meet at $E$. Segments $AD$ and $BC$ meet at $F$. Lines $EF$ and $AB$ meet at $M$. Prove that $E,C,M$ and $D$ are concyclic.

Consider a semicircle of center $O$ and diameter $AB$. A line intersects $AB$ at $M$ and the semicircle at $C$ and $D$ s.t. $MC>MD$ and $MB<MA$. The circumcircles od the $AOC$ and $BOD$ intersect again at $K$. Prove that $MK\perp KO$.

Let $m,n$ be positive integers greater than $1$. We define the sets $P_m=\left\{\frac{1}{m},\frac{2}{m},\cdots,\frac{m-1}{m}\right\}$ and $P_n=\left\{\frac{1}{n},\frac{2}{n},\cdots,\frac{n-1}{n}\right\}$. Find the distance between $P_m$ and $P_n$, that is defined as \[\min\{|a-b|:a\in P_m,b\in P_n\}\]

Is it possible to partition the set $A = \{1, 2, 3, ... , 32, 33\}$ into eleven subsets that contain three integers each, such that for every one of these eleven subsets, one of the integers is equal to the sum of the other two? If so, give such a partition, if not, prove that such a partition cannot exist.

Let there be a $n\times n$ board. Write down $0$ or $1$ in all $n^2$ squares. For $1 \le k \le n$, let $A_k$ be the product of all numbers in the $k$th row. How many ways are there to write down the numbers so that $A_1 + A_2 + ... + A_n$ is even?

Prove that the midpoints of the altitudes of a triangle are collinear if and only if the triangle is right. [i]Dorin Popovici[/i]

The sequence $(a_n)$ is defined by $a_1=1$ and $a_n=a_{n-1}+\frac{1}{n^3}$ for $n>1.$ (a) Prove that $a_n<\frac{5}{4}$ for all $n.$ (b) Given $\epsilon>0$, find the smallest natural number $n_0$ such that ${\mid a_{n+1}-a_n}\mid<\epsilon$ for all $n>n_0.$

Assume that in the $\triangle ABC$ there exists a point $D$ on $BC$ and a line $l$ passing through $A$ such that $l$ is tangent to $(ADC)$ and $l$ bisects $BD.$ Prove that $a\sqrt{2}\geq b+c.$

The first three terms of a geometric progression are $\sqrt{2}, \sqrt[3]{2}, \sqrt[6]{2}$. Find the fourth term. ${{ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ \sqrt[7]{2} \qquad\textbf{(C)}\ \sqrt[8]{2} \qquad\textbf{(D)}\ \sqrt[9]{2} }\qquad\textbf{(E)}\ \sqrt[10]{2} } $

Find the smallest positive integer that is equal to the sum of the product of its digits and the sum of its digits.

The formula to convert Celsius to Fahrenheit is $$F^\circ = 1.8 \cdot C^\circ + 32.$$ In Celcius, it is $10^\circ$ warmer in New York right now than in Boston. In Fahrenheit, how much warmer is it in New York than in Boston?

Points $X,Y$ lie on the side $CD$ of a convex pentagon $ABCDE$ with $X$ between $Y$ and $C$. Suppose that the triangles $\bigtriangleup XCB, \bigtriangleup ABX, \bigtriangleup AXY, \bigtriangleup AYE, \bigtriangleup YED$ are all similar (in this exact order). Prove that circumcircles of the triangles $\bigtriangleup ACD, \bigtriangleup AXY$ are tangent. [i]Pouria Mahmoudkhan Shirazi - Iran[/i]

Let $ABC$ be a triangle. Take points $D$, $E$, $F$ on the perpendicular bisectors of $BC$, $CA$, $AB$ respectively. Show that the lines through $A$, $B$, $C$ perpendicular to $EF$, $FD$, $DE$ respectively are concurrent.

Let $ n$ be a positive integer and let $ a_1,a_2,\ldots,a_n$ be positive real numbers such that: \[ \sum^n_{i \equal{} 1} a_i \equal{} \sum^n_{i \equal{} 1} \frac {1}{a_i^2}. \] Prove that for every $ i \equal{} 1,2,\ldots,n$ we can find $ i$ numbers with sum at least $ i$.