Consider the region $A$ in the complex plane that consists of all points $z$ such that both $\frac{z}{40}$ and $\frac{40}{\overline{z}}$ have real and imaginary parts between $0$ and $1$, inclusive. What is the integer that is nearest the area of $A$?

An [i]animal[/i] with $n$ [i]cells[/i] is a connected figure consisting of $n$ equal-sized cells[1]. A [i]dinosaur[/i] is an animal with at least $2007$ cells. It is said to be [i]primitive[/i] it its cells cannot be partitioned into two or more dinosaurs. Find with proof the maximum number of cells in a primitive dinosaur. (1) Animals are also called [i]polyominoes[/i]. They can be defined inductively. Two cells are [i]adjacent[/i] if they share a complete edge. A single cell is an animal, and given an animal with $n$ cells, one with $n+1$ cells is obtained by adjoining a new cell by making it adjacent to one or more existing cells.

Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a continuous function with the following property: for all $\alpha \in \mathbb{R}_{>0}$, the sequence $(a_n)_{n \in \mathbb{N}}$ defined as $a_n = f(n\alpha)$ satisfies $\lim_{n \to \infty} a_n = 0$. Is it necessarily true that $\lim_{x \to +\infty} f(x) = 0$?

Police want to arrest on the famous criminals of the country whose name is Kaiser. Kaiser is in one of the streets of a square shaped city with $ n$ vertical streets and $ n$ horizontal streets. In the following cases how many police officers are needed to arrest Kaiser? [img]http://i38.tinypic.com/2i1icec_th.png[/img] [img]http://i34.tinypic.com/28rk4s3_th.png[/img] a) Each police officer has the same speed as Kaiser and every police officer knows the location of Kaiser anytime. b) Kaiser has an infinite speed (finite but with no bound) and police officers can only know where he is only when one of them see Kaiser. Everybody in this problem (including police officers and Kaiser) move continuously and can stop or change his path.

The grid on the right has $12$ boxes and $15$ edges connecting boxes. In each box, place one of the six integers from $1$ to $6$ such that the following conditions hold: [list] [*]For each possible pair of distinct numbers from $1$ to $6$, there is exactly one edge connecting two boxes with that pair of numbers. [*]If an edge has an arrow, then it points from a box with a smaller number to a box with a larger number.[/list] You do not need to prove that your conguration is the only one possible; you merely need to find a conguration that satises the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justication acceptable.) [asy] size(200); defaultpen(linewidth(0.8)); int i,j; for(i=0;i<4;i=i+1) { for(j=0;j<3;j=j+1) { draw((i,j)--(i,j+1/2)--(i+1/2,j+1/2)--(i+1/2,j)--cycle); } } draw((1/2,1/4)--(1,1/4)^^(1/2,5/4)--(1,5/4)^^(3/2,5/4)--(2,5/4)^^(5/2,5/4)--(3,5/4)^^(5/2,9/4)--(3,9/4)); draw((1/4,1)--(1/4,1/2),Arrow(5)); draw((5/4,1)--(5/4,1/2),Arrow(5)); draw((1/4,2)--(1/4,3/2),Arrow(5)); draw((9/4,2)--(9/4,3/2),Arrow(5)); draw((13/4,2)--(13/4,3/2),Arrow(5)); draw((13/4,1)--(13/4,1/2),Arrow(5)); draw((2,1/4)--(3/2,1/4),Arrow(5)); draw((1,9/4)--(1/2,9/4),Arrow(5)); draw((5/2,1/4)--(3,1/4),Arrow(5)); draw((3/2,9/4)--(2,9/4),Arrow(5)); [/asy]

Consider a round-robin tournament with $2n+1$ teams, where each team plays each other team exactly one. We say that three teams $X,Y$ and $Z$, form a [i]cycle triplet [/i] if $X$ beats $Y$, $Y$ beats $Z$ and $Z$ beats $X$. There are no ties. a)Determine the minimum number of cycle triplets possible. b)Determine the maximum number of cycle triplets possible.

A circle which is tangent to the sides $ [AB]$ and $ [BC]$ of $ \triangle ABC$ is also tangent to its circumcircle at the point $ T$. If $ I$ is the incenter of $ \triangle ABC$ , show that $ \widehat{ATI}\equal{}\widehat{CTI}$

On Monday, Millie puts a quart of seeds, $ 25\%$ of which are millet, into a bird feeder. On each successive day she adds another quart of the same mix of seeds without removing any seeds that are left. Each day the birds eat only $ 25\%$ of the millet in the feeder, but they eat all of the other seeds. On which day, just after Millie has placed the seeds, will the birds find that more than half the seeds in the feeder are millet? $ \textbf{(A)}\ \text{Tuesday}\qquad \textbf{(B)}\ \text{Wednesday}\qquad \textbf{(C)}\ \text{Thursday} \qquad \textbf{(D)}\ \text{Friday}\qquad \textbf{(E)}\ \text{Saturday}$

