A faulty car odometer proceeds from digit 3 to digit 5, always skipping the digit 4, regardless of position. If the odometer now reads 002005, how many miles has the car actually traveled? $ \textbf{(A)}\ 1404 \qquad \textbf{(B)}\ 1462 \qquad \textbf{(C)}\ 1604 \qquad \textbf{(D)}\ 1605 \qquad \textbf{(E)}\ 1804$

When the natural numbers $P$ and $P'$, with $P>P'$, are divided by the natural number $D$, the remainders are $R$ and $R'$, respectively. When $PP'$ and $RR'$ are divided by $D$, the remainders are $r$ and $r'$, respectively. Then: $\textbf{(A) }r>r'\text{ always}\qquad \textbf{(B) }r<r'\text{ always}\qquad$ $\textbf{(C) }r>r'\text{ sometimes, and }r<r'\text{ sometimes}$ $\textbf{(D) }r>r'\text{ sometimes, and }r=r'\text{ sometimes}$ $\textbf{(E) }r=r'\text{ always}$

It is given $2015$ numbers such that every one of them when gets replaced with sum of the rest, we get same $2015$ same numbers. Prove that product of all numbers is $0$

Consider three sides of an $n \times n \times n$ cube that meet at one of the corners of the cube. For which $n$ is it possible to use this completely and without overlapping to cover strips of paper of size $3 \times 1$? The paper strips can also do this glued over the edges between these cube faces.

Which of the following can be used to distinguish a solid ball from a hollow sphere of the same radius and mass? $\textbf{(A)}$ Measurements of the orbit of a test mass around the object. $\textbf{(B)}$ Measurements of the time it takes the object to roll down an inclined plane. $\textbf{(C)}$ Measurements of the tidal forces applied by the object to a liquid body. $\textbf{(D)}$ Measurements of the behavior of the object as it oats in water. $\textbf{(E)}$ Measurements of the force applied to the object by a uniform gravitational field.

Solve the equations $$ \frac{dy}{dx}=z(y+z)^n, \;\; \; \frac{dz}{dx} = y(y+z)^n,$$ given the initial conditions $y=1$ and $z=0$ when $x=0.$

Let $P_1, P_2, \dots , P_n$ be distinct points of the plane, $n \geq 2$. Prove that \[ \max_{1\leq i<j\leq n} P_iP_j > \frac{\sqrt 3}{2}(\sqrt n -1) \min_{1\leq i<j\leq n} P_iP_j \]

Let $p$ be a prime number of the form $4k+3$. Prove that there are no integers $w,x,y,z$ whose product is not divisible by $p$, such that: \[ w^{2p}+x^{2p}+y^{2p}=z^{2p}. \]

If $x$ and $\log_{10} x$ are real numbers and $\log_{10} x<0$, then: $\textbf{(A)}\ x<0 \qquad \textbf{(B)}\ -1<x<1 \qquad \textbf{(C)}\ 0<x\le 1 $ $ \textbf{(D)}\ -1<x<0 \qquad \textbf{(E)}\ 0<x<1$

Are there integers $x,y$ and $z$ which satisfy the equation $$z^2=(x+1)(y^2-1)+n$$ when (a) $n=2006$ (b) $n=2007$?

In a group of interpreters each one speaks one of several foreign languages, 24 of them speak Japanese, 24 Malaysian, 24 Farsi. Prove that it is possible to select a subgroup in which exactly 12 interpreters speak Japanese, exactly 12 speak Malaysian and exactly 12 speak Farsi.

What is the square root of the sum of the first 2006 positive odd integers?

A positive integer $m$ is called a [i]beautiful [/i] integer if that there exists a positive integer $n$ such that $m = n^2+ n + 1$. Prove that there are infinitely many [i]beautiful [/i] integers with square factors, and the square factors of different beautiful integers are relative prime.

A billiard table. (see picture) A white ball is on $p_1$ and a red ball is on $p_2$. The white ball is shot towards the red ball as shown on the pic, hitting 3 sides first. Find the minimal distance the ball must travel. [img]http://www.mathlinks.ro/Forum/album_pic.php?pic_id=280[/img]

