Let $$\begin{array}{cccc}{a_{1,1}} & {a_{1,2}} & {a_{1,3}} & {\dots} \\ {a_{2,1}} & {a_{2,2}} & {a_{2,3}} & {\cdots} \\ {a_{3,1}} & {a_{3,2}} & {a_{3,3}} & {\cdots} \\ {\vdots} & {\vdots} & {\vdots} & {\ddots}\end{array}$$ be a doubly infinite array of positive integers, and suppose each positive integer appears exactly eight times in the array. Prove that $a_{m, n}>m n$ for some pair of positive integers $(m, n) .$

Given an integer $n$ ,For a sequence of $X$ with the number of $n$ and $Y$ with the number of $100n$ , we call it a [b]spring [/b] . We have two following rules $\blacksquare$ Choose four adjacent character , if it is $YXXY$ , than it can be changed into $XYYX$ $\blacksquare $ Choose. four adjacent character , if it is $XYYX $ , than it can be changed into $YXXY$ If [b]spring [/b] $A$ can become $B$ using the rules , than we call they are [b][color=#3D85C6]similar [/color][/b] Thy to find the maximum of $C$ such that there exists $C$ distinct [b]springs[/b] and they are [b][color=#3D85C6]similar[/color][/b]

2004 computers make up a network using several cables. If for a subset $S$ in the set of all computers, there isn't a cable that connects two computers in $S$, $S$ is called independant. One lets the arbitrary independant set consists at most 50 computers, and uses the least number of cables. (1) Let $c(L)$ be the number of cables which connects the computer $L$. Prove that for two computers $A,B$, $c(A)=c(B)$ if there is a cable which connects $A$ and $B$, $|c(A)-c(B)|\leq 1$ otherwise. (2) Determine the number of used cables.

King Arthur one day had to fight the Dragon with Three Heads and Three Tails. His task became easier when he managed to find a magic sword that could, with a single blow, do one (and only one) of the following things: $\bullet$ cut off a head, $\bullet$ cut off two heads, $\bullet$ cut a tail, $\bullet$ cut off two tails. Furthermore, Fairy Morgana revealed to him the dragon's secret: $\bullet$ if a head is cut off, a new one grows, $\bullet$ if two heads are cut off nothing happens, $\bullet$ in place of a tail, two new tails are born, $\bullet$ if two tails are cut off a new head grow, $\bullet$ and the dragon dies if it loses its three heads and three tails. How many hits are needed to kill the dragon?

There are three colleges in a town. Each college has $n$ students. Any student of any college knows $n+1$ students of the other two colleges. Prove that it is possible to choose a student from each of the three colleges so that all three students would know each other.

Suppose that $n$ triangles are given in the plane such that any three of them have a common vertex, but no four of them do. Find the greatest possible $n$.

Two integers $0 < k < n$ and distinct real numbers $a_1, a_2, \dots ,a_n$ are given. Define the sets as the following, where all indices are modulo $n$. \begin{align*} A &= \{ 1 \le i \le n : a_i > a_{i-k}, a_{i-1}, a_{i+1}, a_{i+k} \text{ or } a_i < a_{i-k}, a_{i-1}, a_{i+1}, a_{i+k} \} \\ B &= \{ 1 \le i \le n : a_i > a_{i-k}, a_{i+k} \text{ and } a_i < a_{i-1}, a_{i+1} \} \\ C &= \{ 1 \le i \le n ; a_i > a_{i-1}, a_{i+1} \text{ and } a_i < a_{i-k}, a_{i+k} \} \end{align*} Prove that $\lvert A \rvert \ge \lvert B \rvert + \lvert C \rvert$.

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.$

[b]p1.[/b] The final Big $10$ standings for the $1996$ Women's Softball season were 1. Michigan 2. Minnesota З. Iowa 4. Indiana 5. Michigan State 6. Purdue 7. Northwestern 8. Ohio State 9. Penn State 10. Wisconsin (Illinois does not participate in Women's Softball.) When you compare the $1996$ final standings (above) to the final standings for the $1999$ season, you find that the following pairs of teams changed order relative to each other from $1996$ to $1999$ (there are no ties, and no other pairs changed places): (Iowa, Michigan State) (Indiana, Penn State) (Purdue, Wisconsin) (Iowa, Penn State) (Indiana, Wisconsin) (Northwestern, Penn State) (Indiana, Michigan State) (Michigan State, Penn State) (Northwestern, Wisconsin) (Indiana, Purdue) (Purdue, Northwestern) (Ohio State, Penn State) (Indiana, Northwestern) (Purdue, Penn State) (Ohio State, Penn State) (Indiana, Ohio State) Determine as much as you can about the final Big $10$ standings for the $1999$ Women's Softball season. If you cannot determine the standings, explain why you do not have enough information. You must justify your answer. [b]p2.[/b] a) Take as a given that any expression of the form $A \sin t + B \cos t$ ($A>0$) can be put in the form $C \sin (t + D)$, where $C>0$ and $-\pi /2 <D <\pi /2 $. Determine $C$ and $D$ in terms of $A$ and $B$. b) For the values of $C$ and $D$ found in part a), prove that $A \sin t + B \cos t = C \sin (t + D)$. c) Find the maximum value of $3 \sin t +2 \cos t$. [b]pЗ.[/b] А $6$-bу-$6$ checkerboard is completelу filled with $18$ dominoes (blocks of size $1$-bу-$2$). Prove that some horizontal or vertical line cuts the board in two parts but does not cut anу of the dominoes. [b]p4.[/b] a) The midpoints of the sides of a regular hexagon are the vertices of a new hexagon. What is the ratio of the area of the new hexagon to the area of the original hexagon? Justify your answer and simplify as much as possible. b) The midpoints of the sides of a regular $n$-gon ($n >2$) are the vertices of a new $n$-gon. What is the ratio of the area of the new $n$-gon to that of the old? Justify your answer and simplify as much as possible. [b]p5. [/b] You run a boarding house that has $90$ rooms. You have $100$ guests registered, but on any given night only $90$ of these guests actually stay in the boarding house. Each evening a different random set of $90$ guests will show up. You don't know which $90$ it will be, but they all arrive for dinner before you have to assign rooms for the night. You want to give out keys to your guests so that for any set of $90$ guests, you can assign each to a private room without any switching of keys. a) You could give every guest a key to every room. But this requires $9000$ keys. Find a way to hand out fewer than $9000$ keys so that each guest will have a key to a private room. b) What is the smallest number of keys necessary so that each guest will have a key to a private room? Describe how you would distribute these keys and assign the rooms. Prove that this number of keys is as small as possible. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

