Given positive numbers $a,b,c,d$. Prove that the set of inequalities $$a+b<c+d$$ $$(a+b)(c+d)<ab+cd$$ $$(a+b)cd<ab(c+d)$$ contain at least one wrong.

Let $(x_n)$ define by $x_1\in \left(0;\dfrac{1}{2}\right)$ and $x_{n+1}=3x_n^2-2nx_n^3$ for all $n\ge 1$. a) Prove that $(x_n)$ convergence to $0$. b) For each $n\ge 1$, let $y_n=x_1+2x_2+\cdots+n x_n$. Prove that $(y_n)$ has a limit.

Let $ s$ be the limiting sum of the geometric series $ 4\minus{} \frac83 \plus{} \frac{16}{9} \minus{} \dots$, as the number of terms increases without bound. Then $ s$ equals: $ \textbf{(A)}\ \text{a number between 0 and 1} \qquad \textbf{(B)}\ 2.4 \qquad \textbf{(C)}\ 2.5 \qquad \textbf{(D)}\ 3.6 \qquad \textbf{(E)}\ 12$

Let $d(n)$ be the number of positive divisors of a positive integer $n$. Let $\mathbb{N}$ be the set of all positive integers. Say that a function $F$ from $\mathbb{N}$ to $\mathbb{N}$ is [i]divisor-respecting[/i] if $d(F(mn)) = d(F(m)) d(F(n))$ for all positive integers $m$ and $n$, and $d(F(n)) \le d(n)$ for all positive integers $n$. Find all divisor-respecting functions. Justify your answer.

Consider the sequence $a_1, a_2, \dots$ of positive integers such that $a_1=2$ and $a_{n+1}=a_n^4+a_n^3-3a_n^2-a_n+2$, for all $n\geqslant 1$. Prove that there exist infinitely many prime numbers that don't divide any term of the sequence. [i]Proposed by Pavel Ciurea[/i]

Kayla draws three triangles on a sheet of paper. What is the maximum possible number of regions, including the exterior region, that the paper can be divided into by the sides of the triangles? [i]Proposed by Michael Tang[/i]

If $x,y,z\in\mathbb N$ and $xy=z^2+1$ prove that there exists integers $a,b,c,d$ such that $x=a^2+b^2$, $y=c^2+d^2$, $z=ac+bd$.

The graph shows velocity as a function of time for a car. What was the acceleration at time = $90$ seconds? [asy] size(275); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); draw((0,0)--(6,0)); draw((0,1)--(6,1)); draw((0,2)--(6,2)); draw((0,3)--(6,3)); draw((0,4)--(6,4)); draw((0,0)--(0,4)); draw((1,0)--(1,4)); draw((2,0)--(2,4)); draw((3,0)--(3,4)); draw((4,0)--(4,4)); draw((5,0)--(5,4)); draw((6,0)--(6,4)); label("$0$",(0,0),S); label("$30$",(1,0),S); label("$60$",(2,0),S); label("$90$",(3,0),S); label("$120$",(4,0),S); label("$150$",(5,0),S); label("$180$",(6,0),S); label("$0$",(0,0),W); label("$10$",(0,1),W); label("$20$",(0,2),W); label("$30$",(0,3),W); label("$40$",(0,4),W); draw((0,0.6)--(0.1,0.55)--(0.8,0.55)--(1.2,0.65)--(1.9,1)--(2.2,1.2)--(3,2)--(4,3)--(4.45,3.4)--(4.5,3.5)--(4.75,3.7)--(5,3.7)--(5.5,3.45)--(6,3)); label("Time (s)", (7.5,0),S); label("Velocity (m/s)",(-1,3),W); [/asy] $ \textbf{(A)}\ 0.2\text{ m/s}^2\qquad\textbf{(B)}\ 0.33\text{ m/s}^2\qquad\textbf{(C)}\ 1.0\text{ m/s}^2\qquad\textbf{(D)}\ 9.8\text{ m/s}^2\qquad\textbf{(E)}\ 30\text{ m/s}^2 $

