A five-digit positive integer $abcde_{10}$ ($a\neq 0$) is said to be a [i]range[/i] if its digits satisfy the inequalities $a<b>c<d>e$. For example, $37452$ is a range. How many ranges are there?

A rectangular field consists of $1520$ unit squares. How many rectangles $6\times1$ at most can be cut out from this field?

Let $n$ be a positive integer. Find the number of sequences $a_1,a_2,...,a_k$ of different numbers from $\{ 1,2,3,...,n\}$ with the following property: for every number $a$ of the sequence (except the first one) there exists a previous number $b$ such that their difference is $1$ (so $a-b= \pm 1$)

We have a deck of $90$ cards that are numbered from $10$ to $99$ (all two-digit numbers). How many sets of three or more different cards in this deck are there such that the number on one of them is the sum of the other numbers, and those other numbers are consecutive?

A rectangular parallelepiped painted blue is cut into $1 \times 1\times 1$ cubes. Find the possible dimensions if the number of cubes without blue faces is equal to one-third of the total number of cubes. [b]Note:[/b] A [i]rectangular parallelepiped[/i] is a solid with $6$ faces, all of which are rectangles (or squares).

Let $m,n$ be positive integers with $m \geq n$, and let $S$ be the set of all $n$-term sequences of positive integers $(a_1, a_2, \ldots a_n)$ such that $a_1 + a_2 + \cdots + a_n = m$. Show that \[\sum_S 1^{a_1} 2^{a_2} \cdots n^{a_n} = {n \choose n} n^m - {n \choose n-1} (n-1)^m + \cdots + (-1)^{n-2} {n \choose 2} 2^m + (-1)^{n-1} {n \choose 1}.\]

We will say that a subset $A$ of the set of non-negative integers is $cool$, if there exist an integer $k$, such that for every integer $n\geq k$ there exists exactly one pair of integers $a>b$ from $A$ such that $n=a+b$. Decide, if there exists a $cool$ set.

$n_1<n_2<\ldots<n_k$ are all positive integer numbers $n$, that have the following property: In a square $n \times n$ one can mark $50$ cells so that in any square $3 \times 3$ an odd number of cells are marked. Find $n_{k-2}$

The Devil and the Man play a game. Initially, the Man pays some cash $s$ to the Devil. Then he lists some $97$ triples $\{i,j,k\}$ consisting of positive integers not exceeding $100$. After that, the Devil draws some convex polygon $A_1A_2...A_{100}$ with area $100$ and pays to the Man, the sum of areas of all triangles $A_iA_jA_k$. Determine the maximal value of $s$ which guarantees that the Man receives at least as much cash as he paid. [i]Proposed by Nikolai Beluhov, Bulgaria[/i]

Alice wrote a sequence of $n > 2$ nonzero nonequal numbers such that each is greater than the previous one by the same amount. Bob wrote the inverses of those n numbers in some order. It so happened that each number in his row also is greater than the previous one by the same amount, possibly not the same as in Alice’s sequence. What are the possible values of $n{}$? [i]Alexey Zaslavsky[/i]

[b]Q[/b] On a \(10 \times 10\) chess board whose colors of square are green and blue in an arbitrary way and we are simultaneously allowed to switch all the colors of all squares in any \((2 \times 2)\) and \((5\times 5)\) region. Can we transform any coloring of the board into one where all squares are blue ? Give a proper explanation of your answer. Note. that if a unit square is part of both the $2\times 2$ and $5\times 5$ region,then its color switched is twice(i.e switching is additive) [i]Proposed by Aritra12[/i]

A square with the dimension $ 1 \times1 $ has been removed from a square board $ 3 ^n \times 3 ^n $ ($ n \in \mathbb {N}, $ $ n> 1 $). a) Prove that any defective board with the dimension $ 3 ^ n \times3 ^ n $ can be covered with shaped figures of shape 1 (the 3 squares' one) and of shape 2 (the 5 squares' one). Figures covering the board must not overlap each other and must not cross the edge of the board. Also the squares removed from the board must not be covered. (b) How many small figures in shape 2 must be used to cover the board? [img]https://cdn.artofproblemsolving.com/attachments/4/7/e970fadd7acc7fd6f5897f1766a84787f37acc.png[/img]

On a blackboard, there are $17$ integers not divisible by $17$. Alice and Bob play a game. Alice starts and they alternately play the following moves: $\bullet$ Alice chooses a number $a$ on the blackboard and replaces it with $a^2$ $\bullet$ Bob chooses a number $b$ on the blackboard and replaces it with $b^3$. Alice wins if the sum of the numbers on the blackboard is a multiple of $17$ after a finite number of steps. Prove that Alice has a winning strategy. (Daniel Holmes)