From an urn containing one ball marked with the number 1, two balls marked with the number 2, ..., $ n $ balls marked with the number $ n $ we draw two balls without replacement. We assume that each ball is equally likely to be drawn from the urn. Calculate the probability that both balls drawn have the same number.

Is it possible to arrange the numbers $1, 2, . . . , 60$ in that order, so that the sum of any two numbers between which there is one number, divisible by $2$, the sum of any two numbers between which there are two numbers divisible by $3$, . . . , the sum of any two numbers between which there is are there six numbers, divisible by $7$?

In a $N \times N$ array of numbers, all rows are different (two rows are said to be different even if they differ only in one entry). Prove that there is a column which can be deleted in such a way that the resulting rows will still be different. (A Andjans, Riga)

Raina the frog is playing a game in a circular pond with six lilypads around its perimeter numbered clockwise from $1$ to $6$ (so that pad $1$ is adjacent to pad $6$). She starts at pad $1$, and when she is on pad i, she may jump to one of its two adjacent pads, or any pad labeled with $j$ for which $j - i$ is even. How many jump sequences enable Raina to hop to each pad exactly once?

We have a deck of $n$ playing cards, some of which are turned up and some are turned down. In each step we are allowed to take a set of several cards from the top, turn the set and place it back on the top of the deck. What is the smallest number of steps necessary to make all cards in the deck turned down, independent of the initial configuration?

Humberto and Luciano use the break between classes to have fun with the following game: Humberto writes a list of distinct positive integers on a green sheet of paper and hands it to Luciano. Luciano then writes on a board all the possible sums, without repetitions, of one or more different numbers written on the green sheet. For example, if Humberto writes $1$, $3$ and $4$ on the green sheet, Luciano will write $1$, $3$, $4$, $5$, $7$ and $8$ on the board. (a) Let $n$ be a positive integer. Determine all positive integers $k$ such that Humberto can write a list of $n$ numbers on the green sheet in order to guarantee that Luciano will write exactly $k$ numbers on the board. (b) Luciano now decides to write a list of $m$ distinct positive integers on a yellow sheet of paper. Determine the smallest positive integer $m$ such that it is possible for Luciano to write this list so that, for any list that Humberto writes on the green sheet, with a maximum of $2023$ numbers, not all the numbers on the yellow sheet will be written on the board.

Jane writes down $2024$ natural numbers around the perimeter of a circle. She wants the $2024$ products of adjacent pairs of numbers to be exactly the set $\{ 1!, 2!, \ldots, 2024! \}.$ Can she accomplish this?

How many ways are there to color the $8$ regions of a three-set Venn Diagram with $3$ colors such that each color is used at least once? Two colorings are considered the same if one can be reached from the other by rotation and/or reflection.

Lamija and Faris are playing the following game. Cards, which are numerated from $1$ to $100$, are placed one next to other, starting from $1$ to $100$. Now Faris picks every $7$th card, and after that every card which contains number $7$. After that Lamija picks from remaining cards ones divisible with $5$, and after that cards which contain number $5$. Who will have more cards and how many ? How would game end, if Lamija started with "$5$ rule" and Faris continues with "$7$ rule"?

