Steve stands in the middle of a field of an infinitely large chessboard, all of which are fields square and one square meter. Every second it randomly wanders into the middle one of the four neighboring fields, each of which has the same probability. How high is the probability that after $2015$ steps, he will have taken exactly five meters way from his starting square?

Given are finitely many points in the plane, no three on a line. They are painted in four colours, with at least one point of each colour. Prove that there exist three triangles, distinct but not necessarily disjoint, such that the three vertices of each triangle have different colours, and none of them contains a coloured point in its interior.

On the $1$ km long ridge of Mount SPAM, there are $2006$ lemmings. In the beginning, each of them walks along the ridge in one of the two possible directions with speed $1$ m/s . When two lemmings meet, they both reverse the directions they walk but keep their walking speed. When some lemming reaches the end of the ridge, he falls down and dies. Find the least upper bound for the time it can take until all the lemmings are dead.

Consider ten concentric circles and ten rays as in the following figure. At the points where the inner circle is intersected by the rays write successively, in direction clockwise, the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9, 10$. In the next circle we write the numbers $11, 12, 13, 14, 15, 16, 17, 18, 19,20$ successively, and so on successively until the last round were we write the numbers $91, 92, 93, 94, 95, 96, 97, 98, 99, 100$ successively. In this orde, the numbers $1, 11, 21, 31, 41, 51, 61, 71, 81, 91$ are in the same ray, and similarly for the other rays. In front of $50$ of those $100$ numbers, we use the sign ''$-$'' such as: a) in each of the ten rays, exist exactly $5$ signs ''$-$'' , and also b) in each of the ten concentric circles, to be exactly $5$ signs ''$-$''. Prove that the sum of the $100$ signed numbers that occur, equals zero. [img]https://cdn.artofproblemsolving.com/attachments/9/d/ffee6518fcd1b996c31cf06d0ce484a821b4ae.gif[/img]

Let $P$ be a regular $2006$-gon. A diagonal is called [i]good[/i] if its endpoints divide the boundary of $P$ into two parts, each composed of an odd number of sides of $P$. The sides of $P$ are also called [i]good[/i]. Suppose $P$ has been dissected into triangles by $2003$ diagonals, no two of which have a common point in the interior of $P$. Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.

Let $n$ and $k$ be positive integers, and let be the sets $X=\{1,2,3,...,n\}$ and $Y=\{1,2,3,...,k\}$. Let $P$ be the set of all the subsets of the set $X$. Find the number of functions $ f: P \to Y$ that satisfy $f(A \cap B)=\min(f(A),f(B))$ for all $A,B \in P$.

In a regular nonagon, each vertex is colored either red or green. Three corners of the nonagon determine a triangle. Such a triangle is called [i]red [/i] or [i]green [/i] if all its vertices are red or green if all are green. Prove that for each such coloring of the nonagon there are at least two different ones , that are congruent triangles of the same color.

How many one-to-one functions $f : \{1, 2, \cdots, 9\} \rightarrow \{1, 2, \cdots, 9\}$ satisfy (i) and (ii)? (i) $f(1)>f(2)$, $f(9)<9$. (ii) For each $i=3, 4, \cdots, 8$, if $f(1), \cdots, f(i-1)$ are smaller than $f(i)$, then $f(i+1)$ is also smaller than $f(i)$.