Q. For integers $m,n\geq 1$, Let $A_{m,n}$ , $B_{m,n}$ and $C_{m,n}$ denote the following sets: $A_{m,n}=\{(\alpha _1,\alpha _2,\ldots,\alpha _m) \colon 1\leq \alpha _1\leq \alpha_2 \leq \ldots \leq \alpha_m\leq n\}$ given that $\alpha _i \in \mathbb{Z}$ for all $i$ $B_{m,n}=\{(\alpha _1,\alpha _2,\ldots ,\alpha _m) \colon \alpha _1+\alpha _2+\ldots + \alpha _m=n\}$ given that $\alpha _i \geq 0$ and $\alpha_ i\in \mathbb{Z}$ for all $i$ $C_{m,n}=\{(\alpha _1,\alpha _2,\ldots,\alpha _m)\colon 1\leq \alpha _1< \alpha_2 < \ldots< \alpha_m\leq n\}$ given that $\alpha _i \in \mathbb{Z}$ for all $i$ $(a)$ Define a one-one onto map from $A_{m,n}$ onto $B_{m+1,n-1}$. $(b)$ Define a one-one onto map from $A_{m,n}$ onto $C_{m,n+m-1}$. $(c)$ Find the number of elements of the sets $A_{m,n}$ and $B_{m,n}$.

$ T$ is a subset of $ {1,2,...,n}$ which has this property : for all distinct $ i,j \in T$ , $ 2j$ is not divisible by $ i$ . Prove that : $ |T| \leq \frac {4}{9}n + \log_2 n + 2$

How many ways are there to arrange the numbers $1$, $2$, $3$, $4$, $5$, $6$ on the vertices of a regular hexagon such that exactly 3 of the numbers are larger than both of their neighbors? Rotations and reflections are considered the same.

Let $P_1P_2...P_n$ be a regular $n$-gon in the plane and $a_1, . . . , a_n$ be nonnegative integers. It is possible to draw $m$ circles so that for each $1 \le i \le n$, there are exactly $a_i$ circles that contain $P_i$ on their interior. Find, with proof, the minimum possible value of $m$ in terms of the $a_i$. .

A coloring of all plane points with coordinates belonging to the set $S=\{0,1,\ldots,99\}$ into red and white colors is said to be [i]critical[/i] if for each $i,j\in S$ at least one of the four points $(i,j),(i + 1,j),(i,j + 1)$ and $(i + 1, j + 1)$ $(99 + 1\equiv0)$ is colored red. Find the maximal possible number of red points in a critical coloring which loses its property after recoloring of any red point into white.

Vincent is playing a game with Evil Bill. The game uses an infinite number of red balls, an infinite number of green balls, and a very large bag. Vincent first picks two nonnegative integers $g$ and $k$ such that $g < k \le 2016$, and Evil Bill places $g$ green balls and $2016 - g$ red balls in the bag, so that there is a total of $2016$ balls in the bag. Vincent then picks a ball of either color and places it in the bag. Evil Bill then inspects the bag. If the ratio of green balls to total balls in the bag is ever exactly $\frac{k}{2016}$ , then Evil Bill wins. If the ratio of green balls to total balls is greater than $\frac{k}{2016}$ , then Vincent wins. Otherwise, Vincent and Evil Bill repeat the previous two actions (Vincent picks a ball and Evil Bill inspects the bag). If $S$ is the sum of all possible values of $k$ that Vincent could choose and be able to win, determine the largest prime factor of $S$.

The spectators are seated in a row with no empty places. Each is in a seat which does not match the spectator's ticket. An usher can order two spectators in adjacent seats to trade places unless one of them is already seated correctly. Is it true that from any initial arrangement, the spectators can be brought to their correct seats?

When Ann meets new people, she tries to find out who is acquainted with who. In order to memorize it she draws a circle in which each person is depicted by a chord; moreover, chords corresponding to acquainted persons intersect (possibly at the ends), while the chords corresponding to non-acquainted persons do not. Ann believes that such set of chords exists for any company. Is her judgement correct? (5)

We consider an $n \times n$ table, with $n\ge1$. Aya wishes to color $k$ cells of this table so that that there is a unique way to place $n$ tokens on colored squares without two tokens are not in the same row or column. What is the maximum value of $k$ for which Aya's wish is achievable?

In conference there $n>2$ mathematicians. Every two mathematicians communicate in one of the $n$ offical languages of the conference. For any three different offical languages the exists three mathematicians who communicate with each other in these three languages. Find all $n$ such that this is possible.

A toymaker has $k$ dice at his disposal, each with $6$ blank sides. On each side of each of these dice, the toymaker must draw one of the digits $0, 1, 2, \ldots , 9$. Determine (in terms of $k$) the largest integer $n$ such that the toymaker can draw digits on the $k$ dice such that, for any positive integer $r \leq n$, it is possible to choose some of the $k$ dice and form with them the decimal representation of $r$. [b]Note:[/b] The digits 6 and 9 are distinguishable: they appear as [u]6[/u] and [u]9[/u].

Let $k\geq4$ be an integer. Sunny and Ming play a game with strings. A string is a sequence that every element of it is an integer between $1$ and $k$, inclusive. At first, Sunny chooses two positive integers $N,L\geq2$ and write down $N$ strings, each having length $L$. Then Ming mark at most $\frac{N}{2}$ strings. Then Sunny chooses an unmarked string $s$ and calculate the biggest integer $n$ such that there exists another string satisfying its first $n$ element is the same as the first $n$ element of $s$. Then Sunny burn down all strings which first $n$ element if different from the first $n$ element of $s$, leaving only the ones which have the same first $n$ element of $s$. Finally, Ming chooses an integer $d$ between $1$ and $k$, inclusive, and remove all strings which $(n+1)$th element is $d$. Sunny's score would be the number of strings left. Find the maximum score that Sunny can guarantee to get. [i]Proposed by USJL[/i]