There are some papers of the size $5\times 5$ with two sides which are divided into unit squares for both sides. One uses $n$ colors to paint each cell on the paper, one cell by one color, such that two cells on the same positions for two sides are painted by the same color. Two painted papers are consider as the same if the color of two corresponding cells are the same. Prove that there are no more than $$\frac{1}{8}\left( {{n}^{25}}+4{{n}^{15}}+{{n}^{13}}+2{{n}^{7}} \right)$$ pairwise distinct papers that painted by this way.

In the unit squares of a transparent $1 \times 100$ tape, numbers $1,2,\cdots,100$ are written in the ascending order.We fold this tape on it's lines with arbitrary order and arbitrary directions until we reach a $1 \times1$ tape with $100$ layers.A permutation of the numbers $1,2,\cdots,100$ can be seen on the tape, from the top to the bottom. Prove that the number of possible permutations is between $2^{100}$ and $4^{100}$. ([i]e.g.[/i] We can produce all permutations of numbers $1,2,3$ with a $1\times3$ tape) [i]Proposed by Morteza Saghafian[/i]

Let $a$, $b$, $n$ be positive integers such that $a + b \leq n^2$. Alice and Bob play a game on an (initially uncoloured) $n\times n$ grid as follows: - First, Alice paints $a$ cells green. - Then, Bob paints $b$ other (i.e.uncoloured) cells blue. Alice wins if she can find a path of non-blue cells starting with the bottom left cell and ending with the top right cell (where a path is a sequence of cells such that any two consecutive ones have a common side), otherwise Bob wins. Determine, in terms of $a$, $b$ and $n$, who has a winning strategy.

Michael and Steven are playing the card game War with a deck of $4$ cards numbered $1$ through $4.$ The deck is shuffled randomly and Michael gets a stack of $1$ card and Steven gets a stack of $3$ cards. In each round, the players reveal the top card from their stack, and the player whose card was higher collects both cards to the bottom of their stack in random order. A player wins when they get all four cards in their hand. The probability that Michael wins after exactly $5$ rounds is $\tfrac{m}{n}$ for coprime positive integers $m$ and $n.$ Find $m + n.$

In a contest, there are $m$ candidates and $n$ judges, where $n\geq 3$ is an odd integer. Each candidate is evaluated by each judge as either pass or fail. Suppose that each pair of judges agrees on at most $k$ candidates. Prove that \[{\frac{k}{m}} \geq {\frac{n-1}{2n}}. \]

Call a polygon [i]normal[/i] if it can be inscribed in a unit circle. How many non-congruent normal polygons are there such that the square of each side length is a positive integer?

Ten students are standing in a line. A teacher wants to place a hat on each student. He has two colors of hats, red and white, and he has $10$ hats of each color. Determine the number of ways in which the teacher can place hats such that among any set of consecutive students, the number of students with red hats and the number of students with blue hats differ by at most $2$

A wheel consists of a fixed circular disk and a mobile circular ring. On the disk the numbers $1, 2, 3, \ldots ,N$ are marked, and on the ring $N$ integers $a_1,a_2,\ldots ,a_N$ of sum $1$ are marked. The ring can be turned into $N$ different positions in which the numbers on the disk and on the ring match each other. Multiply every number on the ring with the corresponding number on the disk and form the sum of $N$ products. In this way a sum is obtained for every position of the ring. Prove that the $N$ sums are different.

We are given an equilateral triangle ABC with the length of its side equal to $1$. There are $n-1$ points on each side of the triangle $ABC$ that equally divide the side into $n$ segments. We draw all possible lines that pass through any two of all those $3(n-1)$ points such that they are parallel to one of three sides of triangle $ABC$. All such lines divide triangle $ABC$ into some lesser triangles whose vertices are called [i]nodes[/i]. We assign a real number for each [i]node[/i] such that the following conditions are satisfied: (I) real numbers $a,b,c$ are assigned to $A,B,C$ respectively; (II) for any rhombus that is consisted of two lesser triangles that share a common side, the sum of the numbers of vertices on its one diagonal is equal to that of vertices on the other diagonal. 1) Find the minimum distance between the [i]node[/i] with the maximal number to the [i]node[/i] with the minimal number; 2) Denote by $S$ the sum of the numbers of all [i]nodes[/i], find $S$.

