There are $6$ different bus lines in a city, each stopping at exactly $5$ stations and running in both directions. Nevertheless, for every two different stations there is always a bus line connecting these two stations. Determine the maximum number of stations in this city. [i](Karl Czakler)[/i]

Let $ABC$ be a triangle and $E$ and $F$ two arbitrary points on sides $AB$ and $AC$, respectively. The circumcircle of triangle $AEF$ meets the circumcircle of triangle $ABC$ again at point $M$. The point $D$ is such that $EF$ bisects the segment $MD$ . Finally, $O$ is the circumcenter of triangle $ABC$. Prove that $D$ lies on line $BC$ if and only if $O$ lies on the circumcircle of triangle $AEF$.

A numerical sequence is called lusophone if it satisfies the following three conditions: i) The first term of the sequence is number $1$. ii) To obtain the next term of the sequence we can multiply the previous term by a positive prime number ($2,3,5,7,11, ...$) or add $1$. (iii) The last term of the sequence is the number $2016$. For example: $1\overset{{\times 11}}{\to}11 \overset{{\times 61}}{\to} 671 \overset{{+1}}{\to}672 \overset{{\times 3}}{\to}2016$ How many Lusophone sequences exist in which (as in the example above) the add $1$ operation was used exactly once and not multiplied twice by the same prime number?

Let $a$, $b$, and $c$ be the $3$ roots of $x^3-x+1=0$. Find $\frac{1}{a+1}+\frac{1}{b+1}+\frac{1}{c+1}.$

Points $P$ and $Q$ lie on the sides $AB$, $BC$ of the triangle $ABC$, such that $AC=CP =PQ=QB$ and $A \neq P$ and $C \neq Q$. If $\sphericalangle ACB = 104^{\circ}$, determine the measures of all angles of the triangle $ABC$.

On a large wooden block there are four twelve-hour analog clocks of varying accuracy. At 7PM on April 3, 2015, they all correctly displayed the time. The first clock is accurate, the second clock is two times as fast as the first clock, the third clock is three times as fast as the first clock, and the last clock doesn't move at all. How many hours must elapse (from 7PM) before the times displayed on the clocks coincide again? (The clocks do not distinguish between AM and PM.) [asy] import olympiad; import cse5; size(12cm); defaultpen(linewidth(0.9)+fontsize(11pt)); picture clock(real hh, real mm, string nn) { picture p; draw(p, unitcircle); for(int i=1;i<=12;i=i+1) { // draw(p, 0.9*dir(90-30*i)--dir(90-30*i)); label(p, "$"+(string) i+"$",0.84*dir(90-30*i), fontsize(9pt)); } dot(p, origin); pair hpoint = 0.5 * dir(90 - 30 * (hh + mm/60)); pair mpoint = 0.75 * dir(90 - 6 * mm); draw(p, origin--hpoint, EndArrow(HookHead, 3)); draw(p, origin--mpoint, EndArrow(HookHead, 5)); string tlabel; if (mm > 10) { tlabel = (string) hh + ":" + (string) mm; } else { tlabel = (string) hh + ":0" + (string) mm; } label(p, tlabel, dir(90)*1.2, dir(90)); label(p, tlabel, dir(90)*1.2, dir(90)); label(p, nn, dir(-90)*1.1, dir(-90)); return p; } // The block real h = 1; filldraw( (-1.2,-1)--(8.4,-1)--(8.4,-1-h)--(-1.2,-1-h)--cycle, 0.7*lightgrey, black); add(shift((0.0,0)) * clock(10,22, "I")); add(shift((2.4,0)) * clock( 1,44, "II")); add(shift((4.8,0)) * clock( 5,06, "III")); add(shift((7.2,0)) * clock( 7,00, "IV")); label("\emph{Omnes vulnerant, postuma necat}", (3.6, -1.8), origin); [/asy] [i]Proposed by Evan Chen[/i]

each of the squares in a 2 x 2018 grid of squares is to be coloured black or white such that in any 2 x 2 block , at least one of the 4 squares is white. let P be the number of ways of colouring the grid. find the largest k so that $3^k$ divides P.

The diagonals $AC$ and $BD$ of a convex quadrilateral $ABCD$ intersect at $E$. Denotes by $S_1,S_2$ and $S$ the areas of the triangles $ABE$, $CDE$ and the quadrilateral $ABCD$ respectively. Prove that $\sqrt{S_1}+\sqrt{S_2}\le \sqrt{S}$ . When equality is reached?

If $p=2^{16}+1$ is a prime, find the maximum possible number of elements in a set $S$ of positive integers less than $p$ so no two distinct $a,b$ in $S$ satisfy $$a^2\equiv b\pmod{p}.$$

Determine all pairs $(m,n)$ of positive integers such that $m^2+n^2=2018(m-n)$

Let $A,B,C$ and $D$ be non-coplanar points such that $\angle ABC=\angle ADC$ and $\angle BAD=\angle BCD$. Show that $AB=CD$ and $AD=BC$.