Let $A=\{a_1,a_2,\cdots,a_n,b_1,b_2,\cdots,b_n\}$ be a set with $2n$ distinct elements, and $B_i\subseteq A$ for any $i=1,2,\cdots,m.$ If $\bigcup_{i=1}^m B_i=A,$ we say that the ordered $m-$tuple $(B_1,B_2,\cdots,B_m)$ is an ordered $m-$covering of $A.$ If $(B_1,B_2,\cdots,B_m)$ is an ordered $m-$covering of $A,$ and for any $i=1,2,\cdots,m$ and any $j=1,2,\cdots,n,$ $\{a_j,b_j\}$ is not a subset of $B_i,$ then we say that ordered $m-$tuple $(B_1,B_2,\cdots,B_m)$ is an ordered $m-$covering of $A$ without pairs. Define $a(m,n)$ as the number of the ordered $m-$coverings of $A,$ and $b(m,n)$ as the number of the ordered $m-$coverings of $A$ without pairs. $(1)$ Calculate $a(m,n)$ and $b(m,n).$ $(2)$ Let $m\geq2,$ and there is at least one positive integer $n,$ such that $\dfrac{a(m,n)}{b(m,n)}\leq2021,$ Determine the greatest possible values of $m.$

There is a square table with side $n$. Is it possible to enter the numbers $0$, $1$ or $2$ into the cells of this table so that all sums of numbers in rows and columns are different and take values from $1$ to $2n$, if: a) $n = 7$ ? b) $n = 8$ ?

Let $P_1P_2\ldots P_{24}$ be a regular $24$-sided polygon inscribed in a circle $\omega$ with circumference $24$. Determine the number of ways to choose sets of eight distinct vertices from these $24$ such that none of the arcs has length $3$ or $8$.

We assume a truck as a $1 \times (k + 1)$ tile. Our parking is a $(2k + 1) \times (2k + 1)$ table and there are $t$ trucks parked in it. Some trucks are parked horizontally and some trucks are parked vertically in the parking. The vertical trucks can only move vertically (in their column) and the horizontal trucks can only move horizontally (in their row). Another truck is willing to enter the parking lot (it can only enter from somewhere on the boundary). For $3k + 1 < t < 4k$, prove that we can move other trucks forward or backward in such a way that the new truck would be able to enter the lot. Prove that the statement is not necessarily true for $t = 3k + 1$.

Given natural number n. Suppose that $N$ is the maximum number of elephants that can be placed on a chessboard measuring $2 \times n$ so that no two elephants are mutually under attack. Determine the number of ways to put $N$ elephants on a chessboard sized $2 \times n$ so that no two elephants attack each other. Alternative Formulation: Determine the number of ways to put $2015$ elephants on a chessboard measuring $2 \times 2015$ so there are no two elephants attacking each othe PS. Elephant = Bishop

Let $n$ be a positive integer. Prove that the number of lines which go through the origin and precisely one other point with integer coordinates $(x,y),0\le x,y\le n$, is at least $\frac{n^2}{4}$.

A [i]discrete hexagon with center \((a,b,c)\) \emph{(where \(a\), \(b\), \(c\) are integers)[/i] and radius \(r\) [i](a nonnegative integer)[/i]} is the set of lattice points \((x,y,z)\) such that \(x+y+z=a+b+c\) and \(\max(|x-a|,|y-b|,|z-c|)\le r\). Let \(n\) be a nonnegative integer and \(S\) be the set of triples \((x,y,z)\) of nonnegative integers such that \(x+y+z=n\). If \(S\) is partitioned into discrete hexagons, show that at least \(n+1\) hexagons are needed. [i]Proposed by Linus Tang[/i]

A [i] magic square[/i] is a $3\times 3$ grid of numbers in which the sums of the numbers in each row, column, and long diagonal are all equal. How many magic squares exist where each of the integers from $11$ to $19$ inclusive is used exactly once and two of the numbers are already placed as shown below? $\begin{tabular}{|l|l|l|l|} \hline & & 18 \\ \hline & 15 & \\ \hline & & \\ \hline \end{tabular}$

