A binary sequence is constructed as follows. If the sum of the digits of the positive integer $k$ is even, the $k$-th term of the sequence is $0$. Otherwise, it is $1$. Prove that this sequence is not periodic.

Suppose we have $2016$ points in a $2$-dimensional plane such that no three lie on a line. Two quadrilaterals are not disjoint if they share an edge or vertex, or if their edges intersect. Show that there are at least $504$ quadrilaterals with vertices among these points such that any two of the quadrilaterals are disjoint.

For each finite set $ U$ of nonzero vectors in the plane we define $ l(U)$ to be the length of the vector that is the sum of all vectors in $ U.$ Given a finite set $ V$ of nonzero vectors in the plane, a subset $ B$ of $ V$ is said to be maximal if $ l(B)$ is greater than or equal to $ l(A)$ for each nonempty subset $ A$ of $ V.$ (a) Construct sets of 4 and 5 vectors that have 8 and 10 maximal subsets respectively. (b) Show that, for any set $ V$ consisting of $ n \geq 1$ vectors the number of maximal subsets is less than or equal to $ 2n.$

If $a$ and $b$ are positive integers such that $a \cdot b = 2400,$ find the least possible value of $a + b.$

Let $n \geq 2$ be a positive integer, and suppose buildings of height $1, 2, \ldots, n$ are built in a row on a street. Two distinct buildings are said to be $\emph{roof-friendly}$ if every building between the two is shorter than both buildings in the pair. For example, if the buildings are arranged $5, 3, 6, 2, 1, 4,$ there are $8$ roof-friendly pairs: $(5, 3), (5, 6), (3, 6), (6, 2), (6, 4), (2, 1),$ $(2, 4), (1, 4).$ Find, with proof, the minimum and maximum possible number of roof-friendly pairs of buildings, in terms of $n.$

Prove that for any triangle the circumscribed circle divides the line segment connecting the center of its inscribed circle with the center of one of the exscribed circles in halves.

$2020$ magicians are divided into groups of $2$ for the Lexington Magic Tournament. After every $5$ days, which is the duration of one match, teams are rearranged so no $2$ people are ever on the same team. If the longest tournament is $n$ days long, what is the value of $n?$ [i]Proposed by Ephram Chun[/i]

In a $2024 \times 2024$ grid of squares, each square is colored either black or white. An ant starts at some black square in the grid and starts walking parallel to the sides of the grid. During this walk, it can choose (not required) to turn $90^\circ$ clockwise or counterclockwise if it is currently on a black square, otherwise it must continue walking in the same direction. A coloring of the grid is called [i]simple[/i] if it is [b]not[/b] possible for the ant to arrive back at its starting location after some time. How many simple colorings of the grid are maximal, in the sense that adding any black square results in a coloring that is not simple?

Let $I, O$ be the incenter, circumcenter of triangle $ABC$ and $A_1, B_1, C_1 $be arbitrary points on the segments $AI, BI, CI$ respectively. The perpendicular bisectors of $AA_1, BB_1, CC_1$ intersect each other at $X, Y$ and $Z$. Prove that the circumcenter of triangle $XYZ$ coincides with $O$ if and only if $I$ is the orthocenter of triangle $A_1B_1C_1$

How many $8$-digit numbers in base $4$ formed of the digits $1,2, 3$ are divisible by $3$?

MO Space City plans to construct $n$ space stations, with a unidirectional pipeline connecting every pair of stations. A station directly reachable from station P without passing through any other station is called a directly reachable station of P. The number of stations jointly directly reachable by the station pair $\{P, Q\}$ is to be examined. The plan requires that all station pairs have the same number of jointly directly reachable stations. (1) Calculate the number of unidirectional cyclic triangles in the space city constructed according to this requirement. (If there are unidirectional pipelines among three space stations A, B, C forming $A \rightarrow B \rightarrow C \rightarrow A$, then triangle ABC is called a unidirectional cyclic triangle.) (2) Can a space city with $n$ stations meeting the above planning requirements be constructed for infinitely many integers $n \geq 3$?

A farmer buys a batch of trees, which he wishes to plant in a square grid. For example, if he had $25$ trees, then he could plant them as shown below. [asy] size(3cm,0); dot((0,0)); dot((0,1)); dot((0,2)); dot((0,3)); dot((0,4)); dot((1,0)); dot((1,1)); dot((1,2)); dot((1,3)); dot((1,4)); dot((2,0)); dot((2,1)); dot((2,2)); dot((2,3)); dot((2,4)); dot((3,0)); dot((3,1)); dot((3,2)); dot((3,3)); dot((3,4)); dot((4,0)); dot((4,1)); dot((4,2)); dot((4,3)); dot((4,4)); [/asy] However, the farmer finds that he cannot plant his trees in a square grid. If he had $20$ more trees, or if he had $39$ fewer trees, then he could plant his trees in a square grid. How many trees did the farmer buy?

$L$ is a Line that intersect with the side $AB,BC,AC$ of triangle $ABC$ at $F,D,E$ The line perpendicular to $BC$ from $D$ intersect $AB,AC$ at $A_{1},A_{2}$ respectively Name $B_{1},B_{2},C_{1},C_{2}$ similarly Prove that the circumcenters of $AA_{1}A_{2},BB_{1}B_{2},CC_{1}C_{2}$ are collinear

Let $ p,q $ be the two most distant points (in the Euclidean sense) of a closed surface $ M $ embedded in the Euclidean space. [b]a)[/b] Show that the tangent planes of $ M $ at $ p $ and $ q $ are parallel. [b]b)[/b] What happened if $ M $ would be a closed curve of $ \mathcal{C}^{\infty } \left(\mathbb{R}^3\right) $ class, instead?

Let $n$ be a positive integer. Denote $M = \{(x, y)|x, y \text{ are integers }, 1 \leq x, y \leq n\}$. Define function $f$ on $M$ with the following properties: [b]a.)[/b] $f(x, y)$ takes non-negative integer value; [b] b.)[/b] $\sum^n_{y=1} f(x, y) = n - 1$ for $1 \eq x \leq n$; [b]c.)[/b] If $f(x_1, y_1)f(x2, y2) > 0$, then $(x_1 - x_2)(y_1 - y_2) \geq 0.$ Find $N(n)$, the number of functions $f$ that satisfy all the conditions. Give the explicit value of $N(4)$.

[b]Q.[/b] Consider in the plane $n>3$ different points. These have the properties, that all $3$ points can be included in a triangle with maximum area $1$. Prove that all the $n>3$ points can be included in a triangle with maximum area $4$. [i]Proposed by TuZo[/i]