Let $a,b,c>0$ and $a^2+b^2+c^2=3$ . Prove that $$ \frac{a(a-b^2)}{a+b^2}+\frac{b(b-c^2)}{b+c^2}+\frac{c(c-a^2)}{c+a^2}\ge 0.$$

Find all functions $f: (0,\infty)\rightarrow(0,\infty)$ with the following properties: $f(x+1)=f(x)+1$ and $f\left(\frac{1}{f(x)}\right)=\frac{1}{x}$. [i]Proposed by P. Volkmann[/i]

Find all positive rational $(x,y)$ that satisfy the equation : $$yx^y=y+1$$

In triangle $ABC$ $\omega$ is incircle and $\omega_1$,$\omega_2$,$\omega_3$ is tangents to $\omega$ and two sides of $ABC$. $r, r_1, r_2, r_3$ is radius of $\omega, \omega_1, \omega_2, \omega_3$. Prove that $\sqrt{r_1 r_2}+\sqrt{r_2 r_3}+\sqrt{r_3 r_1}=r$

Let $ABCD$ be a square of center $O$. The parallel to $AD$ through $O$ intersects $AB$ and $CD$ at $M$ and $N$ and a parallel to $AB$ intersects diagonal $AC$ at $P$. Prove that $$OP^4 + \left(\frac{MN}{2} \right)^4 = MP^2 \cdot NP^2$$

Find the smallest possible value of a real number $c$ such that for any $2012$-degree monic polynomial \[P(x)=x^{2012}+a_{2011}x^{2011}+\ldots+a_1x+a_0\] with real coefficients, we can obtain a new polynomial $Q(x)$ by multiplying some of its coefficients by $-1$ such that every root $z$ of $Q(x)$ satisfies the inequality \[ \left\lvert \operatorname{Im} z \right\rvert \le c \left\lvert \operatorname{Re} z \right\rvert. \]

Find all possibilities: how many acute angles can there be in a convex polygon?

Which statement is not true for at least one prime $p$? $ \textbf{(A)}\ \text{If } x^2+x+3 \equiv 0 \pmod p \text{ has a solution, then } \\ \qquad x^2+x+25 \equiv 0 \pmod p \text{ has a solution.} \\ \\ \textbf{(B)}\ \text{If } x^2+x+3 \equiv 0 \pmod p \text{ does not have a solution, then} \\ \qquad x^2+x+25 \equiv 0 \pmod p \text{ has no solution} \\ \\ \qquad\textbf{(C)}\ \text{If } x^2+x+25 \equiv 0 \pmod p \text{ has a solution, then} \\ \qquad x^2+x+3 \equiv 0 \pmod p \text{ has a solution}. \\ \\ \qquad\textbf{(D)}\ \text{If } x^2+x+25 \equiv 0 \pmod p \text{ does not have a solution, then} \\ \qquad x^2+x+3 \equiv 0 \pmod p \text{ has no solution. } \\ \\ \qquad\textbf{(E)}\ \text{None} $

Evaluate \[\sqrt{2013+276\sqrt{2027+278\sqrt{2041+280\sqrt{2055+\ldots}}}}\]

Let be the set $ \Lambda = \left\{ \lambda\in\text{Hol} \left[ \mathbb{C}\longrightarrow\mathbb{C} \right] |z\in\mathbb{C}\implies |\lambda (z)|\le e^{|\text{Im}(z)|} \right\} . $ Show that: $ \text{(1)}\sin\in\Lambda $ $ \text{(2)}\sum_{p\in\mathbb{Z}}\frac{1}{(1+2p)^2} =\frac{\pi^2}{4} $ $ \text{(3)} f\in\Lambda\implies \left| f'(0) \right|\le 1 $

Call a number ``Sam-azing" if it is equal to the sum of its digits times the product of its digits. The only two three-digit Sam-azing numbers are $n$ and $n + 9$. Find $n$.

Find the maximum possible value of the product of distinct positive integers whose sum is $2004$.

A finite set of integers is called [i]bad[/i] if its elements add up to $2010$. A finite set of integers is a [i]Benelux-set[/i] if none of its subsets is bad. Determine the smallest positive integer $n$ such that the set $\{502, 503, 504, . . . , 2009\}$ can be partitioned into $n$ Benelux-sets. (A partition of a set $S$ into $n$ subsets is a collection of $n$ pairwise disjoint subsets of $S$, the union of which equals $S$.) [i](2nd Benelux Mathematical Olympiad 2010, Problem 1)[/i]

$a_1$, $a_2$, $a_3$, $a_4$, $a_5$, $a_6$, $a_7$ and $b_1$, $b_2$, $b_3$, $b_4$, $b_5$, $b_6$, $b_7$ are two permutations of $1, 2, 3, 4, 5, 6, 7$. Show that $|a_1 - b_1|$, $|a_2 - b_2|$, $|a_3 - b_3|$, $|a_4 - b_4|$, $|a_5 - b_5|$, $|a_6 - b_6|$, $|a_7 - b_7|$ are not all different.