For any positive integer $n>1$, let $p(n)$ be the greatest prime divisor of $n$. Prove that there are infinitely many positive integers $n$ with \[p(n)<p(n+1)<p(n+2).\]

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.

Prove that \[ 1 < \frac{1}{1001} + \frac{1}{1002} + \frac{1}{1003} + \cdots + \frac{1}{3001} < 1 \frac{1}{3}. \]

Given 365 cards, in which distinct numbers are written. We may ask for any three cards, the order of numbers written in them. Is it always possible to find out the order of all 365 cards by 2000 such questions?

Real numbers are written on the squares of an infinite grid. Two figures consisting of finitely many squares are given. They may be translated anywhere on the grid as long as their squares coincide with those of the grid. It is known that wherever the first figure is translated, the sum of numbers it covers is positive. Prove that the second figure can be translated so that the sum of the numbers it covers is also positive.

Find all $f: R\rightarrow R$ such that (i) The set $\{\frac{f(x)}{x}| x\in R-\{0\}\}$ is finite (ii) $f(x-1-f(x)) = f(x)-1-x$ for all $x$

Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$. For example, if $N=749$, Bernardo writes the numbers 10,444 and 3,245, and LeRoy obtains the sum $S=13,689$. For how many choices of $N$ are the two rightmost digits of $S$, in order, the same as those of $2N$? ${ \textbf{(A)}\ 5\qquad\textbf{(B)}\ 10\qquad\textbf{(C)}\ 15\qquad\textbf{(D}}\ 20\qquad\textbf{(E)}\ 25 $

Let $ f$ be an infinitely differentiable real-valued function defined on the real numbers. If $ f(1/n)\equal{}\frac{n^{2}}{n^{2}\plus{}1}, n\equal{}1,2,3,...,$ Compute the values of the derivatives of $ f^{k}(0), k\equal{}0,1,2,3,...$

Two circles are tangent to each other internally at a point $\ T $. Let the chord $\ AB $ of the larger circle be tangent to the smaller circle at a point $\ P $. Prove that the line $\ TP $ bisects $\ \angle ATB $.

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]

In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$. We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle. The following property is satisfied: "for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element" Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends. ([i]Serbia[/i])

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

Does there exist a solution $(x,y,z,u,v)$ in integers greater than $1998$ to the equation $x^{2}+y^{2}+z^{2}+u^{2}+v^{2}=xyzuv-65$?

For each positive integer $n$, let $S(n)$ denote the sum of the digits of $n.$ For how many values of $n$ is $n + S(n) + S(S(n)) = 2007?$ $\mathrm{(A)}\ 1 \qquad \mathrm{(B)}\ 2 \qquad \mathrm{(C)}\ 3 \qquad \mathrm{(D)}\ 4 \qquad \mathrm{(E)}\ 5$

A group of $ 100$ students numbered $ 1$ through $ 100$ are playing the following game. The judge writes the numbers $ 1$, $ 2$, $ \ldots$, $ 100$ on $ 100$ cards, places them on the table in an arbitrary order and turns them over. The students $ 1$ to $ 100$ enter the room one by one, and each of them flips $ 50$ of the cards. If among the cards flipped by student $ j$ there is card $ j$, he gains one point. The flipped cards are then turned over again. The students cannot communicate during the game nor can they see the cards flipped by other students. The group wins the game if each student gains a point. Is there a strategy giving the group more than $ 1$ percent of chance to win?

Find all triples $(x, y, z)$ such that $x, y, z, x - y, y - z, x - z$ are all prime positive integers.

Let $\{a_n\}$ be a sequence of nondecreasing positive integers such that $\textstyle\frac{r}{a_r} = k+1$ for some positive integers $k$ and $r$. Prove that there exists a positive integer $s$ such that $\textstyle\frac{s}{a_s} = k$.

Prove that there are infinitely many positive integers $ n$ such that $ n(n\plus{}1)$ can be represented as a sum of two positive squares in at least two different ways. (Here $ a^{2}\plus{}b^{2}$ and $ b^{2}\plus{}a^{2}$ are considered as the same representation.)

Let $f(x) = |x - p| + |x - 15| + |x - p - 15|$, where $0 < p < 15$. Determine the minimum value taken by $f(x)$ for $x$ in the interval $p \le x \le 15$.

Farmer Tim is lost in the densely-forested Cartesian plane. Starting from the origin he walks a sinusoidal path in search of home; that is, after $t$ minutes he is at position $(t,\sin t)$. Five minutes after he sets out, Alex enters the forest at the origin and sets out in search of Tim. He walks in such a way that after he has been in the forest for $m$ minutes, his position is $(m,\cos t)$. What is the greatest distance between Alex and Farmer Tim while they are walking in these paths?

Find the sum of all positive integers $n$ such that \[ \frac{2n+1}{n(n-1)} \] has a terminating decimal representation. [i]Proposed by Evan Chen[/i]

On a chessboard ($8\times 8$ squares with sides of length $1$) two diagonally opposite corner squares are taken away. Can the board now be covered with nonoverlapping rectangles with sides of lengths $1$ and $2$?

Prove that for positive $a,b,c,d$ \[\frac{a+c}{a+b}+\frac{b+d}{b+c}+\frac{c+a}{c+d}+\frac{d+b}{d+a}\ge 4\]

Determine all polynomials $p(x)$ with real coefficients such that $p((x+1)^3)=(p(x)+1)^3$ and $p(0)=0$.

A finite set of points $P$ in the plane has the following property: Every line through two points in $P$ contains at least one more point belonging to $P$. Prove that all points in $P$ lie on a straight line. [hide="Remark."]This may be a well known theorem called "Sylvester Gallai", but I didn't find this problem (I mean, exactly this one) using search function. So please discuss about the problem here, in this topic. Thanks :) [/hide]