[b]8.1[/b] Four circles are placed on planes so that each one touches the other two externally. Prove that the points of tangency lie on one circle. [img]https://cdn.artofproblemsolving.com/attachments/9/8/883a82fb568954b09a4499a955372e2492dbb8.png[/img] [b]8.2[/b]. Let the integers $a$ and $b$ be represented as $x^2-5y^2$, where $x$ and $y$ are integer numbers. Prove that the number $ab$ can also be presented in this form. [b]8.3[/b] Solve the equation $x(x + d)(x + 2d)(x + 3d) = a$. [b]8.4 / 9.1[/b] Let $a+b+c=1$, $m+n+p=1 $. Prove that $$-1 \le am + bn + cp \le 1 $$ [b]8.5[/b] Inscribe a triangle with the largest area in a semicircle. [b]8.6[/b] Three circles of the same radius intersect at one point. Prove that the other three points intersections lie on a circle of the same radius. [img]https://cdn.artofproblemsolving.com/attachments/4/7/014952f2dcf0349d54b07230e45a42c242a49d.png[/img] [b]8.7[/b] Find the circle of smallest radius that contains a given triangle. [b]8.8 / 9.2[/b] Given a polynomial $$x^{2n} +a_1x^{2n-2} + a_2x^{2n-4} + ... + a_{n-1}x^2 + a_n,$$ which is divisible by $ x-1$. Prove that it is divisible by $x^2-1$. [b]8.9[/b] Prove that for any prime number $p$ other than $2$ and from $5$, there is a natural number $k$ such that only ones are involved in the decimal notation of the number $pk$.. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983459_1962_leningrad_math_olympiad]here[/url].

15 boxes are given. They all are initially empty. By one move it is allowed to choose some boxes and to put in them numbers of apricots which are pairwise distinct powers of 2. Find the least positive integer $k$ such that it is possible to have equal numbers of apricots in all the boxes after $k$ moves.

There are some counters in some cells of $100\times 100$ board. Call a cell [i]nice[/i] if there are an even number of counters in adjacent cells. Can exactly one cell be [i]nice[/i]? [i]K. Knop[/i]

The integer number $n > 1$ is given and a set $S \subset \{0, 1, 2, \ldots, n-1\}$ with $|S| > \frac{3}{4} n$. Prove that there exist integer numbers $a, b, c$ such that the remainders after the division by $n$ of the numbers: \[a, b, c, a+b, b+c, c+a, a+b+c\] belong to $S$.

Let $ A \equal{} (a_{ij})$, where $ i,j \equal{} 1,2,\ldots,n$, be a square matrix with all $ a_{ij}$ non-negative integers. For each $ i,j$ such that $ a_{ij} \equal{} 0$, the sum of the elements in the $ i$th row and the $ j$th column is at least $ n$. Prove that the sum of all the elements in the matrix is at least $ \frac {n^2}{2}$.

$n$ is a fixed natural number. Find the least $k$ such that for every set $A$ of $k$ natural numbers, there exists a subset of $A$ with an even number of elements which the sum of it's members is divisible by $n$.

A sequence of pairwise distinct positive integers is called averaging if each term after the first two is the average of the previous two terms. Let $M$ be the maximum possible number of terms in an averaging sequence in which every term is less than or equal to $2022$ and let $N$ be the number of such distinct sequences (every term less than or equal to $2022$) with exactly $M$ terms. What is $M+N?$ (Two sequences $a_1, a_2, \cdots, a_n$ and $b_1, b_2, \cdots, b_n$ are said to be distinct if $a_i \neq b_i$ for some integer $1 \leq i \leq n$). [i]Proposed by Kyle Lee[/i]

We are given an $18\times 18$ table, all of whose cells may be black or white. Initially all the cells are coloured white. We may perform the following operation: choose one column or one row and change the colour of all cells in this column or row. Is it possible by repeating the operation to obtain a table with exactly $16$ black cells?

For a sequence $a_1<a_2<\cdots<a_n$ of integers, a pair $(a_i,a_j)$ with $1\leq i<j\leq n$ is called [i]interesting[/i] if there exists a pair $(a_k,a_l)$ of integers with $1\leq k<l\leq n$ such that $$\frac{a_l-a_k}{a_j-a_i}=2.$$ For each $n\geq 3$, find the largest possible number of interesting pairs in a sequence of length $n$.