In the $100 \times 100$ table in every cell there is natural number. All numbers in same row or column are different. Can be that for every square sum of numbers, that are in angle cells, is square number ?

There are $n$ boys $a_1, a_2, \ldots, a_n$ and $n$ girls $b_1, b_2, \ldots, b_n $. Some pairs of them are connected. Any two boys or two girls are not connected, and $a_i$ and $b_i$ are not connected for all $i \in \{ 1,2,\ldots,n\}$. Now all boys and girls are divided into several groups satisfying two conditions: (i) Every groups contains an equal number of boys and girls. (ii) There is no connected pair in the same group. Assume that the number of connected pairs is $m$. Show that we can make the number of groups not larger than $\max\left \{2, \dfrac{2m}{n} +1\right \}$.

An airline offer $2000$ two-way routes connecting $64$ towns in a country. Show that it is possible to reach any town from any other town using the offered routes.

Prove that a square can be divided into any number greater than 5 squares, but cannot be divided into 5 squares.

The teacher reported to Peter an odd integer $m \le 2013$ and gave the guy a homework. Petrick should star the cells in the $2013 \times 2013$ table so to make the condition true: if there is an asterisk in some cell in the table, then or in row or column containing this cell should be no more than $m$ stars (including this one). Thus in each cell of the table the guy can put at most one star. The teacher promised Peter that his assessment would be just the number of stars that the guy will be able to place. What is the greatest number will the stars be able to place in the table Petrick?

You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.

Give a square of side $1$. Show that for each finite set of points of the sides of the square you can find a vertex of the square with the following property: the arithmetic mean of the squares of the distances from this vertex to the points of the set is greater than or equal to $3/4$.

A table tennis tournament has $101$ contestants, where each pair of contestants will play each other exactly once. In each match, the player who gets $11$ points first is the winner, and the other the loser. At the end of the tournament, it turns out that there exist matches with scores $11$ to $0$ and $11$ to $10$. Show that there exists 3 contestants $A,B,C$ such that the score of the losers in the matches between $A,B$ and $A,C$ are equal, but different from the score of the loser in the match between $B,C$.

[b]p1.[/b] Al usually arrives at the train station on the commuter train at $6:00$, where his wife Jane meets him and drives him home. Today Al caught the early train and arrived at $5:00$. Rather than waiting for Jane, he decided to jog along the route he knew Jane would take and hail her when he saw her. As a result, Al and Jane arrived home $12$ minutes earlier than usual. If Al was jogging at a constant speed of $5$ miles per hour, and Jane always drives at the constant speed that would put her at the station at $6:00$, what was her speed, in miles per hour? [b]p2.[/b] In the figure, points $M$ and $N$ are the respective midpoints of the sides $AB$ and $CD$ of quadrilateral $ABCD$. Diagonal $AC$ meets segment $MN$ at $P$, which is the midpoint of $MN$, and $AP$ is twice as long as $PC$. The area of triangle $ABC$ is $6$ square feet. (a) Find, with proof, the area of triangle $AMP$. (b) Find, with proof, the area of triangle $CNP$. (c) Find, with proof, the area of quadrilateral $ABCD$. [img]https://cdn.artofproblemsolving.com/attachments/a/c/4bdcd8390bae26bc90fc7eae398ace06900a67.png[/img] [b]p3.[/b] (a) Show that there is a triangle whose angles have measure $\tan^{-1}1$, $\tan^{-1}2$ and $\tan^{-1}3$. (b) Find all values of $k$ for which there is a triangle whose angles have measure $\tan^{-1}\left(\frac12 \right)$, $\tan^{-1}\left(\frac12 +k\right)$, and $\tan^{-1}\left(\frac12 +2k\right)$ [b]p4.[/b] (a) Find $19$ consecutive integers whose sum is as close to $1000$ as possible. (b) Find the longest possible sequence of consecutive odd integers whose sum is exactly $1000$, and prove that your sequence is the longest. [b]p5.[/b] Let $AB$ and $CD$ be chords of a circle which meet at a point $X$ inside the circle. (a) Suppose that $\frac{AX}{BX}=\frac{CX}{DX}$. Prove that $|AB|=|CD|$. (b) Suppose that $\frac{AX}{BX}>\frac{CX}{DX}>1$. Prove that $|AB|>|CD|$. ($|PQ|$ means the length of the segment $PQ$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Forty-nine students solve a set of 3 problems. The score for each problem is a whole number of points from 0 to 7. Prove that there exist two students $ A$ and $ B$ such that, for each problem, $ A$ will score at least as many points as $ B.$

Given is a simple connected graph with $2n$ vertices. Prove that its vertices can be colored with two colors so that if there are $k$ edges connecting vertices with different colors and $m$ edges connecting vertices with the same color, then $k-m \geq n$.