Let $ ABC$ be a triangle and $ P$ an arbitrary point in the plane. Let $ \alpha, \beta, \gamma$ be interior angles of the triangle and its area is denoted by $ F.$ Prove: \[ \ov{AP}^2 \cdot \sin 2\alpha + \ov{BP}^2 \cdot \sin 2\beta + \ov{CP}^2 \cdot \sin 2\gamma \geq 2F \] When does equality occur?

The natural numbers are written in sequence, in increasing order, and by this we get an infinite sequence of digits. Find the least natural $k$, for which among the first $k$ digits of this sequence, any two nonzero digits have been written a different number of times. [i]Aleksandar Ivanov, Emil Kolev [/i]

Show that there exist infinitely many square-free positive integers $n$ that divide $2005^n-1$.

Find a $n\in\mathbb{N}$ such that for all primes $p$, $n$ is divisible by $p$ if and only if $n$ is divisible by $p-1$.

For which cardinalities $ \kappa$ do antimetric spaces of cardinality $ \kappa$ exist? $ (X,\varrho)$ is called an $ \textit{antimetric space}$ if $ X$ is a nonempty set, $ \varrho : X^2 \rightarrow [0,\infty)$ is a symmetric map, $ \varrho(x,y)\equal{}0$ holds iff $ x\equal{}y$, and for any three-element subset $ \{a_1,a_2,a_3 \}$ of $ X$ \[ \varrho(a_{1f},a_{2f})\plus{}\varrho(a_{2f},a_{3f}) < \varrho(a_{1f},a_{3f})\] holds for some permutation $ f$ of $ \{1,2,3 \}$. [i]V. Totik[/i]

Find the number of unordered pairs $\{ A,B \}$ of subsets of an n-element set $X$ that satisfies the following: (a) $A \not= B$ (b) $A \cup B = X$

Let $A$ be the largest subset of $\{1,\dots,n\}$ such that for each $x\in A$, $x$ divides at most one other element in $A$. Prove that \[\frac{2n}3\leq |A|\leq \left\lceil \frac{3n}4\right\rceil. \]

Each term in a sequence $1,0,1,0,1,0...$starting with the seventh is the sum of the last 6 terms mod 10 .Prove that the sequence $...,0,1,0,1,0,1...$ never occurs

If $0\le a\le b\le c$ real numbers, prove that $(a+3b)(b+4c)(c+2a)\ge 60abc$.

Let $ A \equal{} (a_{ik})$ be an $ n\times n$ matrix with nonnegative elements such that $ \sum_{k \equal{} 1}^n a_{ik} \equal{} 1$ for $ i \equal{} 1,...,n$. Show that, for every eigenvalue $ \lambda$ of $ A$, either $ |\lambda| < 1$ or there exists a positive integer $ k$ such that $ \lambda^k \equal{} 1$

Consider the sequence $ \{a_n\}_{n\geq1}$ defined as follows: $ a_1 \equal{} 1$, $ a_{2k} \equal{} 1 \plus{} a_k$ and $ a_{2k \plus{} 1} \equal{} \frac {1}{a_{2k}}$ for every $ k\geq 1$. Prove that every positive rational number appears on the sequence $ \{a_n\}$ exactly once.

Find all $n$ such that \[n = d (n) ^ 4\] Where $d (n)$ is the number of divisors of $n$, for example $n = 2 \cdot 3\cdot 5\implies d (n) = 2 \cdot 2\cdot 2$.

Find all pairs of positive integers $(a,b)$ such that $2^a+3^b$ is the square of an integer.

Let $a,b$ be coprime integers. Show that the equation $ax^2 + by^2 =z^3$ has an infinite set of solutions $(x,y,z)$ with $\{x,y,z\}\in\mathbb{Z}$ and each pair of $x,y$ mutually coprime.

Find all polynomials $ p$ of one variable with integer coefficients such that if $ a$ and $ b$ are natural numbers such that $ a \plus{} b$ is a perfect square, then $ p\left(a\right) \plus{} p\left(b\right)$ is also a perfect square.

Initially numbers from 1 to 1000000 are all colored black. A move consists of picking one number, then change the color (black to white or white to black) of itself and all other numbers NOT coprime with the chosen number. Can all numbers become white after finite numbers of moves? Edited by pbornsztein

Some $ m$ squares on the chessboard are marked. If among four squares at the intersection of some two rows and two columns three squares are marked then it is allowed to mark the fourth square. Find the smallest $ m$ for which it is possible to mark all squares after several such operations.