Given any integer $n\geq 3$. A finite series is called $n$-series if it satisfies the following two conditions $1)$ It has at least $3$ terms and each term of it belongs to $\{ 1,2,...,n\}$ $2)$ If series has $m$ terms $a_1,a_2,...,a_m$ then $(a_{k+1}-a_k)(a_{k+2}-a_k)<0$ for all $k=1,2,...,m-2$ How many $n$-series are there $?$

Let $n$, $d$ be positive integers such that $d>\frac{n}{2}$. Suppose $a_1, a_2,\cdots,a_{d+2}$ is a sequence of integers satisfying $a_{d+1}=a_1$, $a_{d+2}=a_2$, and for all indices $1\le i_1<i_2<\cdots <i_s\le d$, $$a_{i_1}+a_{i_2}+\cdots+a_{i_s}\not\equiv 0\pmod n$$ Prove that there exists $1\le i\le d$ such that $$a_{i+1}\equiv a_i \pmod n \quad \text{or} \quad a_{i+1}\equiv a_i+a_{i+2} \pmod n$$ [i]Proposed by Yeoh Zi Song[/i]

Leo and Paul are at the Berkeley BART station and are racing to San Francisco. Leo is planning to take the line that takes him directly to SF, and because he has terrible BART luck, his train will arrive in some integer number of minutes, with probability $\frac i{210}$ for $1\le i\le20$ at any given minute. Paul will take a second line, whose trains always arrive before Leo’s train, with uniform probability. However, Paul must also make a transfer to a 3rd line, whose trains arrive with uniform probability between $0$ and $10$ minutes after Paul reaches the transfer station. What is the probability that Leo gets to SF before Paul does?

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

On a square board with $m$ rows and $n$ columns, where $m\le n$, some squares are colored black in such a way that no two rows are alike. Find tha biggest integer $k$ such that, for every possible coloring to start with, one can always color $k$ columns entirely red in such a way that still no two rows are alike.

While waiting for their food at a restaurant in Harvard Square, Ana and Banana draw $3$ squares $\square_1, \square_2, \square_3$ on one of their napkins. Starting with Ana, they take turns filling in the squares with integers from the set $\{1,2,3,4,5\}$ such that no integer is used more than once. Ana's goal is to minimize the minimum value that the polynomial $a_1x^2 + a_2x + a_3$ attains over all real $x$, where $a_1, a_2, a_3$ are the integers written in $\square_1, \square_2, \square_3$ respectively. Banana aims to maximize $M$. Assuming both play optimally, compute the final value of $100a_1+10a_2+a_3$.

The edges of a graph with $2n$ vertices ($n \ge 4$) are colored in blue and red such that there is no blue triangle and there is no red complete subgraph with $n$ vertices. Find the least possible number of blue edges.

A $2003\times 2004$ rectangle consists of unit squares. We consider rhombi formed by four diagonals of unit squares. What maximum number of such rhombi can be arranged in this rectangle so that no two of them have any common points except vertices? [i]Proposed by A. Golovanov[/i]

Three non-negative integers are written on a blackboard. A move is to replace two of the integers $k,m$ by $k+m$ and $|k-m|$. Determine whether we can always end with triplet which has at least two zeros

In a basketball competition, $n$ teams took part. Each pair of teams played exactly one match, and there were no draws. At the end of the competition the $i$-th team had $x_i$ wins and $y_i$ defeats $(i=1,\ldots,n)$. Prove that $x_1^2+x_2^2+\ldots+x_n^2=y_1^2+y_2^2+\ldots+y_n^2$.

Each square of a $100\times 100$ board is painted with one of $100$ different colours, so that each colour is used exactly $100$ times. Show that there exists a row or column of the chessboard in which at least $10$ colours are used.

In a chess tournament $ 2n\plus{}3$ players take part. Every two play exactly one match. The schedule is such that no two matches are played at the same time, and each player, after taking part in a match, is free in at least $ n$ next (consecutive) matches. Prove that one of the players who play in the opening match will also play in the closing match.