Let $ABCD$ be a cyclic quadrilaterla and let $E$ be the point of intersection of its diagonals $AC$ and $BD$. Suppose $AD$ and $BC$ meet in $F$. Let the midpoints of $AB$ and $CD$ be $G$ and $H$ respectively. If $\Gamma $ is the circumcircle of triangle $EGH$, prove that $FE$ is tangent to $\Gamma $.

David and Evan are playing a game. Evan thinks of a positive integer $N$ between 1 and 59, inclusive, and David tries to guess it. Each time David makes a guess, Evan will tell him whether the guess is greater than, equal to, or less than $N$. David wants to devise a strategy that will guarantee that he knows $N$ in five guesses. In David's strategy, each guess will be determined only by Evan's responses to any previous guesses (the first guess will always be the same), and David will only guess a number which satisfies each of Evan's responses. How many such strategies are there? Note: David need not guess $N$ within his five guesses; he just needs to know what $N$ is after five guesses.

Given is a positive integer $n$ divisible by $3$ and such that $2n-1$ is a prime. Does there exist a positive integer $x>n$ such that $$nx^{n+1}+(2n+1)x^n-3(n-1)x^{n-1}-x-3$$ is a product of the first few odd primes?

For each positive integer $n$, prove that there are two consecutive positive integers each of which is the product of $n$ positive integers greater than $1$.

Fill in each blank unshaded cell with a positive integer less than 100, such that every consecutive group of unshaded cells within a row or column is an arithmetic sequence. You do not need to prove that your answer is the only one possible; you merely need to find an answer that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.) [asy] size(9cm); for (int x=0; x<=11; ++x) draw((x, 0) -- (x, 5), linewidth(.5pt)); for (int y=0; y<=5; ++y) draw((0, y) -- (11, y), linewidth(.5pt)); filldraw((0,4)--(0,3)--(2,3)--(2,4)--cycle, gray, gray); filldraw((1,1)--(1,2)--(3,2)--(3,1)--cycle, gray, gray); filldraw((4,1)--(4,4)--(5,4)--(5,1)--cycle, gray, gray); filldraw((7,0)--(7,3)--(6,3)--(6,0)--cycle, gray, gray); filldraw((7,4)--(7,5)--(6,5)--(6,4)--cycle, gray, gray); filldraw((8,1)--(8,2)--(10,2)--(10,1)--cycle, gray, gray); filldraw((9,4)--(9,3)--(11,3)--(11,4)--cycle, gray, gray); draw((0,0)--(11,0)--(11,5)--(0,5)--cycle); void foo(int x, int y, string n) { label(n, (x+0.5, y+0.5)); } foo(1, 2, "10"); foo(4, 0, "31"); foo(5, 0, "26"); foo(10, 0, "59"); foo(0, 4, "3"); foo(7, 4, "59"); [/asy]

And it came to pass that Jeb owned over a thousand chickens. So Jeb counted his chickens. And Jeb reported the count to Hannah. And Hannah reported the count to Joshua. And Joshua reported the count to Caleb. And Caleb reported the count to Rachel. But as fate would have it, Jeb had over-counted his chickens by nine chickens. Then Hannah interchanged the last two digits of the count before reporting it to Joshua. And Joshua interchanged the first and the third digits of the number reported to him before reporting it to Caleb. Then Caleb doubled the number reported to him before reporting it to Rachel. Now it so happens that the count reported to Rachel was the correct number of chickens that Jeb owned. How many chickens was that?

Find the largest number $\lambda$ such that $a^2+b^2+c^2+d^2 \geq ab + \lambda bc + cd$ for all real numbers $a,b,c,d$

Let $a,b \in R^+$ with $ab = 1$, prove that $$\frac{1}{a^3 + 3b}+\frac{1}{b^3 + 3a}\le \frac12.$$

