An $8\times 8$ chessboard is made of unit squares. We put a rectangular piece of paper with sides of length 1 and 2. We say that the paper and a single square overlap if they share an inner point. Determine the maximum number of black squares that can overlap the paper.

In an attempt to copy down from the board a sequence of six positive integers in arithmetic progression, a student wrote down the five numbers, \[ 113,137,149,155,173, \] accidentally omitting one. He later discovered that he also miscopied one of them. Can you help him and recover the original sequence?

Find all derivable functions that have real domain and codomain, and are equal to their second functional power.

A strip consists of $n$ squares which are numerated in their order by integers $1,2,3,..., n$. In the beginning, one square is empty while each remaining square contains one piece. Whenever a square contains a piece and its some neighbouring square contains another piece while the square immediately following the neighbouring square is empty, one may raise the first piece over the second one to the empty square, removing the second piece from the strip. Find all possibilites which square can be initially empty, if it is possible to reach a state where the strip contains only one piece and a) $n = 2008$, b) $n = 2009$.

$\angle 1 + \angle 2 = 180^\circ $ $\angle 3 = \angle 4$ Find $\angle 4.$ [asy]pair H,I,J,K,L; H = (0,0); I = 10*dir(70); J = I + 10*dir(290); K = J + 5*dir(110); L = J + 5*dir(0); draw(H--I--J--cycle); draw(K--L--J); draw(arc((0,0),dir(70),(1,0),CW)); label("$70^\circ$",dir(35),NE); draw(arc(I,I+dir(250),I+dir(290),CCW)); label("$40^\circ$",I+1.25*dir(270),S); label("$1$",J+0.25*dir(162.5),NW); label("$2$",J+0.25*dir(17.5),NE); label("$3$",L+dir(162.5),WNW); label("$4$",K+dir(-52.5),SE); [/asy] $\textbf{(A)}\ 20^\circ \qquad \textbf{(B)}\ 25^\circ \qquad \textbf{(C)}\ 30^\circ \qquad \textbf{(D)}\ 35^\circ \qquad \textbf{(E)}\ 40^\circ$

After swimming around the ocean with some snorkling gear, Joshua walks back to the beach where Alexis works on a mural in the sand beside where they drew out symbol lists. Joshua walks directly over the mural without paying any attention. "You're a square, Josh." "No, $\textit{you're}$ a square," retorts Joshua. "In fact, you're a $\textit{cube}$, which is $50\%$ freakier than a square by dimension. And before you tell me I'm a hypercube, I'll remind you that mom and dad confirmed that they could not have given birth to a four dimension being." "Okay, you're a cubist caricature of male immaturity," asserts Alexis. Knowing nothing about cubism, Joshua decides to ignore Alexis and walk to where he stashed his belongings by a beach umbrella. He starts thinking about cubes and computes some sums of cubes, and some cubes of sums: \begin{align*}1^3+1^3+1^3&=3,\\1^3+1^3+2^3&=10,\\1^3+2^3+2^3&=17,\\2^3+2^3+2^3&=24,\\1^3+1^3+3^3&=29,\\1^3+2^3+3^3&=36,\\(1+1+1)^3&=27,\\(1+1+2)^3&=64,\\(1+2+2)^3&=125,\\(2+2+2)^3&=216,\\(1+1+3)^3&=125,\\(1+2+3)^3&=216.\end{align*} Josh recognizes that the cubes of the sums are always larger than the sum of cubes of positive integers. For instance, \begin{align*}(1+2+4)^3&=1^3+2^3+4^3+3(1^2\cdot 2+1^2\cdot 4+2^2\cdot 1+2^2\cdot 4+4^2\cdot 1+4^2\cdot 2)+6(1\cdot 2\cdot 4)\\&>1^3+2^3+4^3.\end{align*} Josh begins to wonder if there is a smallest value of $n$ such that \[(a+b+c)^3\leq n(a^3+b^3+c^3)\] for all natural numbers $a$, $b$, and $c$. Joshua thinks he has an answer, but doesn't know how to prove it, so he takes it to Michael who confirms Joshua's answer with a proof. What is the correct value of $n$ that Joshua found?

Find all triples $a,b,c$ of positive integers such that \[ ( 1 + \frac{1}{a} ) ( 1 + \frac{1}{b}) ( 1 + \frac{1}{c} ) = 3. \]

Suppose that $a,b$ are two odd positive integers such that $2ab+1 \mid a^2 + b^2 + 1$. Prove that $a=b$. (15 points)

Determine all real solutions of the following system of equations: $$x+y^2=y^3$$ $$y+x^2=x^3$$

Let $n$ and $k$ be natural numbers and $a_1,a_2,\ldots ,a_n$ be positive real numbers satisfying $a_1+a_2+\cdots +a_n=1$. Prove that \[\dfrac {1} {a_1^{k}}+\dfrac {1} {a_2^{k}}+\cdots +\dfrac {1} {a_n^{k}} \ge n^{k+1}.\]

Determine the sixth number after the decimal point in the number $(\sqrt{1978} +\lfloor\sqrt{1978}\rfloor)^{20}$

