[b]p1. [/b]The longest diagonal of a regular hexagon is 12 inches long. What is the area of the hexagon, in square inches? [b]p2.[/b] When Al and Bob play a game, either Al wins, Bob wins, or they tie. The probability that Al does not win is $\frac23$ , and the probability that Bob does not win is $\frac34$ . What is the probability that they tie? [b]p3.[/b] Find the sum of the $a + b$ values over all pairs of integers $(a, b)$ such that $1 \le a < b \le 10$. That is, compute the sum $$(1 + 2) + (1 + 3) + (1 + 4) + ...+ (2 + 3) + (2 + 4) + ...+ (9 + 10).$$ [b]p4.[/b] A $3 \times 11$ cm rectangular box has one vertex at the origin, and the other vertices are above the $x$-axis. Its sides lie on the lines $y = x$ and $y = -x$. What is the $y$-coordinate of the highest point on the box, in centimeters? [b]p5.[/b] Six blocks are stacked on top of each other to create a pyramid, as shown below. Carl removes blocks one at a time from the pyramid, until all the blocks have been removed. He never removes a block until all the blocks that rest on top of it have been removed. In how many different orders can Carl remove the blocks? [img]https://cdn.artofproblemsolving.com/attachments/b/e/9694d92eeb70b4066b1717fedfbfc601631ced.png[/img] [b]p6.[/b] Suppose that a right triangle has sides of lengths $\sqrt{a + b\sqrt{3}}$,$\sqrt{3 + 2\sqrt{3}}$, and $\sqrt{4 + 5\sqrt{3}}$, where $a, b$ are positive integers. Find all possible ordered pairs $(a, b)$. [b]p7.[/b] Farmer Chong Gu glues together $4$ equilateral triangles of side length $ 1$ such that their edges coincide. He then drives in a stake at each vertex of the original triangles and puts a rubber band around all the stakes. Find the minimum possible length of the rubber band. [b]p8.[/b] Compute the number of ordered pairs $(a, b)$ of positive integers less than or equal to $100$, such that a $b -1$ is a multiple of $4$. [b]p9.[/b] In triangle $ABC$, $\angle C = 90^o$. Point $P$ lies on segment $BC$ and is not $B$ or $C$. Point $I$ lies on segment $AP$. If $\angle BIP = \angle PBI = \angle CAB = m^o$ for some positive integer $m$, find the sum of all possible values of $m$. [b]p10.[/b] Bob has $2$ identical red coins and $2$ identical blue coins, as well as $4$ distinguishable buckets. He places some, but not necessarily all, of the coins into the buckets such that no bucket contains two coins of the same color, and at least one bucket is not empty. In how many ways can he do this? [b]p11.[/b] Albert takes a $4 \times 4$ checkerboard and paints all the squares white. Afterward, he wants to paint some of the square black, such that each square shares an edge with an odd number of black squares. Help him out by drawing one possible configuration in which this holds. (Note: the answer sheet contains a $4 \times 4$ grid.) [b]p12.[/b] Let $S$ be the set of points $(x, y)$ with $0 \le x \le 5$, $0 \le y \le 5$ where $x$ and $y$ are integers. Let $T$ be the set of all points in the plane that are the midpoints of two distinct points in $S$. Let $U$ be the set of all points in the plane that are the midpoints of two distinct points in $T$. How many distinct points are in $U$? (Note: The points in $T$ and $U$ do not necessarily have integer coordinates.) [b]p13.[/b] In how many ways can one express $6036$ as the sum of at least two (not necessarily positive) consecutive integers? [b]p14.[/b] Let $a, b, c, d, e, f$ be integers (not necessarily distinct) between $-100$ and $100$, inclusive, such that $a + b + c + d + e + f = 100$. Let $M$ and $m$ be the maximum and minimum possible values, respectively, of $$abc + bcd + cde + def + ef a + f ab + ace + bdf.$$ Find $\frac{M}{m}$. [b]p15.[/b] In quadrilateral $ABCD$, diagonal $AC$ bisects diagonal $BD$. Given that $AB = 20$, $BC = 15$, $CD = 13$, $AC = 25$, find $DA$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How many different integer solutions to the inequality $|x| + |y| < 100$ are there?

Three numbers were written with a chalk on the blackboard. The following operation was repeated several times: One of the numbers was cleared and the sum of two other numbers, decreased by $1$, was written instead of it. The final set of numbers is $\{17, 1967, 1983\}$.Is it possible to admit that the initial numbers were a) $\{2, 2, 2\}$? b) $\{3, 3, 3\}$?

