Find all polynomials $f(x)$ with integer coefficients such that $f(n)$ and $f(2^{n})$ are co-prime for all natural numbers $n$.

What is the product of real numbers $a$ which make $x^2+ax+1$ a negative integer for only one real number $x$? $ \textbf{(A)}\ -1 \qquad\textbf{(B)}\ -2 \qquad\textbf{(C)}\ -4 \qquad\textbf{(D)}\ -6 \qquad\textbf{(E)}\ -8 $

How many primes exist which are less than 50?

For what integers $ n\ge 3$ is it possible to accommodate, in some order, the numbers $ 1,2,\cdots, n$ in a circular form such that every number divides the sum of the next two numbers, in a clockwise direction?

Let $d = a^{1999} + b^{1999} + c^{1999}$ , where $a, b$ and $c$ are integers such that $a + b + c = 0$. (a) May it happen that $d = 2$? (b) May it happen that $d$ is prime? (V Senderov)

The real numbers $a$ and $b$ satisfy the relation $a + b \ge 1$. Show that $8 (a^4 + b^4) \ge 1$.

$D$ is inner point of triangle $ABC$. $E$ is on $BD$ and $CE=BD$. $\angle ABD=\angle ECD=10,\angle BAD=40,\angle CED=60$ Prove, that $AB>AC$

Let $a,b,c$ be the lengths of the sides of a given triangle.If positive reals $x,y,z$ satisfy $x+y+z=1,$ find the maximum of $axy+byz+czx.$

Let $A$ be a six-digit number, three of which are colored and equal to $1, 2$, and $4$. Prove that it is always possible to obtain a number that is a multiple of $7$, by performing only one of the following operations: either delete the three colored figures, or write all the numbers of $A$ in some order.

A plastic snap-together cube has a protruding snap on one side and receptacle holes on the other five sides as shown. What is the smallest number of these cubes that can be snapped together so that only receptacle holes are showing? [asy] draw((0,0)--(4,0)--(4,4)--(0,4)--cycle); draw(circle((2,2),1)); draw((4,0)--(6,1)--(6,5)--(4,4)); draw((6,5)--(2,5)--(0,4)); draw(ellipse((5,2.5),0.5,1)); fill(ellipse((3,4.5),1,0.25),black); fill((2,4.5)--(2,5.25)--(4,5.25)--(4,4.5)--cycle,black); fill(ellipse((3,5.25),1,0.25),black); [/asy] $\text{(A)}\ 3 \qquad \text{(B)}\ 4 \qquad \text{(C)}\ 5 \qquad \text{(D)}\ 6 \qquad \text{(E)}\ 8$

Let $a$ be any integer. Prove that there are infinitely many primes $p$ such that \[ p\,|\,n^2+3\qquad\text{and}\qquad p\,|\,m^3-a \] for some integers $n$ and $m$.

Pablo will decorate each of $6$ identical white balls with either a striped or a dotted pattern, using either red or blue paint. He will decide on the color and pattern for each ball by flipping a fair coin for each of the $12$ decisions he must make. After the paint dries, he will place the $6$ balls in an urn. Frida will randomly select one ball from the urn and note its color and pattern. The events "the ball Frida selects is red" and "the ball Frida selects is striped" may or may not be independent, depending on the outcome of Pablo's coin flips. The probability that these two events are independent can be written as $\frac mn,$ where $m$ and $n$ are relatively prime positive integers. What is $m?$ (Recall that two events $A$ and $B$ are independent if $P(A \text{ and }B) = P(A) \cdot P(B).$) $\textbf{(A) } 243 \qquad \textbf{(B) } 245 \qquad \textbf{(C) } 247 \qquad \textbf{(D) } 249\qquad \textbf{(E) } 251$

Let $ABC$ be a triangle with $AB = 3$, $AC = 8$, $BC = 7$ and let $M$ and $N$ be the midpoints of $\overline{AB}$ and $\overline{AC}$, respectively. Point $T$ is selected on side $BC$ so that $AT = TC$. The circumcircles of triangles $BAT$, $MAN$ intersect at $D$. Compute $DC$.

Which reaction has the most positive entropy change under standard conditions? $ \textbf{(A)}\hspace{.05in}\ce{H2O}_{(g)}+\ce{CO}_{(g)} \rightarrow \ce{H2}_{(g)}+ \ce{CO2}_{(g)}\qquad$ $\textbf{(B)}\hspace{.05in}\ce{CaCO3}_{(s)} \rightarrow \ce{CaO}_{(s)} + \ce{CO2}_{(g)} \qquad$ $\textbf{(C)}\hspace{.05in}\ce{NH3}_{(g)} \rightarrow \ce{NH3}_{(aq)}\qquad$ $\textbf{(D)}\hspace{.05in}\ce{C8H18}_{(l)} \rightarrow \ce{C8H18}_{(s)}\qquad$

Given a positive integer $ k$, there is a positive integer $ n$ with the property that one can obtain the sum of the first $ n$ positive integers by writing some $ k$ digits to the right of $ n$. Find the remainder of $ n$ when dividing at $ 9$.

