Exactly one number from the set $\{ -1,0,1 \}$ is written in each unit cell of a $2005 \times 2005$ table, so that the sum of all the entries is $0$. Prove that there exist two rows and two columns of the table, such that the sum of the four numbers written at the intersections of these rows and columns is equal to $0$.

In ZS Chess, an Ivanight attacks like a knight, except that if the attacked square is out of range, it goes through the edge and comes out from the other side of the board, and attacks that square instead. The ZS chessboard is an $8 \times 8$ board, where cells are coloured with $n$ distinct colours, where $n$ is a natural number, such that a Ivanight placed on any square attacks $ 8 $ squares that consist of all $n$ colours, and the colours appear equally many times in those $ 8 $ squares. For which values of $n$ does such a ZS chess board exist?

Let $n$ be a positive integer. Given a sequence $\varepsilon_1$, $\dots$, $\varepsilon_{n - 1}$ with $\varepsilon_i = 0$ or $\varepsilon_i = 1$ for each $i = 1$, $\dots$, $n - 1$, the sequences $a_0$, $\dots$, $a_n$ and $b_0$, $\dots$, $b_n$ are constructed by the following rules: \[a_0 = b_0 = 1, \quad a_1 = b_1 = 7,\] \[\begin{array}{lll} a_{i+1} = \begin{cases} 2a_{i-1} + 3a_i, \\ 3a_{i-1} + a_i, \end{cases} & \begin{array}{l} \text{if } \varepsilon_i = 0, \\ \text{if } \varepsilon_i = 1, \end{array} & \text{for each } i = 1, \dots, n - 1, \\[15pt] b_{i+1}= \begin{cases} 2b_{i-1} + 3b_i, \\ 3b_{i-1} + b_i, \end{cases} & \begin{array}{l} \text{if } \varepsilon_{n-i} = 0, \\ \text{if } \varepsilon_{n-i} = 1, \end{array} & \text{for each } i = 1, \dots, n - 1. \end{array}\] Prove that $a_n = b_n$. [i]Proposed by Ilya Bogdanov, Russia[/i]

Consider a latin square of size $n$. We are allowed to choose a $1 \times 1$ square in the table, and add $1$ to any number on the same row and column as the chosen square (the original square will be counted aswell) , or we can add $-1$ to all of them instead. Can we with doing finitly many operation , reach any latin square of size $n?$

Each cell of a $100$ x $100$ board is painted in one of $100$ different colors so that there are exactly $100$ cells of each color. Prove that there is a row or column in which there are at least $10$ cells of different colors.

Consider constructing a tower of tables of numbers as follows. The first table is a one by one array containing the single number $1$. The second table is a two by two array formed underneath the first table and built as followed. For each entry, we look at the terms in the previous table that are directly up and to the left, up and to the right, and down and to the right of the entry, and we fill that entry with the sum of the numbers occurring there. If there happens to be no term at a particular location, it contributes a value of zero to the sum. [img]https://cdn.artofproblemsolving.com/attachments/d/8/ab56dddfc23e84348e205f031001d157cb8386.png[/img] The diagram above shows how we compute the second table from the first. The diagram below shows how to then compute the third table from the second. [img]https://cdn.artofproblemsolving.com/attachments/9/3/e1d8cf0fd0b71b970625a4fa97bc2912492a78.png[/img] For example, the entry in the middle row and middle column of the third table is equal the sum of the top left entry $1$, the top right entry $0$, and the bottom right entry $1$ from the second table, which is just $2$. Similarly, to compute the bottom rightmost entry in the third table, we look above it to the left and see that the entry in the second table’s bottom rightmost entry is $1$. There are no entries from the second table above it and to the right or below it and to the right, so we just take this entry in the third table to be $1$. We continue constructing the tower by making more tables from the previous tables. Find the entry in the third (from the bottom) row of the third (from the left) column of the tenth table in this resulting tower.

In a $44\times 44$ board, some of the cells are blue, and the rest are red. No blue cells borders another blue cell on the side. The red cells, on the other hand, form a connected component (one may get from any red cell to any other red cell only by traversing edge-adjacent red cells). Prove that less than one third of the cells on the board are blue. [i]Proposed by B. Frenkin[/i]

