Can the numbers from 1 to 81 be written in a 9×9 board, so that the sum of numbers in each 3×3 square is the same? [i]S. Tokarev[/i]

Consider $9$ points in space, no four of which are coplanar. Each pair of points is joined by an edge (that is, a line segment) and each edge is either colored blue or red or left uncolored. Find the smallest value of $\,n\,$ such that whenever exactly $\,n\,$ edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.

A strip of width $w$ is the set of all points which lie on, or between, two parallel lines distance $w$ apart. Let $S$ be a set of $n$ ($n \ge 3$) points on the plane such that any three different points of $S$ can be covered by a strip of width $1$. Prove that $S$ can be covered by a strip of width $2$.

Let $ N > M > 1$ be fixed integers. There are $ N$ people playing in a chess tournament; each pair of players plays each other once, with no draws. It turns out that for each sequence of $ M \plus{} 1$ distinct players $ P_0, P_1, \ldots P_M$ such that $ P_{i \minus{} 1}$ beat $ P_i$ for each $ i \equal{} 1, \ldots, M$, player $ P_0$ also beat $ P_M$. Prove that the players can be numbered $ 1,2, \ldots, N$ in such a way that, whenever $ a \geq b \plus{} M \minus{} 1$, player $ a$ beat player $ b$. [i]Gabriel Carroll.[/i]

(a) Decide whether the fields of the $8 \times 8$ chessboard can be numbered by the numbers $1, 2, \dots , 64$ in such a way that the sum of the four numbers in each of its parts of one of the forms [list][img]http://www.artofproblemsolving.com/Forum/download/file.php?id=28446[/img][/list] is divisible by four. (b) Solve the analogous problem for [list][img]http://www.artofproblemsolving.com/Forum/download/file.php?id=28447[/img][/list]

Suppose there are 18 lighthouses on the Persian Gulf. Each of the lighthouses lightens an angle with size 20 degrees. Prove that we can choose the directions of the lighthouses such that whole of the blue Persian (always Persian) Gulf is lightened.

Let $ A_0 \equal{} (a_1,\dots,a_n)$ be a finite sequence of real numbers. For each $ k\geq 0$, from the sequence $ A_k \equal{} (x_1,\dots,x_k)$ we construct a new sequence $ A_{k \plus{} 1}$ in the following way. 1. We choose a partition $ \{1,\dots,n\} \equal{} I\cup J$, where $ I$ and $ J$ are two disjoint sets, such that the expression \[ \left|\sum_{i\in I}x_i \minus{} \sum_{j\in J}x_j\right| \] attains the smallest value. (We allow $ I$ or $ J$ to be empty; in this case the corresponding sum is 0.) If there are several such partitions, one is chosen arbitrarily. 2. We set $ A_{k \plus{} 1} \equal{} (y_1,\dots,y_n)$ where $ y_i \equal{} x_i \plus{} 1$ if $ i\in I$, and $ y_i \equal{} x_i \minus{} 1$ if $ i\in J$. Prove that for some $ k$, the sequence $ A_k$ contains an element $ x$ such that $ |x|\geq\frac n2$. [i]Author: Omid Hatami, Iran[/i]

Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.

A graup of pirates had an argument and not each of them holds some other two at gunpoint.All the pirates are called one by one in some order.If the called pirate is still alive , he shoots both pirates he is aiming at ( some of whom might already be dead .) All shorts are immediatcly lethal . After all the pirates have been called , it turns out the exactly $28$ pirates got killed . Prove that if the pirates were called in whatever other order , at least $10$ pirates would have been killed anyway.

There are $9$ visually indistinguishable coins, and one of them is fake and thus lighter. We are given $3$ indistinguishable balance scales to find the fake coin; however, one of the scales is defective and shows a random result each time. Show that the fake coin can still be found with $4$ weighings.

Suppose $a_i, b_i, c_i, i=1,2,\cdots ,n$, are $3n$ real numbers in the interval $\left [ 0,1 \right ].$ Define $$S=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k<1 \right \}, \; \; T=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k>2 \right \}.$$ Now we know that $\left | S \right |\ge 2018,\, \left | T \right |\ge 2018.$ Try to find the minimal possible value of $n$.