Let $ k > 1$ be an integer, and consider the infinite array given by the integer lattice in the first quadrant of the plane, filled with real numbers. The array is said to be constant if all its elements are equal in value. The array is said to be $ k$-balanced if it is non-constant, and the sums of the elements of any $ k\times k$ sub-square have a constant value $ v_k$. An array which is both $ p$-balanced and $ q$-balanced will be said to be $ (p, q)$-balanced, or just doubly-balanced, if there is no confusion as to which $ p$ and $ q$ are meant. If $p, q$ are relatively prime, the array is said to be co-prime. We will call $ (M\times N)$-seed a $ M \times N$ array, anchored with its lower left corner in the origin of the plane, which extended through periodicity in both dimensions in the plane results into a $ (p, q)$-balanced array; more precisely, if we denote the numbers in the array by $ a_{ij}$ , where $ i, j$ are the coordinates of the lower left corner of the unit square they lie in, we have, for all non-negative integers $ i, j$ \[ a_{i \plus{} M,j} \equal{} a_{i,j} \equal{} a_{i,j \plus{} N}\] (a) Prove that $ q^2v_p \equal{} p^2v_q$ for a $ (p, q)$-balanced array. (b) Prove that more than two different values are used in a co-prime $ (p,q)$-balanced array. Show that this is no longer true if $ (p, q) > 1$. (c) Prove that any co-prime $ (p, q)$-balanced array originates from a seed. (d) Show there exist $ (p, q)$-balanced arrays (using only three different values) for arbitrary values $ p, q$. (e) Show that neither a $ k$-balanced array, nor a $ (p, q)$-balanced array if $ (p, q) > 1$, need originate from a seed. (f) Determine the minimal possible value $ T$ for a square $ (T\times T)$-seed resulting in a co-prime $ (p, q)$-balanced array, when $p,q$ are both prime. (g) Show that for any relatively prime $ p, q$ there must exist a co-prime $ (p, q)$-balanced array originating from a square $ (T\times T)$-seed, with no lesser $ (M\times N)$-seed available ($ M\leq T, N\leq T$ and $MN< T^2$). [i]Dan Schwarz[/i]

Fine Hall has a broken elevator. Every second, it goes up a floor, goes down a floor, or stays still. You enter the elevator on the lowest floor, and after $8$ seconds, you are again on the lowest floor. If every possible such path is equally likely to occur, the probability you experience no stops is $\tfrac{a}{b},$ where $a,b$ are relatively prime positive integers. Find $a + b.$

In a summer camp that is going to last $n$ weeks, you want to divide the time into $3$ periods so that each period starts on a Monday and ends on a Sunday. The first period will be dedicated to artistic work, the second will be for sports and in the third there will be a technological workshop. During each term, a Monday will be chosen for an expert on the topic of the term to give a talk. Let $C(n)$ be the number of ways in which the activity calendar can be made. (For example, if $n=10$ one way the calendar could be done is by putting the first four weeks for art and the artist talk on the first Monday; the next $5$ weeks could be for sports, with the athlete visit on the fourth Monday of that period; the remaining week would be for the technology workshop and the talk would be on Monday of that week.) Calculate $C(8)$.

Find the number of all integer-sided [i]isosceles obtuse-angled[/i] triangles with perimeter $ 2008$. [16 points out of 100 for the 6 problems]

Is it possible to use $2 \times 1$ dominoes to cover a $2k \times 2k$ checkerboard which has $2$ squares, one of each colour, removed ?

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

In a country with $n$ cities, some pairs of cities are connected by one-way flights operated by one of two companies $A$ and $B$. Two cities can be connected by more than one flight in either direction. An $AB$-word $w$ is called implementable if there is a sequence of connected flights whose companies’ names form the word $w$. Given that every $AB$-word of length $ 2^n $ is implementable, prove that every finite $AB$-word is implementable. (An $AB$-word of length $k$ is an arbitrary sequence of $k$ letters $A $ or $B$; e.g. $ AABA $ is a word of length $4$.)

Consider $n$ points $A_1, A_2, \ldots, A_n$ on a circle. How many ways are there if we want to color these points by $p$ colors, so that each two neighbors points are colored with two different colors?

Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.

There are $ n$ students; each student knows exactly $d $ girl students and $d $ boy students ("knowing" is a symmetric relation). Find all pairs $ (n,d) $ of integers .

Let $ S\equal{}\{1,2,\ldots,n\}$. Let $ A$ be a subset of $ S$ such that for $ x,y\in A$, we have $ x\plus{}y\in A$ or $ x\plus{}y\minus{}n\in A$. Show that the number of elements of $ A$ divides $ n$.

Let $a_1, a_2, \ldots, a_n$ be $n$ positive integers, and let $b_1, b_2, \ldots, b_m$ be $m$ positive integers such that $a_1 a_2 \cdots a_n = b_1 b_2 \cdots b_m$. Prove that a rectangular table with $n$ rows and $m$ columns can be filled with positive integer entries in such a way that * the product of the entries in the $i$-th row is $a_i$ (for each $i \in \left\{1,2,\ldots,n\right\}$); * the product of the entries in the $j$-th row is $b_j$ (for each $i \in \left\{1,2,\ldots,m\right\}$).

$1\times 2$ dominoes are placed on an $8 \times 8$ chessboard without overlapping. They may partially stick out from the chessboard but the center of each domino must be strictly inside the chessboard (not on its border). Place on the chessboard in such a way: a) at least $40$ dominoes, (3 points) b) at least $41$ dominoes, (3 points) c) more than $41$ dominoes. (6 points) [i](Mikhail Evdokimov)[/i]

$16$ pieces of the shape $1\times 3$ are placed on a $7\times 7$ chessboard, each of which is exactly three fields. One field remains free. Find all possible positions of this field.

In plane there are $n$ noncollinear points $A_1$, $A_2$,...,$A_n$. Prove that there exist a line which passes through exactly two of these points

Consider $n$ events, each of which has probability $\frac12$. We also know that the probability of any two both happening is $\frac14$. Prove the following. (a) The probability that none of these events happen is at most $\frac1{n+1}$. (b) We can reach equality in (a) for infinitely many $n$.