Let $a_1, a_2, \ldots , a_{11}$ be 11 pairwise distinct positive integer with sum less than 2007. Let S be the sequence of $1,2, \ldots ,2007$. Define an [b]operation[/b] to be 22 consecutive applications of the following steps on the sequence $S$: on $i$-th step, choose a number from the sequense $S$ at random, say $x$. If $1 \leq i \leq 11$, replace $x$ with $x+a_i$ ; if $12 \leq i \leq 22$, replace $x$ with $x-a_{i-11}$ . If the result of [b]operation[/b] on the sequence $S$ is an odd permutation of $\{1, 2, \ldots , 2007\}$, it is an [b]odd operation[/b]; if the result of [b]operation[/b] on the sequence $S$ is an even permutation of $\{1, 2, \ldots , 2007\}$, it is an [b]even operation[/b]. Which is larger, the number of odd operation or the number of even permutation? And by how many? Here $\{x_1, x_2, \ldots , x_{2007}\}$ is an even permutation of $\{1, 2, \ldots ,2007\}$ if the product $\prod_{i > j} (x_i - x_j)$ is positive, and an odd one otherwise.

Let $ABCD$ be a square and let $S$ be the point of intersection of its diagonals $AC$ and $BD$. Two circles $k,k'$ go through $A,C$ and $B,D$; respectively. Furthermore, $k$ and $k'$ intersect in exactly two different points $P$ and $Q$. Prove that $S$ lies on $PQ$.

In a triangle $ABC$, the circle through $C$ touching $AB$ at $A$ and the circle through $B$ touching $AC$ at $A$ have different radii and meet again at $D$. Let $E$ be the point on the ray $AB$ such that $AB = BE$. The circle through $A$, $D$, $E$ intersect the ray $CA$ again at $F$ . Prove that $AF = AC$.

Given positive integers $a,b,c$ which are pairwise coprime. Let $f(n)$ denotes the number of the non-negative integer solution $(x,y,z)$ to the equation $$ax+by+cz=n.$$ Prove that there exists constants $\alpha, \beta, \gamma \in \mathbb{R}$ such that for any non-negative integer $n$, $$|f(n)- \left( \alpha n^2+ \beta n + \gamma \right) | < \frac{1}{12} \left( a+b+c \right).$$

There is a table with $n$ rows and $18$ columns. Each of its cells contains a $0$ or a $1$. The table satisfies the following properties: [list=1] [*]Every two rows are different. [*]Each row contains exactly $6$ cells that contain $1$. [*]For every three rows, there exists a column so that the intersection of the column with the three rows (the three cells) all contain $0$. [/list] What is the greatest possible value of $n$?

Each of the $15$ coaches ranked the $50$ selected football players on the places from $1$ to $50$. For each football player, the highest and lowest obtained ranks differ by at most $5$. For each of the players, the sum of the ranks he obtained is computed, and the sums are denoted by $S_1\le S_2\le\ldots\le S_{50}$. Find the largest possible value of $S_1$.

Eminem is trying to find the real Slim Shady in a row of $2025$ indistinguishable Slim Shady clones, one of which is the real Slim Shady. Eminem randomly guesses, and if he guesses wrong, a new clone joins the row and all the clones randomly rearrange themselves. He keeps guessing as more identical clones are added, trying to find the real Slim Shady. Find the probability that he will eventually find him within $15$ guesses.

An equilateral triangle of side length $ 10$ is completely filled in by non-overlapping equilateral triangles of side length $ 1$. How many small triangles are required? $ \textbf{(A)}\ 10 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 100 \qquad \textbf{(D)}\ 250 \qquad \textbf{(E)}\ 1000$

Each edge of a complete graph on $30$ vertices is coloured either red or blue. It is allowed to choose a non-monochromatic triangle and change the colour of the two edges of the same colour to make the triangle monochromatic. Prove that by using this operation repeatedly it is possible to make the entire graph monochromatic. (A complete graph is a graph where any two vertices are connected by an edge.)

Solve in natural numbers the equation $x^2-y^2=105$.

Determine the maximal size of the set $S$ such that: i) all elements of $S$ are natural numbers not exceeding $100$; ii) for any two elements $a,b$ in $S$, there exists $c$ in $S$ such that $(a,c)=(b,c)=1$; iii) for any two elements $a,b$ in $S$, there exists $d$ in $S$ such that $(a,d)>1,(b,d)>1$. [i]Yao Jiangang[/i]