Niek has $16$ square cards that are yellow on one side and red on the other. He puts down the cards to form a $4 \times 4$-square. Some of the cards show their yellow side and some show their red side. For a colour pattern he calculates the [i]monochromaticity [/i] as follows. For every pair of adjacent cards that share a side he counts $+1$ or $-1$ according to the following rule: $+1$ if the adjacent cards show the same colour, and $-1$ if the adjacent cards show different colours. Adding this all together gives the monochromaticity (which might be negative). For example, if he lays down the cards as below, there are $15$ pairs of adjacent cards showing the same colour, and $9$ such pairs showing different colours. [asy] unitsize(1 cm); int i; fill(shift((0,0))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((1,0))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((2,0))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((3,0))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((0,1))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((1,1))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), red); fill(shift((2,1))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((3,1))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((0,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((1,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((2,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((3,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), red); fill(shift((0,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), red); fill(shift((1,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((2,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), yellow); fill(shift((3,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), red); for (i = 0; i <= 4; ++i) { draw((i,0)--(i,4)); draw((0,i)--(4,i)); } [/asy] The monochromaticity of this pattern is thus $15 \cdot (+1) + 9 \cdot (-1) = 6$. Niek investigates all possible colour patterns and makes a list of all possible numbers that appear at least once as a value of the monochromaticity. That is, Niek makes a list with all numbers such that there exists a colour pattern that has this number as its monochromaticity. (a) What are the three largest numbers on his list? ([i]Explain your answer. If your answer is, for example, $ 12$, $9$ and $6$, then you have to show that these numbers do in fact appear on the list by giving a colouring for each of these numbers, and furthermore prove that the numbers $7$, $ 8$, $10$, $11$ and all numbers bigger than $ 12$ do not appear.[/i]) (b) What are the three smallest (most negative) numbers on his list? (c) What is the smallest positive number (so, greater than $0$) on his list?

Determine the leftmost three digits of the number \[1^1+2^2+3^3+...+999^{999}+1000^{1000}.\]

What least possible number of unit squares $(1\times1)$ must be drawn in order to get a picture of $25 \times 25$-square divided into $625$ of unit squares?

Find all real $x,y,z$ that \[\left\{\begin{array}{c}x+y+zx=\frac12\\ \\ y+z+xy=\frac12\\ \\ z+x+yz=\frac12\end{array}\right.\]

Let $S$ be the set of all pairs $(a,b)$ of real numbers satisfying $1+a+a^2+a^3 = b^2(1+3a)$ and $1+2a+3a^2 = b^2 - \frac{5}{b}$. Find $A+B+C$, where \[ A = \prod_{(a,b) \in S} a , \quad B = \prod_{(a,b) \in S} b , \quad \text{and} \quad C = \sum_{(a,b) \in S} ab. \][i]Proposed by Evan Chen[/i]

Suppose that a function $f(x)$ defined in $-1<x<1$ satisfies the following properties (i) , (ii), (iii). (i) $f'(x)$ is continuous. (ii) When $-1<x<0,\ f'(x)<0,\ f'(0)=0$, when $0<x<1,\ f'(x)>0$. (iii) $f(0)=-1$ Let $F(x)=\int_0^x \sqrt{1+\{f'(t)\}^2}dt\ (-1<x<1)$. If $F(\sin \theta)=c\theta\ (c :\text{constant})$ holds for $-\frac{\pi}{2}<\theta <\frac{\pi}{2}$, then find $f(x)$. [i]1975 Waseda University entrance exam/Science and Technology[/i]

Georg has $2n + 1$ cards with one number written on each card. On one card the integer $0$ is written, and among the rest of the cards, the integers $k = 1, ... , n$ appear, each twice. Georg wants to place the cards in a row in such a way that the $0$-card is in the middle, and for each $k = 1, ... , n$, the two cards with the number $k$ have the distance $k$ (meaning that there are exactly $k - 1$ cards between them). For which $1 \le n \le 10$ is this possible?

Find the largest positive integer $n$ of the form $n=p^{2\alpha}q^{2\beta}r^{2\gamma}$ for primes $p<q, r$ and positive integers $\alpha, \beta, \gamma$, such that $|r-pq|=1$ and $p^{2\alpha}-1, q^{2\beta}-1, r^{2\gamma}-1$ all divide $n$.

Given a regular hexagon, a circle is drawn circumscribing it and another circle is drawn inscribing it. The ratio of the area of the larger circle to the area of the smaller circle can be written in the form $\frac{m}{n}$ , where m and n are relatively prime positive integers. Compute $m + n$.

Compute the value of $$\sin^2\left(\frac{\pi}{7}\right) + \sin^2\left(\frac{3\pi}{7}\right) + \sin^2\left(\frac{5\pi}{7}\right).$$ Your answer should not involve any trigonometric functions. [i]Proposed by Howard Halim[/i]

Find all positive integers $n$ for which $$S(n^2)+S(n)^2=n$$ where $S(m)$ denotes the sum of digits of $m$.

Find all functions $f : \mathbb{R} \to \mathbb{R} $ which verify the relation \[(x-2)f(y)+f(y+2f(x))= f(x+yf(x)), \qquad \forall x,y \in \mathbb R.\]

A broken line consists of $31$ segments. It has no self intersections, and its start and end points are distinct. All segments are extended to become straight lines. Find the least possible number of straight lines.

A polygon can be divided into 100 rectangles, but not into 99. Prove that it cannot be divided into 100 triangles. [i]A. Shapovalov[/i]