In a country, mathematicians chose an $\alpha> 2$ and issued coins in denominations of 1 ruble, as well as $\alpha ^k$ rubles for each positive integer k. $\alpha$ was chosen so that the value of each coins, except the smallest, was irrational. Is it possible that any natural number of rubles can be formed with at most 6 of each denomination of coins?

An integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. [quote]For example, 4 can be partitioned in five distinct ways: 4 3 + 1 2 + 2 2 + 1 + 1 1 + 1 + 1 + 1[/quote] The number of partitions of n is given by the partition function $p\left ( n \right )$. So $p\left ( 4 \right ) = 5$ . Determine all the positive integers so that $p\left ( n \right )+p\left ( n+4 \right )=p\left ( n+2 \right )+p\left ( n+3 \right )$.

[b]p1.[/b] (a) Put the numbers $1$ to $6$ on the circle in such way that for any five consecutive numbers the sum of first three (clockwise) is larger than the sum of remaining two. (b) Can you arrange these numbers so it works both clockwise and counterclockwise. [b]p2.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p3.[/b] Find any integer solution of the puzzle: $WE+ST+RO+NG=128$ (different letters mean different digits between $1$ and $9$). [b]p4.[/b] Two consecutive three‐digit positive integer numbers are written one after the other one. Show that the six‐digit number that is obtained is not divisible by $1001$. [b]p5.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We write $1$ or $-1$ on each unit square of a $2007 \times 2007$ board. Find the number of writings such that for every square on the board the absolute value of the sum of numbers on the square is less then or equal to $1$.

[b]p1.[/b] A straight line is painted in two colors. Prove that there are three points of the same color such that one of them is located exactly at the midpoint of the interval bounded by the other two. [b]p2.[/b] Find all positive integral solutions $x, y$ of the equation $xy = x + y + 3$. [b]p3.[/b] Can one cut a square into isosceles triangles with angle $80^o$ between equal sides? [b]p4.[/b] $20$ children are grouped into $10$ pairs: one boy and one girl in each pair. In each pair the boy is taller than the girl. Later they are divided into pairs in a different way. May it happen now that (a) in all pairs the girl is taller than the boy; (b) in $9$ pairs out of $10$ the girl is taller than the boy? [b]p5.[/b] Mr Mouse got to the cellar where he noticed three heads of cheese weighing $50$ grams, $80$ grams, and $120$ grams. Mr. Mouse is allowed to cut simultaneously $10$ grams from any two of the heads and eat them. He can repeat this procedure as many times as he wants. Can he make the weights of all three pieces equal? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In Lineland there are $n\geq1$ towns, arranged along a road running from left to right. Each town has a [i]left bulldozer[/i] (put to the left of the town and facing left) and a [i]right bulldozer[/i] (put to the right of the town and facing right). The sizes of the $2n$ bulldozers are distinct. Every time when a left and right bulldozer confront each other, the larger bulldozer pushes the smaller one off the road. On the other hand, bulldozers are quite unprotected at their rears; so, if a bulldozer reaches the rear-end of another one, the first one pushes the second one off the road, regardless of their sizes. Let $A$ and $B$ be two towns, with $B$ to the right of $A$. We say that town $A$ can [i]sweep[/i] town $B$ [i]away[/i] if the right bulldozer of $A$ can move over to $B$ pushing off all bulldozers it meets. Similarly town $B$ can sweep town $A$ away if the left bulldozer of $B$ can move over to $A$ pushing off all bulldozers of all towns on its way. Prove that there is exactly one town that cannot be swept away by any other one.

Two fair six-sided dice are rolled. The probability that the positive difference between the two rolls is at least $4$ can be written in simplest form as $\frac{m}{n}$. Compute $m + n$.

The Abba tribe language alphabet contains two letters only. Not a word of this language is a beginning of another word. Can this tribe vocabulary contain $3$ four-letter, $10$ five-letter, $30$ six-letter and $5$ seven-letter words?

Let $n$ be a positive integer and $\mathcal S$ be the set of points $(x, y)$ with $x, y \in \{1, 2, \ldots , n\}$. Let $\mathcal T$ be the set of all squares with vertices in the set $\mathcal S$. We denote by $a_k$ ($k \geq 0$) the number of (unordered) pairs of points for which there are exactly $k$ squares in $\mathcal T$ having these two points as vertices. Prove that $a_0 = a_2 + 2a_3$. [i]Yugoslavia[/i]