A [i]lattice point[/i] in the Cartesian plane is a point whose coordinates are both integers. A [i]lattice polygon[/i] is a polygon all of whose vertices are lattice points. Let $\Gamma$ be a convex lattice polygon. Prove that $\Gamma$ is contained in a convex lattice polygon $\Omega$ such that the vertices of $\Gamma$ all lie on the boundary of $\Omega$, and exactly one vertex of $\Omega$ is not a vertex of $\Gamma$.

If $F(n)$ is a function such that $F(1)=F(2)=F(3)=1$, and such that $F(n+1)=\dfrac{F(n)\cdot F(n-1)+1}{F(n-2)}$ for $n\ge 3$, then $F(6)$ is equal to $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }7\qquad\textbf{(D) }11\qquad \textbf{(E) }26$

The sum of three numbers is $96$. The first number is $6$ times the third number, and the third number is $40$ less than the second number. What is the absolute value of the difference between the first and second numbers? $\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 3 \qquad \textbf{(D) } 4 \qquad \textbf{(E) } 5$

Let $ABC$ be an acute triangle and $H$ its orthocenter. Let $D$ be the intersection of the altitude from $A$ to $BC$. Let $M$ and $N$ be the midpoints of $BH$ and $CH$, respectively. Let the lines $DM$ and $DN$ intersect $AB$ and $AC$ at points $X$ and $Y$ respectively. If $P$ is the intersection of $XY$ with $BH$ and $Q$ the intersection of $XY$ with $CH$, show that $H, P, D, Q$ lie on a circumference.

The coordinates of $ A,B$ and $ C$ are $ (5,5),(2,1)$ and $ (0,k)$ respectively. The value of $ k$ that makes $ \overline{AC}\plus{}\overline{BC}$ as small as possible is: $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 4\frac{1}{2} \qquad\textbf{(C)}\ 3\frac{6}{7} \qquad\textbf{(D)}\ 4\frac{5}{6} \qquad\textbf{(E)}\ 2\frac{1}{7}$

Fix circle with center $O$, diameter $AB$ and a point $C$ on it, different from $A, B$. Let a point $D$, different from $A, B$, vary on the arc $AB$ not containing $C$. Let $E$ lie on $CD$ such that $BE \perp CD$. Prove that $CE \cdot ED$ is maximal exactly when $BOED$ is cyclic.

Each of the four positive integers $N,N +1,N +2,N +3$ has exactly six positive divisors. There are exactly$ 20$ dierent positive numbers which are exact divisors of at least one of the numbers. One of these is $27$. Find all possible values of $N$.(Both $1$ and $m$ are counted as divisors of the number $m$.)

Andy, Bella, and Chris are playing in a trivia contest. Andy has $21,200$ points, Bella has $23,600$ points, and Chris has $11,200$ points. They have reached the final round, which works as follows: [list] [*] they are given a hint as to what the only question of the round will be about; [*] then, each of them must bet some amount of their points---this bet must be a nonnegative integer (a player does not know any of the other players' bets, and this bet cannot be changed later on); [*] then, they will be shown the question, where they will have $30$ seconds to individually submit a response (a player does not know any of the other players' answers); [*] finally, once time runs out, their responses and bets are revealed---if a player's response is correct, then the number of points they bet will be added to their score, otherwise, it will be subtracted from their score, and whoever ends up having the most points wins the contest (if there is a tie for the win, then the winner is randomly decided). [/list] Suppose that the contestants are currently deciding their bets based on the hint that the question will be about history. Bella knows that she will likely get the question wrong, but she also knows that Andy, who dislikes history, will definitely get it wrong. Knowing this, Bella wagers an amount that will guarantee her a win. Find the maximum number of points Bella could have ended up with.

Let n be a fixed prime number >3. A triangle is said to be admissible if the measure of each of its angles is of the form $\frac{m\cdot 180^{\circ}}{n}$ for some positive integer m. We are given one admissible triangle. Every minute we cut one of the triangles we already have into two admissible triangles so that no two of the triangles we have after cutting are similar. After some time, it turns out that no more cuttings are possible. Prove that at this moment, the triangles we have contain all possible admissible triangles (we do not distinguish between triangles which have same sets of angles, i.e. similar triangles).