A circle is drawn on the board, and $2n$ points are marked on it, dividing it into $2n$ equal arcs. Petya and Vasya are playing the following game. Petya chooses a positive integer $d \leqslant n$ and announces this number to Vasya. To win the game, Vasya needs to color all marked points using $n$ colors, such that each color is assigned to exactly two points, and for each pair of same-colored points, one of the arcs between them contains exactly $(d - 1)$ marked points. Find all $n$ for which Petya will be able to prevent Vasya from winning.

In a square of area $1$ there are situated $2024$ polygons whose total area is greater than $2023$. Prove that they have a point in common.

In a certain country there are $2023$ islands and $2022$ bridges, such that every bridge connects two different islands and any two islands have at most one bridge in common, and from any island, using bridges one can get to any other island. If in any three islands there is an island with bridges connected to each of the other two islands, call these three islands an "island group". We know that any two "island group"s have at least $1$ common island. What is the minimum number of islands with only $1$ bridge connected to it?

Given $19$ red boxes and $200$ blue boxes filled with balls. None of which is empty. Suppose that every red boxes have a maximum of $200$ balls and every blue boxes have a maximum of $19$ balls. Suppose that the sum of all balls in the red boxes is less than the sum of all the balls in the blue boxes. Prove that there exists a subset of the red boxes and a subset of the blue boxes such that their sum is the same.

Consider a game played on the integers in the closed interval $[1, n]$. The game begins with some tokens placed in $[1, n]$. At each turn, tokens are added or removed from$ [1, n]$ using the following rule: For each integer $k \in [1, n]$, if exactly one of $k - 1$ and $k + 1$ has a token, place a token at $k$ for the next turn, otherwise leave k blank for the next turn. We call a position [i]static [/i] if no changes to the interval occur after one turn. For instance, the trivial position with no tokens is static because no tokens are added or removed after a turn (because there are no tokens). Find all non-trivial static positions.

For every nonempty subset $X$ of $M=\{1,2,\ldots,2000\}$, $a_X$ denotes the sum of the minimum and maximum element of $X$. Compute the arithmetic mean of the numbers $a_X$ when $X$ goes over all nonempty subsets $X$ of $M$.

Given $n$ integers $a_1 = 1, a_2,..., a_n$ such that $a_i \le a_{i+1} \le 2a_i$ ($i = 1, 2, 3,..., n - 1$) and whose sum is even. Find whether it is possible to divide them into two groups so that the sum of numbers in one group is equal to the sum of numbers in the other group.

There are $27$ cardboard and $27$ plastic boxes. There are balls of certain colors inside the boxes. It is known that any two boxes of the same kind do not have a ball with the same color. Boxes of different kind have at least one ball of the same color. At each step we select two boxes that have a ball of same color and switch this common color into any other color we wish. Find the smallest number $n$ of moves required.

[b]p1.[/b] A rectangular pool has diagonal $17$ units and area $120$ units$^2$. Joey and Rachel start on opposite sides of the pool when Rachel starts chasing Joey. If Rachel runs $5$ units/sec faster than Joey, how long does it take for her to catch him? [b]p2. [/b] Alice plays a game with her standard deck of $52$ cards. She gives all of the cards number values where Aces are $1$’s, royal cards are $10$’s and all other cards are assigned their face value. Every turn she flips over the top card from her deck and creates a new pile. If the flipped card has value $v$, she places $12 - v$ cards on top of the flipped card. For example: if she flips the $3$ of diamonds then she places $9$ cards on top. Alice continues creating piles until she can no longer create a new pile. If the number of leftover cards is $4$ and there are $5$ piles, what is the sum of the flipped over cards? [b]p3.[/b] There are $5$ people standing at $(0, 0)$, $(3, 0)$, $(0, 3)$, $(-3, 0)$, and $(-3, 0)$ on a coordinate grid at a time $t = 0$ seconds. Each second, every person on the grid moves exactly $1$ unit up, down, left, or right. The person at the origin is infected with covid-$19$, and if someone who is not infected is at the same lattice point as a person who is infected, at any point in time, they will be infected from that point in time onwards. (Note that this means that if two people run into each other at a non-lattice point, such as $(0, 1.5)$, they will not infect each other.) What is the maximum possible number of infected people after $t = 7$ seconds? [b]p4.[/b] Kara gives Kaylie a ring with a circular diamond inscribed in a gold hexagon. The diameter of the diamond is $2$ mm. If diamonds cost $\$100/ mm ^2$ and gold costs $\$50 /mm ^2$ , what is the cost of the ring? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A cube with edge length $3$ is divided into $27$ unit cubes. The numbers $1, 2,\ldots ,27$ are distributed arbitrarily over the unit cubes, with one number in each cube. We form the $27$ possible row sums (there are nine such sums of three integers for each of the three directions parallel with the edges of the cube). At most how many of the $27$ row sums can be odd?

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)