[b]p1.[/b] Find the last digit of $2022^{2022}$. [b]p2.[/b] Let $a_1 < a_2 <... < a_8$ be eight real numbers in an increasing arithmetic progression. If $a_1 + a_3 + a_5 + a_7 = 39$ and $a_2 + a_4 + a_6 + a_8 = 40$, determine the value of $a_1$. [b]p3.[/b] Patrick tries to evaluate the sum of the first $2022$ positive integers, but accidentally omits one of the numbers, $N$, while adding all of them manually, and incorrectly arrives at a multiple of $1000$. If adds correctly otherwise, find the sum of all possible values of $N$. [b]p4.[/b] A machine picks a real number uniformly at random from $[0, 2022]$. Andrew randomly chooses a real number from $[2020, 2022]$. The probability that Andrew’s number is less than the machine’s number is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]p5.[/b] Let $ABCD$ be a square and $P$ be a point inside it such that the distances from $P$ to sides $AB$ and $AD$ respectively are $2$ and $4$, while $PC = 6$. If the side length of the square can be expressed in the form $a +\sqrt{b}$ for positive integers $a, b$, then determine $a + b$. [b]p6.[/b] Positive integers $a_1, a_2, ..., a_{20}$ sum to $57$. Given that $M$ is the minimum possible value of the quantity $a_1!a_2!...a_{20}!$, find the number of positive integer divisors of $M$. [b]p7.[/b] Jessica has $16$ balls in a box, where $15$ of them are red and one is blue. Jessica draws balls out the box three at a time until one of the three is blue. If she ever draws three red marbles, she discards one of them and shuffles the remaining two back into the box. The expected number of draws it takes for Jessica to draw the blue ball can be written as a common fraction $\frac{m}{n}$ where $m, n$ are relatively prime positive integers. Find $m + n$. [b]p8.[/b] The Lucas sequence is defined by these conditions: $L_0 = 2$, $L_1 = 1$, and $L_{n+2} =L_{n+1} +L_n$ for all $n \ge 0$. Determine the remainder when $L^2_{2019} +L^2_{2020}$ is divided by $L_{2023}$. [b]p9.[/b] Let $ABCD$ be a parallelogram. Point $P$ is selected in its interior such that the distance from $P$ to $BC$ is exactly $6$ times the distance from $P$ to $AD$, and $\angle APB = \angle CPD = 90^o$. Given that $AP = 2$ and $CP = 9$, the area of $ABCD$ can be expressed as $m\sqrt{n}$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m + n$. [b]p10.[/b] Consider the polynomial $P(x) = x^{35} + ... + x + 1$. How many pairs $(i, j)$ of integers are there with $0 \le i < j \le 35$ such that if we flip the signs of the $x^i$ and $x^j$ terms in $P(x)$ to form a new polynomial $Q(x)$, then there exists a nonconstant polynomial $R(x)$ with integer coefficients dividing both $P(x)$ and $Q(x)$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There is a $8*8$ board and the numbers $1,2,3,4,...,63,64$. In all the unit squares of the board, these numbers are places such that only $1$ numbers goes to only one unit square. Prove that there is atleast $4$ $2*2$ squares such that the sum of the numbers in $2*2$ is greater than $100$.

Examine if we can put the sixteen positive divisors of $2024$ on the cells of the table shown such that the sum of the four numbers of any line or row to be a multiple of $3$. $ \begin{tabular}{ | l | c | c | r| } \hline & & & \\ \hline & & & \\ \hline & & & \\ \hline & & & \\ \hline \end{tabular} $

Compute the number of ordered quadruples of positive integers $(a,b,c,d)$ such that $$a!b!c!d!=24!$$$\textbf{(A)}~4$ $\textbf{(B)}~4!$ $\textbf{(C)}~4^4$ $\textbf{(D)}~\text{None of the above}$

Let $n$ be a positive integer. Find the smallest positive integer $k$ with the property that for any colouring nof the squares of a $2n$ by $k$ chessboard with $n$ colours, there are $2$ columns and $2$ rows such that the $4$ squares in their intersections have the same colour.