Let $\mathbb{N}$ be the set of positive integers. Let $n\in \mathbb{N}$ and let $d(n)$ be the number of divisors of $n$. Let $\varphi(n)$ be the Euler-totient function (the number of co-prime positive integers with $n$, smaller than $n$). Find all non-negative integers $c$ such that there exists $n\in\mathbb{N}$ such that \[ d(n) + \varphi(n) = n+c , \] and for such $c$ find all values of $n$ satisfying the above relationship.

Consider the multiplicative group $A=\{z\in\mathbb{C}|z^{2006^k}=1, 0<k\in\mathbb{Z}\}$ of all the roots of unity of degree $2006^k$ for all positive integers $k$. Find the number of homomorphisms $f:A\to A$ that satisfy $f(f(x))=f(x)$ for all elements $x\in A$.

Ninety-four bricks, each measuring $4''\times10''\times19'',$ are to stacked one on top of another to form a tower 94 bricks tall. Each brick can be oriented so it contribues $4''$ or $10''$ or $19''$ to the total height of the tower. How many differnt tower heights can be achieved using all 94 of the bricks?

At Stanford in 1988, human calculator Shakuntala Devi was asked to compute $m = \sqrt[3]{61{,}629{,}875}$ and $n = \sqrt[7]{170{,}859{,}375}$. Given that $m$ and $n$ are both integers, compute $100m+n$. [i]Proposed by Evan Chen[/i]

Let $a,b,c,d$ be positive reals such taht $a+b+c+d=1$. Prove that: \[6(a^{3}+b^{3}+c^{3}+d^{3})\geq a^{2}+b^{2}+c^{2}+d^{2}+\frac{1}{8}.\]

prove that for each natural number $n$ there exist a polynomial with degree $2n+1$ with coefficients in $\mathbb{Q}[x]$ such that it has exactly $2$ complex zeros and it's irreducible in $\mathbb{Q}[x]$.(20 points)

Let $ABCD$ be a cyclic quadrilateral such that $AB \cdot BC=2 \cdot AD \cdot DC$. Prove that its diagonals $AC$ and $BD$ satisfy the inequality $8BD^2 \le 9AC^2$. [color=#FF0000]Moderator says: Use the search before posting contest problems [url]http://www.artofproblemsolving.com/Forum/viewtopic.php?f=46&t=530783[/url][/color]

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]

Determine whether there exist two reals $x,y$ and a sequence $\{a_n\}_{n=0}^{\infty}$ of nonzero reals such that $a_{n+2}=xa_{n+1}+ya_n$ for all $n\ge0$ and for every positive real number $r$, there exist positive integers $i,j$ such that $|a_i|<r<|a_j|$. [i]Alex Zhu.[/i]

Let $u$ and $v$ be integers satisfying $0<v<u.$ Let $A=(u,v),$ let $B$ be the reflection of $A$ across the line $y=x,$ let $C$ be the reflection of $B$ across the y-axis, let $D$ be the reflection of $C$ across the x-axis, and let $E$ be the reflection of $D$ across the y-axis. The area of pentagon $ABCDE$ is 451. Find $u+v.$

Each positive integer shall be coloured red or green such that it satisfies the following properties: - The sum of three not necessarily distinct red numbers is a red number. - The sum of three not necessarily distinct green numbers is a green number. - There are red and green numbers. Find all such colorations!

Prove that if the function $ f : \mathbb{R}^2 \rightarrow [0,1]$ is continuous and its average on every circle of radius $ 1$ equals the function value at the center of the circle, then $ f$ is constant. [i]V. Totik[/i]

Let $ f$ and $ g$ be polynomials with rational coefficients, and let $ F$ and $ G$ denote the sets of values of $ f$ and $ g$ at rational numbers. Prove that $ F \equal{} G$ holds if and only if $ f(x) \equal{} g(ax \plus{} b)$ for some suitable rational numbers $ a\not \equal{} 0$ and $ b$. [i]E. Fried[/i]

Noah has 8 species of animals to fit into 4 cages of the ark. He plans to put species in each cage. It turns out that, for each species, there are at most 3 other species with which it cannot share the accomodation. Prove that there is a way to assign the animals to their cages so that each species shares with compatible species.

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. \]