We say $m \circ n$ for natural m,n $\Longleftrightarrow$ nth number of binary representation of m is 1 or mth number of binary representation of n is 1. and we say $m \bullet n$ if and only if $m,n$ doesn't have the relation $\circ$ We say $A \subset \mathbb{N}$ is golden $\Longleftrightarrow$ $\forall U,V \subset A$ that are finite and arenot empty and $U \cap V = \emptyset$,There exist $z \in A$ that $\forall x \in U,y \in V$ we have $z \circ x ,z \bullet y$ Suppose $\mathbb{P}$ is set of prime numbers.Prove if $\mathbb{P}=P_1 \cup ... \cup P_k$ and $P_i \cap P_j = \emptyset$ then one of $P_1,...,P_k$ is golden.

[b]p1.[/b] Find the smallest positive integer $N$ such that $2N -1$ and $2N +1$ are both composite. [b]p2.[/b] Compute the number of ordered pairs of integers $(a, b)$ with $1 \le a, b \le 5$ such that $ab - a - b$ is prime. [b]p3.[/b] Given a semicircle $\Omega$ with diameter $AB$, point $C$ is chosen on $\Omega$ such that $\angle CAB = 60^o$. Point $D$ lies on ray $BA$ such that $DC$ is tangent to $\Omega$. Find $\left(\frac{BD}{BC} \right)^2$. [b]p4.[/b] Let the roots of $x^2 + 7x + 11$ be $r$ and $s$. If $f(x)$ is the monic polynomial with roots $rs + r + s$ and $r^2 + s^2$, what is $f(3)$? [b]p5.[/b] Regular hexagon $ABCDEF$ has side length $3$. Circle $\omega$ is drawn with $AC$ as its diameter. $BC$ is extended to intersect $\omega$ at point $G$. If the area of triangle $BEG$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a, b, c$ with $b$ squarefree and $gcd(a, c) = 1$, find $a + b + c$. [b]p6.[/b] Suppose that $x$ and $y$ are positive real numbers such that $\log_2 x = \log_x y = \log_y 256$. Find $xy$. [b]p7.[/b] Call a positive three digit integer $\overline{ABC}$ fancy if $\overline{ABC} = (\overline{AB})^2 - 11 \cdot \overline{C}$. Find the sum of all fancy integers. [b]p8.[/b] Let $\vartriangle ABC$ be an equilateral triangle. Isosceles triangles $\vartriangle DBC$, $\vartriangle ECA$, and $\vartriangle FAB$, not overlapping $\vartriangle ABC$, are constructed such that each has area seven times the area of $\vartriangle ABC$. Compute the ratio of the area of $\vartriangle DEF$ to the area of $\vartriangle ABC$. [b]p9.[/b] Consider the sequence of polynomials an(x) with $a_0(x) = 0$, $a_1(x) = 1$, and $a_n(x) = a_{n-1}(x) + xa_{n-2}(x)$ for all $n \ge 2$. Suppose that $p_k = a_k(-1) \cdot a_k(1)$ for all nonnegative integers $k$. Find the number of positive integers $k$ between $10$ and $50$, inclusive, such that $p_{k-2} + p_{k-1} = p_{k+1} - p_{k+2}$. [b]p10.[/b] In triangle $ABC$, point $D$ and $E$ are on line segments $BC$ and $AC$, respectively, such that $AD$ and $BE$ intersect at $H$. Suppose that $AC = 12$, $BC = 30$, and $EC = 6$. Triangle BEC has area 45 and triangle $ADC$ has area $72$, and lines CH and AB meet at F. If $BF^2$ can be expressed as $\frac{a-b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ with c squarefree and $gcd(a, b, d) = 1$, then find $a + b + c + d$. [b]p11.[/b] Find the minimum possible integer $y$ such that $y > 100$ and there exists a positive integer x such that $x^2 + 18x + y$ is a perfect fourth power. [b]p12.[/b] Let $ABCD$ be a quadrilateral such that $AB = 2$, $CD = 4$, $BC = AD$, and $\angle ADC + \angle BCD = 120^o$. If the sum of the maximum and minimum possible areas of quadrilateral $ABCD$ can be expressed as $a\sqrt{b}$ for positive integers $a$, $b$ with $b$ squarefree, then find $a + b$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$n$ is a positive integer. An equilateral triangle of side length $3n$ is split into $9n^2$ unit equilateral triangles, each colored one of red, yellow, blue, such that each color appears $3n^2$ times. We call a trapezoid formed by three unit equilateral triangles as a "standard trapezoid". If a "standard trapezoid" contains all three colors, we call it a "colorful trapezoid". Find the maximum possible number of "colorful trapezoids".