On a party with $99$ guests, hosts Ann and Bob play a game (the hosts are not regarded as guests). There are $99$ chairs arranged in a circle; initially, all guests hang around those chairs. The hosts take turns alternately. By a turn, a host orders any standing guest to sit on an unoccupied chair $c$. If some chair adjacent to $c$ is already occupied, the same host orders one guest on such chair to stand up (if both chairs adjacent to $c$ are occupied, the host chooses exactly one of them). All orders are carried out immediately. Ann makes the first move; her goal is to fulfill, after some move of hers, that at least $k$ chairs are occupied. Determine the largest $k$ for which Ann can reach the goal, regardless of Bob's play.

Manzi has $n$ stamps and an album with $10$ pages. He distributes the $n$ stamps in the album such that each page has a distinct number of stamps. He finds that, no matter how he does this, there is always a set of $4$ pages such that the total number of stamps in these $4$ pages is at least $\frac{n}{2}$. Determine the maximum possible value of $n$.

How many $3$-digit numbers contain the digit $7$ exactly once?

[b]p1.[/b] A bus leaves San Mateo with $n$ fairies on board. When it stops in San Francisco, each fairy gets off, but for each fairy that gets off, $n$ fairies get on. Next it stops in Oakland where $6$ times as many fairies get off as there were in San Mateo. Finally the bus arrives at Berkeley, where the remaining $391$ fairies get off. How many fairies were on the bus in San Mateo? [b]p2.[/b] Let $a$ and $b$ be two real solutions to the equation $x^2 + 8x - 209 = 0$. Find $\frac{ab}{a+b}$ . Express your answer as a decimal or a fraction in lowest terms. [b]p3.[/b] Let $a$, $b$, and $c$ be positive integers such that the least common multiple of $a$ and $b$ is $25$ and the least common multiple of $b$ and $c$ is $27$. Find $abc$. [b]p4.[/b] It takes Justin $15$ minutes to finish the Speed Test alone, and it takes James $30$ minutes to finish the Speed Test alone. If Justin works alone on the Speed Test for $3$ minutes, then how many minutes will it take Justin and James to finish the rest of the test working together? Assume each problem on the Speed Test takes the same amount of time. [b]p5.[/b] Angela has $128$ coins. $127$ of them have the same weight, but the one remaining coin is heavier than the others. Angela has a balance that she can use to compare the weight of two collections of coins against each other (that is, the balance will not tell Angela the weight of a collection of coins, but it will say which of two collections is heavier). What is the minumum number of weighings Angela must perform to guarantee she can determine which coin is heavier? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The volumes of the water containing in each of three big enough containers are integers. You are allowed only to relocate some times from one container to another the same volume of the water, that the destination already contains. Prove that you are able to discharge one of the containers.

There is a $2n \times 2n$ array (matrix) consisting of $0's$ and $1's$ and there are exactly $3n$ zeroes. Show that it is possible to remove all the zeroes by deleting some $n$ rows and some $n$ columns.

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

A club provides 30 snacks to 18 members, and each member orders 3 different snacks. It is known that every snack is ordered by at least one member, and that any two members order at most one same snack. Is it possible to find 12 snacks, such that the snacks ordered by any member is not completely in these 12 snacks?

A PUMaC grader is grading the submissions of forty students $s_1, s_2, ..., s_{40}$ for the individual finals round, which has three problems. After grading a problem of student $s_i$, the grader either: $\bullet$ grades another problem of the same student, or $\bullet$ grades the same problem of the student $s_{i-1}$ or $s_{i+1}$ (if $i > 1$ and $i < 40$, respectively). He grades each problem exactly once, starting with the first problem of $s_1$ and ending with the third problem of $s_{40}$. Let $N$ be the number of different orders the grader may grade the students’ problems in this way. Find the remainder when $N$ is divided by $100$.

