Consider a chessboard $6 \times 6$, made up of $36$ single squares. We want to place $6$ chess rooks on this board, one rook on each square, so that there are no two rooks on the same row, nor two rooks on the same column. Note that, once the rooks have been placed in this way, we have that, for every square where a rook has not been placed, there is a rook in the same row as it and a rook in the same column as it. We will say that such rooks are in line with this square. For each of those $30$ houses without rooks, color it green if the two rooks aligned with that same house are the same distance from it, and color it yellow otherwise. For example, when we place the $6$ rooks ($T$) as below, we have: (a) Is it possible to place the rooks so that there are $30$ green squares? (b) Is it possible to place the rooks so that there are $30$ yellow squares? (c) Is it possible to place the rooks so that there are $15$ green and $15$ yellow squares?

Given the functions $f(x)=xe^{x}+2x\int_0^2 |g(t)|dt-1,\ g(x)=x^2-x\int_0^1 f(t)dt$, evaluate $\int_0^2 |g(t)|dt.$

A circle of radius 2 is centered at $ O$. Square $ OABC$ has side length 1. Sides $ \overline{AB}$ and $ \overline{CB}$ are extended past $ b$ to meet the circle at $ D$ and $ E$, respectively. What is the area of the shaded region in the figure, which is bounded by $ \overline{BD}$, $ \overline{BE}$, and the minor arc connecting $ D$ and $ E$? [asy] defaultpen(linewidth(0.8)); pair O=origin, A=(1,0), C=(0,1), B=(1,1), D=(1, sqrt(3)), E=(sqrt(3), 1), point=B; fill(Arc(O, 2, 0, 90)--O--cycle, mediumgray); clip(B--Arc(O, 2, 30, 60)--cycle); draw(Circle(origin, 2)); draw((-2,0)--(2,0)^^(0,-2)--(0,2)); draw(A--D^^C--E); label("$A$", A, dir(point--A)); label("$C$", C, dir(point--C)); label("$O$", O, dir(point--O)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$B$", B, SW);[/asy] $ \textbf{(A) } \frac {\pi}3 \plus{} 1 \minus{} \sqrt {3} \qquad \textbf{(B) } \frac {\pi}2\left( 2 \minus{} \sqrt {3}\right) \qquad \textbf{(C) } \pi\left(2 \minus{} \sqrt {3}\right) \qquad \textbf{(D) } \frac {\pi}{6} \plus{} \frac {\sqrt {3} \minus{} 1}{2} \\ \qquad \indent \textbf{(E) } \frac {\pi}{3} \minus{} 1 \plus{} \sqrt {3}$

Elbert and Yaiza each draw $10$ cards from a $20$-card deck with cards numbered $1,2,3,\dots,20$. Then, starting with the player with the card numbered $1$, the players take turns placing down the lowest-numbered card from their hand that is greater than every card previously placed. When a player cannot place a card, they lose and the game ends. Given that Yaiza lost and $5$ cards were placed in total, compute the number of ways the cards could have been initially distributed. (The order of cards in a player’s hand does not matter.)

Given $x \ge 0$, prove that $$\frac{(x^2 + 1)^6}{2^7}+\frac12 \ge x^5 - x^3 + x$$

Daredevil Darren challenges Forgetful Fred to spell "Johns Hopkins." Forgetful Fred will spell it correctly except for the 's's; there is a $\frac{1}{3}$ and $\frac{1}{4}$ chance that he will omit the 's' in the first and last names, respectively, with his mistakes being independent of each other. If Forgetful Fred spells the name correctly, then he is happy; otherwise, Daredevil Darren will present him with a dare, and there is a $\frac{9}{10}$ chance that Forgetful Fred will not be happy. Find the probability that Forgetful Fred will be happy.

The lengths of the sides of a triangle are integers, whereas the radius of its circumscribed circle is a prime number. Prove that the triangle is right-angled.

[b]9.[/b] Let $f(z)= z^n +a_1 z^{n-1}+\dots + a_n$ be a polynomial over the field of the complex numbers and let $E_f$ denote the closed (not necessarily connected) domain of complex numbers $z$ for which $\mid f(z) \mid \leq 1$. Show that there exists a point $z_0 \in E_f$ such that $\mid f'(z_0) \mid \geq n$. [b](F. 5)[/b]

Find all pairs $(m,n)$ of nonnegative integers for which \[m^2 + 2 \cdot 3^n = m\left(2^{n+1} - 1\right).\] [i]Proposed by Angelo Di Pasquale, Australia[/i]

Let $A$ and $B$ be two arbitrary points on the circumference of the circle such that $AB$ is not the diameter of the circle. The tangents to the circle drawn at points $A$ and $B$ meet at $T$. Next, choose the diameter $XY$ so that the segments $AX$ and $BY$ intersect. Let this be the intersection of $Q$. Prove that the points $A, B$, and $Q$ lie on a circle with center $T$.

Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $. We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.

We are given a convex polygon. Show that one can find a point $Q$ inside the polygon and three vertices $A_1,A_2,A_3$ (not necessarily consecutive) such that each ray $A_iQ$ ($i=1,2,3$) makes acute angles with the two sides emanating from $A_i$.

What is the fewest number of multiplications required to reach $x^{2000}$ from $x$, using only previously generated powers of $x$? For example $x\rightarrow x^{2}\rightarrow x^{4}\rightarrow x^{8}\rightarrow x^{16}\rightarrow x^{32}\rightarrow x^{64}\rightarrow x^{128}\rightarrow x^{256}\rightarrow x^{512}\rightarrow x^{1024}\rightarrow x^{1536}\rightarrow x^{1792}\rightarrow x^{1920}\rightarrow x^{1984}\rightarrow x^{2000}$ uses $15$ multiplications.

Let $a$ be a positive integer. We say that a positive integer $b$ is [i]$a$-good[/i] if $\tbinom{an}{b}-1$ is divisible by $an+1$ for all positive integers $n$ with $an \geq b$. Suppose $b$ is a positive integer such that $b$ is $a$-good, but $b+2$ is not $a$-good. Prove that $b+1$ is prime.

Consider a regular $n$-gon with $n>3$, call a line [i]acceptable[/i] if it passes through the interior of this $n$-gon. Draw $m$ different acceptable lines, so that the $n$-gon is divided into several smaller polygons. (a) Prove that there exists an $m$, depending only on $n$, such that any collection of $m$ acceptable lines results in one of the smaller polygons having $3$ or $4$ sides. (b) Find the smallest possible $m$ which guarantees that at least one of the smaller polygons will have $3$ or $4$ sides.

How many factors of $(20^{12})^2$ less than $20^{12}$ are not factors of $20^{12}$ ?

In a $4\times 4$ grid of unit squares, five squares are chosen at random. The probability that no two chosen squares share a side is $\tfrac mn$ for positive relatively prime integers $m$ and $n$. Find $m+n$. [i]Proposed by David Altizio[/i]

As shown in the figure, $BQ$ is a diameter of the circumcircle of $ABC$, and $D$ is the midpoint of arc $BC$ (excluding point $A$) . The bisector of the exterior angle of $\angle BAC$ intersects and the extension of $BC$ at point $E$. The ray $EQ$ intersects $\odot (ABC)$ at point $P$. Point $S$ lies on $PQ$ so that $SA = SP$. Point $T$ lies on $BC$ such that $TB = TD$. Prove that $TS \perp SE$. [img]https://cdn.artofproblemsolving.com/attachments/c/4/01460565e70b32b29cddb65d92e041bea40b25.png[/img]

Let $f:[-1,1]\to\mathbb{R}$ be a continuous function such that (i) $f(x)=\frac{2-x^2}{2}f\left(\frac{x^2}{2-x^2}\right)$ for every $x$ in $[-1,1],$ (ii) $ f(0)=1,$ and (iii) $\lim_{x\to 1^-}\frac{f(x)}{\sqrt{1-x}}$ exists and is finite. Prove that $f$ is unique, and express $f(x)$ in closed form.

[b]p1.[/b] A very large lucky number $N$ consists of eighty-eight $8$s in a row. Find the remainder when this number $N$ is divided by $6$. [b]p2.[/b] If $3$ chickens can lay $9$ eggs in $4$ days, how many chickens does it take to lay $180$ eggs in $ 8$ days? [b]p3.[/b] Find the ordered pair $(x, y)$ of real numbers satisfying the conditions $x > y$, $x+y = 10$, and $xy = -119$. [b]p4.[/b] There is pair of similar triangles. One triangle has side lengths $4, 6$, and $9$. The other triangle has side lengths $ 8$, $12$ and $x$. Find the sum of two possible values of $x$. [b]p5.[/b] If $x^2 +\frac{1}{x^2} = 3$, there are two possible values of $x +\frac{1}{x}$. What is the smaller of the two values? [b]p6.[/b] Three flavors (chocolate strawberry, vanilla) of ice cream are sold at Brian’s ice cream shop. Brian’s friend Zerg gets a coupon for $10$ free scoops of ice cream. If the coupon requires Zerg to choose an even number of scoops of each flavor of ice cream, how many ways can he choose his ice cream scoops? (For example, he could have $6$ scoops of vanilla and $4$ scoops of chocolate. The order in which Zerg eats the scoops does not matter.) [b]p7.[/b] David decides he wants to join the West African Drumming Ensemble, and thus he goes to the store and buys three large cylindrical drums. In order to ensure none of the drums drop on the way home, he ties a rope around all of the drums at their mid sections so that each drum is next to the other two. Suppose that each drum has a diameter of $3.5$ feet. David needs $m$ feet of rope. Given that $m = a\pi + b$, where $a$ and $b$ are rational numbers, find sum $a + b$. [b]p8.[/b] Segment $AB$ is the diameter of a semicircle of radius $24$. A beam of light is shot from a point $12\sqrt3$ from the center of the semicircle, and perpendicular to $AB$. How many times does it reflect off the semicircle before hitting $AB$ again? [b]p9.[/b] A cube is inscribed in a sphere of radius $ 8$. A smaller sphere is inscribed in the same sphere such that it is externally tangent to one face of the cube and internally tangent to the larger sphere. The maximum value of the ratio of the volume of the smaller sphere to the volume of the larger sphere can be written in the form $\frac{a-\sqrt{b}}{36}$ , where $a$ and $b$ are positive integers. Find the product $ab$. [b]p10.[/b] How many ordered pairs $(x, y)$ of integers are there such that $2xy + x + y = 52$? [b]p11.[/b] Three musketeers looted a caravan and walked off with a chest full of coins. During the night, the first musketeer divided the coins into three equal piles, with one coin left over. He threw it into the ocean and took one of the piles for himself, then went back to sleep. The second musketeer woke up an hour later. He divided the remaining coins into three equal piles, and threw out the one coin that was left over. He took one of the piles and went back to sleep. The third musketeer woke up and divided the remaining coins into three equal piles, threw out the extra coin, and took one pile for himself. The next morning, the three musketeers gathered around to divide the coins into three equal piles. Strangely enough, they had one coin left over this time as well. What is the minimum number of coins that were originally in the chest? [b]p12.[/b] The diagram shows a rectangle that has been divided into ten squares of different sizes. The smallest square is $2 \times 2$ (marked with *). What is the area of the rectangle (which looks rather like a square itself)? [img]https://cdn.artofproblemsolving.com/attachments/4/a/7b8ebc1a9e3808096539154f0107f3e23d168b.png[/img] [b]p13.[/b] Let $A = (3, 2)$, $B = (0, 1)$, and $P$ be on the line $x + y = 0$. What is the minimum possible value of $AP + BP$? [b]p14.[/b] Mr. Mustafa the number man got a $6 \times x$ rectangular chess board for his birthday. Because he was bored, he wrote the numbers $1$ to $6x$ starting in the upper left corner and moving across row by row (so the number $x + 1$ is in the $2$nd row, $1$st column). Then, he wrote the same numbers starting in the upper left corner and moving down each column (so the number $7$ appears in the $1$st row, $2$nd column). He then added up the two numbers in each of the cells and found that some of the sums were repeated. Given that $x$ is less than or equal to $100$, how many possibilities are there for $x$? [b]p15.[/b] Six congruent equilateral triangles are arranged in the plane so that every triangle shares at least one whole edge with some other triangle. Find the number of distinct arrangements. (Two arrangements are considered the same if one can be rotated and/or reflected onto another.) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all 4-tuples ($a, b,c, d$) of real numbers satisfying the following four equations: $\begin{cases} ab + c + d = 3 \\ bc + d + a = 5 \\ cd + a + b = 2 \\ da + b + c = 6 \end{cases}$

Let $n\in \mathbb{Z}_{> 0}$. The set $S$ contains all positive integers written in decimal form that simultaneously satisfy the following conditions: [list=1][*] each element of $S$ has exactly $n$ digits; [*] each element of $S$ is divisible by $3$; [*] each element of $S$ has all its digits from the set $\{3,5,7,9\}$ [/list] Find $\mid S\mid$

What is the larget integer $n$ such that $5^n$ divides $\frac {2006!}{(1003!)^2}$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 500 $

Let $A_1$ be the midpoint of the smaller arc $BC$ of the circumcircle of the acute-angled triangle $ABC.{}$ The point $A_1$ is reflected relative to the side $BC,$ and then its image is reflected relative to the bisector of $\angle BAC{}$ resulting in the point $A_2 $. Similarly, the points $B_2$ and $C_2$ are constructed. Prove that the circumcenter and incenter of the triangle $ABC{}$ lie on the Euler line of the triangle $A_2B_2C_2.$ [i]Proposed by A. Tereshin[/i]

The checker moves from the lower left corner of the board $100 \times 100$ to the right top corner, moving at each step one cell to the right or one cell up. Let $a$ be the number of paths in which exactly $70$ steps the checker take under the diagonal going from the lower left corner to the upper right corner, and $b$ is the number of paths in which such steps are exactly $110$. What is more: $a$ or $b$?