Let $n$ be an positive integer and $\sigma = (a_1, \dots, a_n)$ a permutation of $\{1, \dots, n\}$. The [i]cadence number[/i] of $\sigma$ is the number of maximal decrescent blocks. For example, if $n = 6$ and $\sigma = (4, 2, 1, 5, 6, 3)$, then the cadence number of $\sigma$ is $3$, because $\sigma$ has $3$ maximal decrescent blocks: $(4, 2, 1)$, $(5)$ and $(6, 3)$. Note that $(4, 2)$ and $(2, 1)$ are decrescent, but not maximal, because they are already contained in $(4, 2, 1)$. Compute the sum of the cadence number of every permutation of $\{1, \dots, n\}$.

A $9 \times 10$ board is divided into $90$ unit cells. There are certain rules for moving a non-standard chess queen from one square to another: [list] [*]The queen can only move along the column or row it is in each step. [*]For any natural number $n$, if $x$ cells move made in $(2n-1)$th step, then $9-x$ cells move will be done in $(2n)$th step. The last cell it stops at during these steps is considered the visited cell. [/list] Is it possible for the queen to move from any square on the board and return to the square where it started after visiting all the squares of the board exactly once? Note: At each step, the queen chooses the right, left, up, and down direction within the above condition can choose.

Let $m$ be a positive integer. Consider a $4m\times 4m$ array of square unit cells. Two different cells are [i]related[/i] to each other if they are in either the same row or in the same column. No cell is related to itself. Some cells are colored blue, such that every cell is related to at least two blue cells. Determine the minimum number of blue cells.

[b]p1.[/b] Solve the equation $$\frac{\sqrt{x^2 - 2x + 1}}{x^2 - 1}+\frac{x^2 - 1}{\sqrt{x^2 - 2x + 1}}=\frac52.$$ [b]p2.[/b] Solve the inequality: $\frac{1 - 2\sqrt{1-x^2}}{x} \le 1$. [b]p3.[/b] Let $ABCD$ be a convex quadrilateral such that the length of the segment connecting midpoints of the two opposite sides $AB$ and $CD$ equals $\frac{|AD| + |BC|}{2}$. Prove that $AD$ is parallel to $BC$. [b]p4.[/b] Solve the equation: $\frac{1}{\cos x}+\frac{1}{\sin x}= 2\sqrt2$. [b]p5.[/b] Long, long ago, far, far away there existed the Old Republic Galaxy with a large number of stars. It was known that for any four stars in the galaxy there existed a point in space such that the distance from that point to any of these four stars was less than or equal to $R$. Master Yoda asked Luke Skywalker the following question: Must there exist a point $P$ in the galaxy such that all stars in the galaxy are within a distance $R$ of the point $P$? Give a justified argument that will help Like answer Master Yoda’s question. [b]p6.[/b] The Old Republic contained an odd number of inhabited planets. Some pairs of planets were connected to each other by space flights of the Trade Federation, and some pairs of planets were not connected. Every inhabited planet had at least one connections to some other inhabited planet. Luke knew that if two planets had a common connection (they are connected to the same planet), then they have a different number of total connections. Master Yoda asked Luke if there must exist a planet that has exactly two connections. Give a justified argument that will help Luke answer Master Yoda’s question. PS. You should use hide for answers.

All the grids of a $m\times n$ chess board ($m,n\geq 3$), are colored either with red or with blue. Two adjacent grids (having a common side) are called a "good couple" if they have different colors. Suppose there are $S$ "good couples". Explain how to determine whether $S$ is odd or even. Is it prescribed by some specific color grids? Justify your answers.

A tree $T$ is given. Starting with the complete graph on $n$ vertices, subgraphs isomorphic to $T$ are erased at random until no such subgraph remains. For what trees does there exist a positive constant $c$ such that the expected number of edges remaining is at least $cn^2$ for all positive integers $n$? [i]David Yang.[/i]

In an alphabet of $n$ letters, is $syllable$ is any ordered pair of two (not necessarily distinct) letters. Some syllables are considered $indecent$. A $word$ is any sequence, finite or infinite, of letters, that does not contain indecent syllables. Find the least possible number of indecent syllables for which infinite words do not exist.

Does there exist a convex polyhedron having equal number of edges and diagonals? [i](A diagonal of a polyhedron is a segment through two vertices not lying on the same face) [/i]