Let $ABC$ be a triangle with circumcircle $\Gamma$ and incenter $I$ and let $M$ be the midpoint of $\overline{BC}$. The points $D$, $E$, $F$ are selected on sides $\overline{BC}$, $\overline{CA}$, $\overline{AB}$ such that $\overline{ID} \perp \overline{BC}$, $\overline{IE}\perp \overline{AI}$, and $\overline{IF}\perp \overline{AI}$. Suppose that the circumcircle of $\triangle AEF$ intersects $\Gamma$ at a point $X$ other than $A$. Prove that lines $XD$ and $AM$ meet on $\Gamma$. [i]Proposed by Evan Chen, Taiwan[/i]

There was a tub on the plane, with its upper base greater that the lower one. The tub was overturned. Prove that the area of its visible shade did decrease. (The tub is a frustum of a right circular cone: its bases are two discs in parallel planes, such that their centers lie on a line perpendicular to these planes. The visible shade is the total shade besides the shade under the tub. Consider the sun rays as parallel.)

Let $ABC$ be a triangle. Take points $D$, $E$, $F$ on the perpendicular bisectors of $BC$, $CA$, $AB$ respectively. Show that the lines through $A$, $B$, $C$ perpendicular to $EF$, $FD$, $DE$ respectively are concurrent.

a) Find the minimal value of the polynomial $$P(x,y) = 4 + x^2y^4 + x^4y^2 - 3x^2y^2$$ b) Prove that it cannot be represented as a sum of the squares of some polynomials of $x,y$.

Suppose that $f$ and $g$ are two functions defined on the set of positive integers and taking positive integer values. Suppose also that the equations $f(g(n)) = f(n) + 1$ and $g(f(n)) = g(n) + 1$ hold for all positive integers. Prove that $f(n) = g(n)$ for all positive integer $n.$ [i]Proposed by Alex Schreiber, Germany[/i]

A cyclic quadrilateral $ABCD$ has diameter $AC$ with circumcircle $\omega$. Let $K$ be the foot of the perpendicular from $C$ to $BD$, and the tangent to $\omega$ at $A$ meets $BD$ at $T$. Let the line $AK$ meets $\omega$ at $X$ and choose a point $Y$ on line $AK$ such that $\angle TYA=90^{\circ}$. Prove that $AY=KX$. [i]Proposed by Anzo Teh Zhao Yang[/i]

Let $k \geq 2, 1 < n_1 < n_2 < \ldots < n_k$ are positive integers, $a,b \in \mathbb{Z}^+$ satisfy \[ \prod^k_{i=1} \left( 1 - \frac{1}{n_i} \right) \leq \frac{a}{b} < \prod^{k-1}_{i=1} \left( 1 - \frac{1}{n_i} \right) \] Prove that: \[ \prod^k_{i=1} n_i \geq (4 \cdot a)^{2^k - 1}. \]

Fill in the circles to the right with the numbers 1 through 16 so that each number is used once (the number 1 has been filled in already). The number in any non-circular region is equal to the greatest difference between any two numbers in the circles on that region's vertices. You do not need to prove that your configuration is the only one possible; you merely need to find a valid conguration. (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(190); defaultpen(linewidth(0.8)); int i,j; path p; for(i=0;i<=3;++i){ draw((i,0)--(i,3)); draw((0,i)--(3,i)); } draw((0,3)--(1,2)^^(0,1)--(2,3)^^(1,0)--(3,2)^^(3,0)--(2,1)); for(i=0;i<=3;++i){ for(j=0;j<=3;++j){ p=circle((i,j),1/4); unfill(p); draw(p); } } label("$1$",(0,3)); label("$7$",(1/3,2+1/3)); label("$8$",(2/3,2+2/3)); label("$2$",(1+1/3,2+2/3)); label("$2$",(1/3,1+2/3)); label("$2$",(2+2/3,1+1/3)); label("$8$",(1+2/3,1/3)); label("$5$",(2+1/3,1/3)); label("$4$",(2+2/3,2/3)); label("$4$",(1/2,1/2)); label("$10$",(3/2,3/2)); label("$11$",(5/2,5/2)); [/asy]

Let $ABC$ be a triangle with $m(\widehat{ABC}) = 90^{\circ}$. The circle with diameter $AB$ intersects the side $[AC]$ at $D$. The tangent to the circle at $D$ meets $BC$ at $E$. If $|EC| =2$, then what is $|AC|^2 - |AE|^2$ ? $\textbf{(A)}\ 18 \qquad\textbf{(B)}\ 16 \qquad\textbf{(C)}\ 12 \qquad\textbf{(E)}\ 10 \qquad\textbf{(E)}\ \text{None}$

Let $f_1(x) = \frac{2}{3}-\frac{3}{3x+1}$, and for $n \ge 2$, define $f_n(x) = f_1(f_{n-1} (x))$. The value of x that satisfies $f_{1001}(x) = x - 3$ can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.