[u]Round 1 [/u] [b]p1.[/b] In the Hundred Acre Wood, all the animals are either knights or liars. Knights always tell the truth and liars always lie. One day in the Wood, Winnie-the-Pooh, a knight, decides to visit his friend Rabbit, also a noble knight. Upon arrival, Pooh finds his friend sitting at a round table with $5$ other guests. One-by-one, Pooh asks each person at the table how many of his two neighbors are knights. Surprisingly, he gets the same answer from everybody! "Oh bother!" proclaims Pooh. "I still don't have enough information to figure out how many knights are at this table." "But it's my birthday," adds one of the guests. "Yes, it's his birthday!" agrees his neighbor. Now Pooh can tell how many knights are at the table. Can you? [b]p2.[/b] Harry has an $8 \times 8$ board filled with the numbers $1$ and $-1$, and the sum of all $64$ numbers is $0$. A magical cut of this board is a way of cutting it into two pieces so that the sum of the numbers in each piece is also $0$. The pieces should not have any holes. Prove that Harry will always be able to find a magical cut of his board. (The picture shows an example of a proper cut.) [img]https://cdn.artofproblemsolving.com/attachments/4/b/98dec239cfc757e6f2996eef7876cbfd79d202.png[/img] [b]p3.[/b] Several girls participate in a tennis tournament in which each player plays each other player exactly once. At the end of the tournament, it turns out that each player has lost at least one of her games. Prove that it is possible to find three players $A$, $B$, and $C$ such that $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$. [b]p4.[/b] $120$ bands are participating in this year's Northwest Grunge Rock Festival, and they have $119$ fans in total. Each fan belongs to exactly one fan club. A fan club is called crowded if it has at least $15$ members. Every morning, all the members of one of the crowded fan clubs start arguing over who loves their favorite band the most. As a result of the fighting, each of them leaves the club to join another club, but no two of them join the same one. Is it true that, no matter how the clubs are originally arranged, all these arguments will eventually stop? [b]p5.[/b] In Infinite City, the streets form a grid of squares extending infinitely in all directions. Bonnie and Clyde have just robbed the Infinite City Bank, located at the busiest intersection downtown. Bonnie sets off heading north on her bike, and, $30$ seconds later, Clyde bikes after her in the same direction. They each bike at a constant speed of $1$ block per minute. In order to throw off any authorities, each of them must turn either left or right at every intersection. If they continue biking in this manner, will they ever be able to meet? [u]Round 2 [/u] [b]p6.[/b] In a certain herd of $33$ cows, each cow weighs a whole number of pounds. Farmer Dan notices that if he removes any one of the cows from the herd, it is possible to split the remaining $32$ cows into two groups of equal total weight, $16$ cows in each group. Show that all $33$ cows must have the same weight. [b]p7.[/b] Katniss is thinking of a positive integer less than $100$: call it $x$. Peeta is allowed to pick any two positive integers $N$ and $M$, both less than $100$, and Katniss will give him the greatest common divisor of $x+M$ and $N$ . Peeta can do this up to seven times, after which he must name Katniss' number $x$, or he will die. Can Peeta ensure his survival? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $O$ be the circumcenter of an acute triangle $ABC$. Let $D$ be the intersection of the bisector of the angle $A$ and $BC$. Suppose that $\angle ODC = 2 \angle DAO$. The circumcircle of $ABD$ meets the line segment $OA$ and the line $OD$ at $E (\neq A,O)$, and $F(\neq D)$, respectively. Let $X$ be the intersection of the line $DE$ and the line segment $AC$. Let $Y$ be the intersection of the bisector of the angle $BAF$ and the segment $BE$. Prove that $\frac{\overline{AY}}{\overline{BY}}= \frac{\overline{EX}}{\overline{EO}}$.

The equation $x^3-3x^2+1=0$ has three real solutions $x_1<x_2<x_3$. Show that for any positive integer $n$, the number $\left\lceil x_3^n\right\rceil$ is a multiple of $3$.

Proove that if for a positive integer $n$ , both $3n + 1$ and $10n + 1$ are perfect squares , then $29n + 11$ is not a prime number.

Consider a triangle with sides of length \( a \), \( b \), and \( c \) that satisfy the following conditions: \[ a + b = c + 3 \quad c^2 + 9 = 2ab \] Find the area of the triangle.

Calculate the following $$P=(4\sin^2{0} -3)(4\sin^2\frac{\pi}{2^{2005}} -3)(4\sin^2\frac{2\pi}{2^{2005}} -3)(4\sin^2\frac{3\pi}{2^{2005}} -3)...$$ $$...\,\,\,\,(4\sin^2\frac{(2^{2004}-1)\pi}{2^{2005}} -3)(4\sin^2\frac{\pi}{2} -3)$$

Let $ABC$ be an acute triangle such that $\angle BAC \neq 60^\circ$. Let $D,E$ be points such that $BD,CE$ are tangent to the circumcircle of $ABC$ and $BD=CE=BC$ ($A$ is on one side of line $BC$ and $D,E$ are on the other side). Let $F,G$ be intersections of line $DE$ and lines $AB,AC$. Let $M$ be intersection of $CF$ and $BD$, and $N$ be intersection of $CE$ and $BG$. Prove that $AM=AN$.

Find all pairs of positive integers $ (x,y)$ such that \[ x^y \equal{} y^{x \minus{} y}. \] [i]Albania[/i]

The columns of an $ n\times n$ board are labeled $ 1$ to $ n$. The numbers $ 1,2,...,n$ are arranged in the board so that the numbers in each row and column are pairwise different. We call a cell "good" if the number in it is greater than the label of its column. For which $ n$ is there an arrangement in which each row contains equally many good cells?