[b]p1.[/b] In the picture below, the two parallel cuts divide the square into three pieces of equal area. The distance between the two parallel cuts is $d$. The square has length $s$. Find and prove a formula that expresses $s$ as a function of $d$. [img]https://cdn.artofproblemsolving.com/attachments/c/b/666074d28de50cdbf338a2c667f88feba6b20c.png[/img] [b]p2.[/b] Let $S$ be a subset of $\{1, 2, 3, . . . 10, 11\}$. We say that $S$ is lucky if no two elements of $S$ differ by $4$ or $7$. (a) Give an example of a lucky set with five elements. (b) Is it possible to find a lucky set with six elements? Explain why or why not.[/quote] [b]p3.[/b] Find polynomials $p(x)$ and $q(x)$ with real coefficients such that (a) $p(x) - q(x) = x^3 + x^2 - x - 1$ for all real $x$, (b) $p(x) > 0$ for all real $x$, (c) $q(x) > 0$ for all real $x$. [b]p4.[/b] A permutation on $\{1, 2, 3, …, n\}$ is a rearrangement of the symbols. For example $32154$ is a permutation on $\{1, 2, 3, 4, 5\}$. Given a permutation $a_1a_2a_3…a_n$, an inversion is a pair of $a_i$ and $a_j$ such that $a_i > a_j$ but $i < j$. For example, $32154$ has $4$ inversions. Suppose you are only allowed to exchange adjacent symbols. For any permutation, show that the minimum number of exchanges required to put all the symbols in their natural positions (that is, $123 …n$) is the number of inversions. [b]p5.[/b] We say a number $N$ is a nontrivial sum of consecutive positive integers if it can be written as the sum of $2$ or more consecutive positive integers. What is the set of numbers from $1000$ to $2000$ that are NOT nontrivial sums of consecutive positive integers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

An up-right path between two lattice points $P$ and $Q$ is a path from $P$ to $Q$ that takes steps of $1$ unit either up or to the right. A lattice point $(x, y)$ with $0 \le x, y \le 5$ is chosen uniformly at random. Compute the expected number of up-right paths from $(0, 0)$ to$ (5,5)$ not passing through $(x, y)$.

Each positive integer is coloured red or blue. A function $f$ from the set of positive integers to itself has the following two properties: (a) if $x\le y$, then $f(x)\le f(y)$; and (b) if $x,y$ and $z$ are (not necessarily distinct) positive integers of the same colour and $x+y=z$, then $f(x)+f(y)=f(z)$. Prove that there exists a positive number $a$ such that $f(x)\le ax$ for all positive integers $x$. [i](United Kingdom) Ben Elliott[/i]

We have a $m\times n$ table and $m\geq{4}$ and we call a $1\times 1$ square a room. When we put an alligator coin in a room, it menaces all the rooms in his column and his adjacent rooms in his row. What's the minimum number of alligator coins required, such that each room is menaced at least by one alligator coin? (Notice that all alligator coins are vertical.)

An $n \times n$ array of numbers is given. $n$ is odd and each number in the array is $1$ or $-1$. Prove that the number of rows and columns containing an odd number of $-1$s cannot total $n$.

For a finite non empty set of primes $P$, let $m(P)$ denote the largest possible number of consecutive positive integers, each of which is divisible by at least one member of $P$. (i) Show that $|P|\le m(P)$, with equality if and only if $\min(P)>|P|$. (ii) Show that $m(P)<(|P|+1)(2^{|P|}-1)$. (The number $|P|$ is the size of set $P$) [i]Dan Schwarz, Romania[/i]

All vertices of a regular 2016-gon are initially white. What is the least number of them that can be painted black so that:\\ (a) There is no right triangle\\ (b) There is no acute triangle\\ having all vertices in the vertices of the 2016-gon that are still white?

In a standard game of Rock–Paper–Scissors, two players repeatedly choose between rock, paper, and scissors, until they choose different options. Rock beats scissors, scissors beats paper, and paper beats rock. Nathan knows that on each turn, Richard randomly chooses paper with probability $33\%$, scissors with probability $44\%$, and rock with probability $23\%$. If Nathan plays optimally against Richard, the probability that Nathan wins is expressible as $a/b$ where $a$ and $b$ are coprime positive integers. Find $a + b$.

Aidan, Boyan, Calvin, Derek, Ephram, and Fanalex are all chamber musicians at a concert. In each performance, any combination of musicians of them can perform for all the others to watch. What is the minimum number of performances necessary to ensure that each musician watches every other musician play?