Determine all positive real numbers $a$ such that there exists a positive integer $n$ and partition $A_1$, $A_2$, ..., $A_n$ of infinity sets of the set of the integers satisfying the following condition: for every set $A_i$, the positive difference of any pair of elements in $A_i$ is at least $a^i$.

The numbers $1,2,\dots,2000$ are written on the board. Two players are playing a game with alternating moves. A move consists of erasing two number $a,b$ and writing $a^b$. After some time only one number is left. The first player wins, if the numbers last digit is $2$, $7$ or $8$. If not, the second player wins. Who has a winning strategy? [I]Proposed by V. Frank[/i]

Let $n$ be a natural number greater than 6. $X$ is a set such that $|X| = n$. $A_1, A_2, \ldots, A_m$ are distinct 5-element subsets of $X$. If $m > \frac{n(n - 1)(n - 2)(n - 3)(4n - 15)}{600}$, prove that there exists $A_{i_1}, A_{i_2}, \ldots, A_{i_6}$ $(1 \leq i_1 < i_2 < \cdots, i_6 \leq m)$, such that $\bigcup_{k = 1}^6 A_{i_k} = 6$.

On the blackboard were six figures: a circle, a triangle, a square, a trapezoid, a pentagon and a hexagon, painted in six colors: blue, white, red, yellow, green and brown. Each figure had only one color and all the figures were of different colors. The next day he wondered what color each figure was. Paul replied: “The circle was red, the triangle was blue, the square was white, the trapezoid was green, the pentagon was brown, and the hexagon was yellow. Sofía answered: “The circle was yellow, the triangle was green, the square was red, the trapezoid was blue, the pentagon was brown, and the hexagon was white.” Pablo was wrong three times and Sofia twice, and it is known that the pentagon was brown. Determine if it is possible to know with certainty what the color of each of the figures was.

There are 1000 gentlemen listed in the register of a city with numbers from 1 to 1000. Any 720 of them form a club. The mayor wants to impose a tax on each club, which is paid by all club members in equal shares (the tax is an arbitrary non-negative real number). At the same time, the total tax paid by a gentleman should not exceed his number in the register. What is the largest tax the mayor can collect? [i]Proposed by I. Bogdanov[/i]

Today was realized the National Olimpiad in Cuba, this is the 3rd problem of the second day: Prof that we can color the lattice points in the plane with two color so that every rectangle with vertices in the lattice points and edges parallels to the co-ordinate axis that have area 2^n is not monocromatic [/img]

Given the polygons $P$ and $Q$ as shown in the grid below, cut $P$ into two polygons $P_1$ and $P_2$ such that, when pasted together differently, they form $Q$. [asy] import graph; size(16cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-2.05,xmax=15.10,ymin=-1.87,ymax=9.74; pen cqcqcq=rgb(0.75,0.75,0.75), zzttqq=rgb(0.6,0.2,0); draw((7,5)--(12,5)--(12,2)--(7,2)--cycle,zzttqq); draw((2,2)--(2,5)--(3,6)--(6,6)--(6,3)--(5,2)--cycle,zzttqq); /*grid*/ pen gs=linewidth(0.7)+cqcqcq+linetype("2 2"); real gx=1,gy=1; for(real i=ceil(xmin/gx)*gx;i<=floor(xmax/gx)*gx;i+=gx) draw((i,ymin)--(i,ymax),gs); for(real i=ceil(ymin/gy)*gy;i<=floor(ymax/gy)*gy;i+=gy) draw((xmin,i)--(xmax,i),gs); draw((0,8)--(0,0)); draw((0,0)--(13,0)); draw((13,0)--(13,8)); draw((13,8)--(0,8)); draw((7,5)--(12,5),zzttqq); draw((12,5)--(12,2),zzttqq); draw((12,2)--(7,2),zzttqq); draw((7,2)--(7,5),zzttqq); draw((2,2)--(2,5),zzttqq); draw((2,5)--(3,6),zzttqq); draw((3,6)--(6,6),zzttqq); draw((6,6)--(6,3),zzttqq); draw((6,3)--(5,2),zzttqq); draw((5,2)--(2,2),zzttqq); dot((0,0),linewidth(1pt)+ds); dot((13,0),linewidth(1pt)+ds); dot((0,8),linewidth(1pt)+ds); dot((2,2),linewidth(1pt)+ds); dot((6,6),linewidth(1pt)+ds); dot((13,8),linewidth(1pt)+ds); dot((7,2),linewidth(1pt)+ds); dot((7,5),linewidth(1pt)+ds); dot((12,2),linewidth(1pt)+ds); dot((12,5),linewidth(1pt)+ds); label("$Q$",(8.42,2.56),NE*lsf,zzttqq); dot((5,2),linewidth(1pt)+ds); dot((6,3),linewidth(1pt)+ds); dot((2,5),linewidth(1pt)+ds); dot((3,6),linewidth(1pt)+ds); label("$P$",(4.65,2.74),NE*lsf,zzttqq); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy]