A cat and mouse live on a house mapped out by the points $(-1, 0)$, $(-1, 2)$, $(0, 3)$, $(1, 2)$, $(1, 0)$. The cat starts at the top of the house (point $(0, 3)$) and the mouse starts at the origin (0, 0). Both start running clockwise around the house at the same time. If the cat runs at $12$ units a minute and the mouse at 9 units a minute, how many laps around the house will the cat run before it catches the mouse?

Let $n$ be a positive integer. Daniel and Merlijn are playing a game. Daniel has $k$ sheets of paper lying next to each other on a table, where $k$ is a positive integer. On each of the sheets, he writes some of the numbers from $1$ up to $n$ (he is allowed to write no number at all, or all numbers). On the back of each of the sheets, he writes down the remaining numbers. Once Daniel is finished, Merlijn can flip some of the sheets of paper (he is allowed to flip no sheet at all, or all sheets). If Merlijn succeeds in making all of the numbers from $1$ up to n visible at least once, then he wins. Determine the smallest $k$ for which Merlijn can always win, regardless of Daniel’s actions.

There are $900$ students in an International School. There are $59$ international boys and $59$ international girls. The Students are partitioned into $30$ classrooms (each classrooms have equal number of student) and in each of the classrooms, the student will labelled number from $1$ to $30$. The Partition must satisfy at least one follow condition: [list=i] [*] Any Two international boys in same classroom can't have consecutive numbers. [*] For every classroom, the student who is labelled $1$ must be a boy. [/list] Prove that there are $2$ classrooms, each of which has $2$ international boys with their labels difference equal.

As the number of sides of a polygon increases from $3$ to $ n$, the sum of the exterior formed by extending each side in succession: $\textbf{(A)}\ \text{Increases} \qquad \textbf{(B)}\ \text{Decreases} \qquad \textbf{(C)}\ \text{Remains constant} \qquad \textbf{(D)}\ \text{Cannot be predicted} \qquad\\ \textbf{(E)}\ \text{Becomes }(n-3)\text{ straight angles}$

Suppose that $ V$ is a locally compact topological space that admits no countable covering with compact sets. Let $ \textbf{C}$ denote the set of all compact subsets of the space $ V$ and $ \textbf{U}$ the set of open subsets that are not contained in any compact set. Let $ f$ be a function from $ \textbf{U}$ to $ \textbf{C}$ such that $ f(U)\subseteq U$ for all $ U \in \textbf{U}$. Prove that either (i) there exists a nonempty compact set $ C$ such that $ f(U)$ is not a proper subset of $ C$ whenever $ C \subseteq U \in \textbf{U}$, (ii) or for some compact set $ C$, the set \[ f^{-1}(C)= \bigcup \{U \in \textbf{U}\;: \ \;f(U)\subseteq C\ \}\] is an element of $ \textbf{U}$, that is, $ f^{-1}(C)$ is not contained in any compact set. [i]A. Mate[/i]

An incircle of triangle $ABC$ touches $AB$, $BC$, $AC$ at points $C_1$, $A_1$,$ B_1$ respectively. Let $A'$ be the reflection of $A_1$ about $B_1C_1$, point $C'$ is defined similarly. Lines $A'C_1$ and $C'A_1$ meet at point $D$. Prove that $BD \parallel AC$.

Solve the following system of equations in integer numbers: $$\begin{cases} x^2 = yz + 1 \\ y^2 = zx + 1 \\ z^2 = xy + 1 \end{cases}$$

A class has 30 students. To celebrate 'Tu BiShvat' each student chose some dried fruits out of $n$ different kinds. Say two students are friends if they both chose from the same type of fruit. Find the minimal $n$ so that it is possible that each student has exactly \(6\) friends.

For a fixed $k$ with $4 \le k \le 9$ consider the set of all positive integers with $k$ decimal digits such that each of the digits from $1$ to $k$ occurs exactly once. Show that it is possible to partition this set into two disjoint subsets such that the sum of the cubes of the numbers in the first set is equal to the sum of the cubes in the second set.

Let $ABC$ be a scalene triangle with orthocenter $H$ and circumcenter $O$. Let $P$ be the midpoint of $\overline{AH}$ and let $T$ be on line $BC$ with $\angle TAO=90^{\circ}$. Let $X$ be the foot of the altitude from $O$ onto line $PT$. Prove that the midpoint of $\overline{PX}$ lies on the nine-point circle* of $\triangle ABC$. *The nine-point circle of $\triangle ABC$ is the unique circle passing through the following nine points: the midpoint of the sides, the feet of the altitudes, and the midpoints of $\overline{AH}$, $\overline{BH}$, and $\overline{CH}$. [i]Proposed by Zack Chroman[/i]

There are $2018$ peoples. We call the group of people as "club" if all members of same "club" are all friends, but not friends with a nonmember of "club". Prove, that we can divide peoples for $90$ rooms, such that no one room has all members of some "club".

For $1\leq n\leq 2016$, how many integers $n$ satisfying the condition: the reminder divided by $20$ is smaller than the one divided by $16$.

Jerry recently returned from a trip to South America where he helped two old factories reduce pollution output by installing more modern scrubber equipment. Factory A previously filtered $80\%$ of pollutants and Factory B previously filled $72\%$ of pollutants. After installing the new scrubber system, both factories now filter $99.5\%$ of pollutants. Jerry explains the level of pollution reduction to Michael, "Factory A is the much larger factory. It's four times as large as Factory B. Without any filters at all, it would pollute four times as much as Factory B. Even with the better pollution filtration system, Factory A was polluting nearly three times as much as Factory B." Assuming the factories are the same in every way except size and previous percentage of pollution filtered, find $a+b$ where $a/b$ is the ratio in lowest terms of volume of pollutants unfiltered from both factories $\textit{after}$ installation of the new scrubber system to the volume of pollutants unfiltered from both factories $\textit{before}$ installation of the new scrubber system.

Let $O$ be the circumcenter of an acute triangle $ABC$. Line $OA$ intersects the altitudes of $ABC$ through $B$ and $C$ at $P$ and $Q$, respectively. The altitudes meet at $H$. Prove that the circumcenter of triangle $PQH$ lies on a median of triangle $ABC$.

Consider the isosceles triangle $ABC$ with $AB = AC$, and $M$ the midpoint of $BC$. Find the locus of the points $P$ interior to the triangle, for which $\angle BPM+\angle CPA = \pi$.

In the adjacent figure, can the numbers $1,2,3, 4,..., 18$ be placed, one on each line segment, such that the sum of the numbers on the three line segments meeting at each point is divisible by $3$?

For all integers $ {a}_{0},{a}_{1}, \cdot\cdot\cdot {a}_{100}$, find the maximum of ${a}_{5}-2{a}_{40}+3{a}_{60}-4{a}_{95} $ $\bigstar$ 1) ${a}_{0}={a}_{100}=0$ 2) for all $i=0,1,\cdot \cdot \cdot 99, $ $|{a}_{i+1}-{a}_{i}|\le1$ 3) $ {a}_{10}={a}_{90} $

Let for natural numbers $a,b,c$ and any natural $n$ we have that $(abc)^n$ divides $ ((a^n-1)(b^n-1)(c^n-1)+1)^3$. Prove that then $a=b=c$.

Suppose $x,y,,a,b,c,d,e,f$ are real numbers satifying i)$\max{(a,0)}+\max{(b,0)}<x+ay+bz<1+\min{(a,0)}+\min{(b,0)}$, and ii)$\max{(c,0)}+\max{(d,0)}<cx+y+dz<1+\min{(c,0)}+\min{(d,0)}$, and iii)$\max{(e,0)}+\max{(f,0)}<ex+fy+z<1+\min{(e,0)}+\min{(f,0)}$. Prove that $0<x,y,z<1$.

Let $OFT$ and $NOT$ be two similar triangles (with the same orientation) and let $FANO$ be a parallelogram. Show that \[\vert OF\vert \cdot \vert ON\vert=\vert OA\vert \cdot \vert OT\vert.\]

Let $ABC$ be an arbitrary triangle. Let the excircle tangent to side $a$ be tangent to lines $AB,BC$ and $CA$ at points $C_a,A_a,$ and $B_a,$ respectively. Similarly, let the excircle tangent to side $b$ be tangent to lines $AB,BC,$ and $CA$ at points $C_b,A_b,$ and $B_b,$ respectively. Finally, let the excircle tangent to side $c$ be tangent to lines $AB,BC,$ and $CA$ at points $C_c,A_c,$ and $B_c,$ respectively. Let $A'$ be the intersection of lines $A_bC_b$ and $A_cB_c.$ Similarly, let $B'$ be the intersection of lines $B_aC_a$ and $A_cB_c,$ and let $C$ be the intersection of lines $B_aC_a$ and $A_bC_b.$ Finally, let the incircle be tangent to sides $a,b,$ and $c$ at points $T_a,T_b,$ and $T_c,$ respectively. a) Prove that lines $A'A_a,B'B_b,$ and $C'C_c$ are concurrent. b) Prove that lines $A'T_a, B'T_b,$ and $C'T_c$ are also concurrent, and their point of intersection is on the line defined by the orthocentre and the incentre of triangle $ABC.$ [i]Proposed by Viktor Csaplár, Bátorkeszi and Dániel Hegedűs, Gyöngyös[/i]

In a company of seven people, any six can sit at a round table so that every two neighbors turn out to be acquaintances. Prove that the whole company can be seated at a round table so that every two neighbors turn out to be acquaintances.

Given the sets of consecutive integers $\{1\}$,$ \{2, 3\}$,$ \{4,5,6\}$,$ \{7,8,9,10\}$,$\; \cdots \; $, where each set contains one more element than the preceding one, and where the first element of each set is one more than the last element of the preceding set. Let $S_n$ be the sum of the elements in the $N$th set. Then $S_{21}$ equals: $\textbf{(A)}\ 1113\qquad \textbf{(B)}\ 4641 \qquad \textbf{(C)}\ 5082\qquad \textbf{(D)}\ 53361\qquad \textbf{(E)}\ \text{none of these}$

Given an integer $n$ greater than $1$, suppose $x_1,x_2,\ldots,x_n$ are integers such that none of them is divisible by $n$, and neither their sum. Prove that there exists atleast $n-1$ non-empty subsets $\mathcal I\subseteq \{1,\ldots, n\}$ such that $\sum_{i\in\mathcal I}x_i$ is divisible by $n$

Five points on a circle are numbered 1,2,3,4, and 5 in clockwise order. A bug jumps in a clockwise direction from one point to another around the circle; if it is on an odd-numbered point, it moves one point, and if it is on an even-numbered point, it moves two points. If the bug begins on point 5, after 1995 jumps it will be on point [asy] size(80); defaultpen(linewidth(0.7)+fontsize(10)); draw(unitcircle); for(int i = 0; i < 5; ++i) { pair P = dir(90+i*72); dot(P); label("$"+string(i+1)+"$",P,1.4*P); }[/asy] $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$