This problem is about pairs of consecutive whole numbers satisfying the property that one of the numbers is a perfect square and the other one is the double of a perfect square. (a) The smallest such pairs are $(0,1)$ and $(8,9)$, Indeed $0=2 \cdot 0^2$ and $1=1^2$; $8=2 \cdot 2^2$ and $9=3^2$. Show that there are infinitely many pairs of the form $(2a^2,b^2)$ where the smaller number is the double of a perfect square satisfying the given property. (b) Find a pair of integers satisfying the property that is not in the form given in the first part, that is, find a pair of integers such that the smaller one is a perfect square and the larger one is the double of a perfect square.

The transportation ministry has just decided to pay $80$ companies to repair $2400$ roads. These roads connects $100$ cities. Each road is between two cities and there is at most one road between any two cities. Each company must repair exactly $30$ roads, and each road is repaired by exactly one company. For a company to repair a road, it is necessary for the company to set up stations at the both cities on its endpoints. Prove that there are at least $8$ companies stationed at one city.

Let be a natural number $ n\ge 4, $ and a group $ G $ for which the applications $ \iota ,\eta : G\longrightarrow G $ defined by $ \iota (g) =g^n ,\eta (g) =g^{2n} $ are endomorphisms. Prove that $ G $ is commutative if $ \iota $ is injective or surjective. [i]Gh. Andrei[/i]

Find the maximum number of planes in the space, such there are $ 6$ points, that satisfy to the following conditions: [b]1.[/b]Each plane contains at least $ 4$ of them [b]2.[/b]No four points are collinear.

Let $ABCD$ be a cyclic quadrilateral wih both diagonals perpendicular to each other and intersecting at point $O$. Let $E,F,G,H$ be the orthogonal projections of $O$ on sides $AB,BC,CD,DA$ respectively. a. Prove that $\angle EFG + \angle GHE = 180^o$ b. Prove that $OE$ bisects angle $\angle FEH$ .

The numbers $1,2,\dots,9$ are randomly placed into the $9$ squares of a $3 \times 3$ grid. Each square gets one number, and each of the numbers is used once. What is the probability that the sum of the numbers in each row and each column is odd? $\textbf{(A) }1/21\qquad\textbf{(B) }1/14\qquad\textbf{(C) }5/63\qquad\textbf{(D) }2/21\qquad\textbf{(E) } 1/7$

Let $\mathcal{F}$ be a family of $4$-element subsets of a set of size $5^m$, where $m$ is a fixed positive integer. If the intersection of any two sets in $\mathcal{F}$ does not have size exactly $2$, find the maximal value of $|\mathcal{F}|$.

The set $N$ is partitioned into three subsets $A_1,A_2,A_3$. Prove that at least one of them has the following property: There exists a positive number $m$ such that for any $k$ one can find numbers $a_1 < a_2 < ... < a_k$ in that subset satisfying $a_{j+1} -a_j \le m$ for $j = 1,...,k -1$.

A certain state issues license plates consisting of six digits (from 0 to 9). The state requires that any two license plates differ in at least two places. (For instance, the numbers 027592 and 020592 cannot both be used.) Determine, with proof, the maximum number of distinct license plates that the state can use.

Show that for any $n \not \equiv 0 \pmod{10}$ there exists a multiple of $n$ not containing the digit $0$ in its decimal expansion.

\[\int_1^\infty \frac{\lfloor x \rfloor}{9x^3-x}\mathrm dx\] [i]Proposed by Robert Trosten and Connor Gordon[/i]

In cyclic quadrilateral $ABCD$ with circumcenter $O$ and circumradius $R$, define $X=\overline{AB}\cap\overline{CD}$, $Y=\overline{AC}\cap \overline{BD}$, and $Z=\overline{AD}\cap\overline{BC}$. Prove that \[OX^2+OY^2+OZ^2\ge 2R^2+2[ABCD].\] [i]Rohan Bodke[/i]

Sam colors each tile in a 4 by 4 grid white or black. A coloring is called [i]rotationally symmetric[/i] if the grid can be rotated 90, 180, or 270 degrees to achieve the same pattern. Two colorings are called [i]rotationally distinct[/i] if neither can be rotated to match the other. How many rotationally distinct ways are there for Sam to color the grid such that the colorings are [i]not[/i] rotationally symmetric? [i]Proposed by Gabriel Wu[/i]

Consider a rectangle $R$ partitioned into $2016$ smaller rectangles such that the sides of each smaller rectangle is parallel to one of the sides of the original rectangle. Call the corners of each rectangle a vertex. For any segment joining two vertices, call it basic if no other vertex lie on it. (The segments must be part of the partitioning.) Find the maximum/minimum possible number of basic segments over all possible partitions of $R$.

Let all vertices of a convex quadrilateral $ABCD$ lie on the circumference of a circle with center $O$. Let $F$ be the second intersection point of the circumcircles of the triangles $ABO$ and $CDO$. Prove that the circle passing through the points $A, F$ and $D$ also passes through the intersection point of the segments $AC$ and $BD$. (A Zaslavskiy)

Two circles intersect at $M$ and $N$. A line through $M$ meets the circles at $A$ and $B$, with $M$ between $A$ and $B$. Let $C$ and $D$ be the midpoints of the arcs $AN$ and $BN$ not containing $M$, respectively, and $K$ and $L$ be the midpoints of $AB$ and $CD$, respectively. Prove that $CL=KL$.