Robot "Mag-o-matic" manipulates $101$ glasses, displaced in a row whose positions are numbered from $1$ to $101$. In each glass you can find a ball or not. Mag-o-matic only accepts elementary instructions of the form $(a;b,c)$, which it interprets as "consider the glass in position $a$: if it contains a ball, then switch the glasses in positions $b$ and $c$ (together with their own content), otherwise move on to the following instruction" (it means that $a,\,b,\,c$ are integers between $1$ and $101$, with $b$ and $c$ different from each other but not necessarily different from $a$). A $\emph{programme}$ is a finite sequence of elementary instructions, assigned at the beginning, that Mag-o-matic does one by one. A subset $S\subseteq \{0,\,1,\,2,\dots,\,101\}$ is said to be $\emph{identifiable}$ if there exists a programme which, starting from any initial configuration, produces a final configuration in which the glass in position $1$ contains a ball if and only if the number of glasses containing a ball is an element of $S$. (a) Prove that the subset $S$ of the odd numbers is identifiable. (b) Determine all subsets $S$ that are identifiable.

Let $S_{n}$ be the number of permutations $(a_{1}, a_{2}, ... , a_{n})$ of $(1, 2, ... , n)$ such that $1 \leq |a_{k}-k | \leq 2$ for all $k$. Show that $\frac{7}{4}S_{n-1}< S_{n}< 2 S_{n-1}$ for $n > 6.$

Determine for which positive integers $ k$ the set \[ X \equal{} \{1990, 1990 \plus{} 1, 1990 \plus{} 2, \ldots, 1990 \plus{} k\}\] can be partitioned into two disjoint subsets $ A$ and $ B$ such that the sum of the elements of $ A$ is equal to the sum of the elements of $ B.$

$n$ consecutive positive integers are put down in a row (not necessarily in order) so that the sum of any three successive integers in the row is divisible by the leftmost number in the triple. What is the largest possible value of $n$ if the last number in the row is odd? (A Shapovalov)

We are given $n$ distinct points in the plane. Consider the number $\tau(n)$ of segments of length 1 joining pairs of these points. Show that $\tau(n)\leq \frac{n^{2}}3$.

In one galaxy, there exist more than one million stars. Let $M$ be the set of the distances between any $2$ of them. Prove that, in every moment, $M$ has at least $79$ members. (Suppose each star as a point.)

A family of sets $ A_1, A_2, \ldots ,A_n$ has the following properties: [b](i)[/b] Each $ A_i$ contains 30 elements. [b](ii)[/b] $ A_i \cap A_j$ contains exactly one element for all $ i, j, 1 \leq i < j \leq n.$ Determine the largest possible $ n$ if the intersection of all these sets is empty.

An ancient noble family has $n$ members, each holding a different number of posts . As every year in December, they gather at a very specific place for a Council of War to be held, where also k, from the point of view of the high nobility, unimportant spammers speak up, which, due to their irrelevance, should and cannot be further differentiated. The Council is held as follows: those present speak one after the other, each one carefully put forward his request once. In addition, for reasons of respect, a nobleman never speaks right after a nobleman who holds more posts, while the common people disregarde such rules. Find the number of possible sequences of the Council of war.

Three couples sit for a photograph in $2$ rows of three people each such that no couple is sitting in the same row next to each other or in the same column one behind the other. How many such arrangements are possible?

An infinite grid with two rows is divided into unit squares. One of the cells in the second row is colored red and all other cells in the grid are white. Initially, we are in the red cell. In one move, we can move from one cell to an adjacent cell (sharing a side). Find the number of sequences of \( n \) moves such that no cell is visited more than once. (In particular, it is not allowed to return to the red cell after several moves.)

Let $n$ be a integer $1<n<2010$, where we have a polygon with $2010$ sides and $n$ coins, we have to paint the vertices of this polygon with $n$ colors and we've to put the $n$ coins in $n$ vertices of the polygon. In each second the coins will go to the neighbour vertex, going in the clockwise. Determine the values of $n$ such that is possible paint and choose the initial position of the coins where in each second the $n$ coins are in vertices of distinct colors

Let $m,n\ge2$ be positive integers. On an $m\times n$ chessboard, some unit squares are occupied by rooks such that each rook attacked by odd number of other rooks. Determine the maximum number of rooks that can be placed on the chessboard.

[color=darkred]Let $n$ and $m$ be two natural numbers, $m\ge n\ge 2$ . Find the number of injective functions \[f\colon\{1,2,\ldots,n\}\to\{1,2,\ldots,m\}\] such that there exists a unique number $i\in\{1,2,\ldots,n-1\}$ for which $f(i)>f(i+1)\, .$[/color]

Coins of diameter $1$ have been placed on a square of side $11$, without overlapping or protruding from the square. Can there be $126$ coins? and $127$? and $128$?