Let $n$ be a fixed positive odd integer. Take $m+2$ [b]distinct[/b] points $P_0,P_1,\ldots ,P_{m+1}$ (where $m$ is a non-negative integer) on the coordinate plane in such a way that the following three conditions are satisfied: 1) $P_0=(0,1),P_{m+1}=(n+1,n)$, and for each integer $i,1\le i\le m$, both $x$- and $y$- coordinates of $P_i$ are integers lying in between $1$ and $n$ ($1$ and $n$ inclusive). 2) For each integer $i,0\le i\le m$, $P_iP_{i+1}$ is parallel to the $x$-axis if $i$ is even, and is parallel to the $y$-axis if $i$ is odd. 3) For each pair $i,j$ with $0\le i<j\le m$, line segments $P_iP_{i+1}$ and $P_jP_{j+1}$ share at most $1$ point. Determine the maximum possible value that $m$ can take.

Two square sheets have areas equal to $ 2003$. Each of the sheets is arbitrarily divided into $ 2003$ nonoverlapping polygons, besides, each of the polygons has an unitary area. Afterward, one overlays two sheets, and it is asked to prove that the obtained double layer can be punctured $ 2003$ times, so that each of the $ 4006$ polygons gets punctured precisely once.

Two unit squares are stacked on top of one another to form a $1 \times 2$ rectangle. Each of the seven edges is colored either red or blue. How many ways are there to color the edges in this way such that there is exactly one path along all-blue edges from the bottom-left corner to the top-right corner?

Twenty-five people of different heights stand in a $5\times 5$ grid of squares, with one person in each square. We know that each row has a shortest person, suppose Ana is the tallest of these five people. Similarly, we know that each column has a tallest person, suppose Bev is the shortest of these five people. Assuming Ana and Bev are not the same person, who is taller: Ana or Bev? Prove that your answer is always correct.

An ant starts at the point $(1, 0)$. Each minute, it walks from its current position to one of the four adjacent lattice points until it reaches a point $(x, y)$ with $|x| + |y| \le 2$. What is the probability that the ant ends at the point $(1, 1)$?

Let n be the natural number ($n\ge 2$). All natural numbers from $1$ up to $n$ ,inclusive, are written on the board in some order: $a_1$, $a_2$ , $...$ , $a_n$. Determine all natural numbers $n$ ($n\ge 2$), for which the product $$P = (1 + a_1) \cdot (2 + a_2) \cdot ... \cdot (n + a_n)$$ is an even number, whatever the arrangement of the numbers written on the board.

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

Let $T$ be a triangle whose vertices have integer coordinates, such that each side of $T$ contains exactly $m$ points with integer coordinates. If the area of $T$ is less than $2020$, determine the largest possible value of $m$.

Let there be given triples of integers $(r_j,s_j,t_j),~j=1,2,\ldots,N$, such that for each $j$, $r_j,t_j,s_j$ are not all even. Show that one can find integers $a,b,c$ such that $ar_j+bs_j+ct_j$ is odd for at least $\frac{4N}7$ of the indices $j$.

Let $M=\{1,2,...,n\}$. Prove that the number of pairs $(A,a)$, where $A\subset M$ and $a$ is a permutation of $M$, for which $a(A)\cap A=\emptyset $, is equal to $n!.F_{n+1}$, where $F_{n+1}$ is the $n+1$ member of the Fibonacci sequence.

Find all positive integers $n$ such that the elements of $$\{1,2,...,2n+1\}-\{n+1\}$$ can be partitioned into two groups with the same number of elements and the same sum of their elements.

Each of the spots in a $8\times 8$ chessboard is occupied by either a black or white “horse”. At most how many black horses can be on the chessboard so that none of the horses attack more than one black horse? [b]Remark:[/b] A black horse could attack another black horse.

Find all positive integers $n$ for which all positive divisors of $n$ can be put into the cells of a rectangular table under the following constraints: [list] [*]each cell contains a distinct divisor; [*]the sums of all rows are equal; and [*]the sums of all columns are equal. [/list]