Kevin runs uphill at a speed that is $4$ meters per second slower than his speed when he runs downhill. Kevin takes a total of $80$ seconds to run up and down a hill on one path. Given that the path is $300$ meters long (he travels $600$ meters total), find how long Kevin takes to run up the hill in seconds.

Let: $ C_1, C_2, C_3 $ three circles , intersecting in pairs, such that the secant line common to two of them (any) passes through the center of the third. Prove that the three lines thus defined are concurrent.

A clue “$k$ digits, sum is $n$” gives a number k and the sum of $k$ distinct, nonzero digits. An answer for that clue consists of $k$ digits with sum $n$. For example, the clue “Three digits, sum is $23$” has only one answer: $6,8,9$. The clue “Three digits, sum is $8$” has two answers: $1,3,4$ and $1,2,5$. If the clue “Four digits, sum is $n$” has the largest number of answers for any four-digit clue, then what is the value of $n$? How many answers does this clue have? Explain why no other four-digit clue can have more answers.

Consider the numbers $1$ through $6$ numbered on the coins below. Ella takes a coin from each of the three columns. Bella takes a coin from each of the remaining two columns. Cassandra takes the remaining coin. In how many ways could they have taken out the six coins? [asy] size(100); draw(Circle((0,0),0.45)); label("$1$",(0,0)); draw(Circle((0,1),0.45)); label("$2$",(0,1)); draw(Circle((0,2),0.45)); label("$3$",(0,2)); draw(Circle((1,0),0.45)); label("$5$",(1,0)); draw(Circle((1,1),0.45)); label("$4$",(1,1)); draw(Circle((2,0),0.45)); label("$6$",(2,0)); [/asy] $\textbf{(A) }9\qquad\textbf{(B) }12\qquad\textbf{(C) }15\qquad\textbf{(D) }18\qquad\textbf{(E) }20$

One hundred tennis players took part in a tournament where they played with each other exactly one game, with no draws. At the end of the tournament a table (ranking) is formed depending on the number of victories. It is known that one tennis player finished the tournament on $k$-th place and is the only one with that number of victories, and he has beaten every tennis player who is placed above him in the table and lost to anyone ranked weaker than him on the table. Find the smallest value of $k$.

Prove that \[\sum_{k=0}^n\frac{2^{2^k}\cdot 2^{k+1}}{2^{2^k}+3^{2^k}}<4\] holds for all positive integers $n$. [i]Submitted by Béla Kovács, Szatmárnémeti[/i]

In a convex quadrilateral $ABCD$ we are given that $\angle CBD = 10^o$, $\angle CAD = 20^o$, $\angle ABD = 40^o$, $\angle BAC = 50^o$. Determine the angles $\angle BCD$ and $\angle ADC$.

The sides of a triangle are three consecutive integers and its inradius is $4$. Find the circumradius.

In a country there are $n\geq 2$ cities. Any two cities has exactly one two-way airway. The government wants to license several airlines to take charge of these airways with such following conditions: i) Every airway can be licensed to exactly one airline. ii) By choosing one arbitrary airline, we can move from a city to any other cities, using only flights from this airline. What is the maximum number of airlines that the government can license to satisfy all of these conditions?

Let $a, b, c \in \mathbb{R}$ with $abc = 1$. Prove that \[a^{2}+b^{2}+c^{2}+{1\over a^{2}}+{1\over b^{2}}+{1\over c^{2}}+2\left(a+b+c+{1\over a}+{1\over b}+{1\over c}\right) \geq 6+2\left({b\over a}+{c\over b}+{a\over c}+{c\over a}+{c\over b}+{b\over c}\right)\]

For any positive integers $n>m$ prove the following inequality: $$[m,n]+[m+1,n+1]\geq 2m\sqrt{n}$$ As usual, [x,y] denotes the least common multiply of $x,y$ [I]Proposed by A. Golovanov[/i]

For a positive reals $ x_{1},...,x_{n} $ prove inequlity: $ \frac{1}{x_{1}+1}+...+\frac{1}{x_{n}+1}\le \frac{n}{1+\frac{n}{\frac{1}{x_{1}}+...+\frac{1}{x_{n}}}}$

There are $212$ points inside or on a given unit circle. Prove that there are at least $2001$ pairs of points having distances at most $1$.

Determine all triples $(x,y,z)$ of positive rational numbers with $x\le y\le z$ such that $x+y+z,\frac1x+\frac1y+\frac1z$, and xyz are natural numbers.

A zig-zag in the plane consists of two parallel half-lines connected by a line segment. Find $z_n$, the maximum number of regions into which $n$ zig-zags can divide the plane. For example, $z_1=2,z_2=12$(see the diagram). Of these $z_n$ regions how many are bounded? [The zig-zags can be as narrow as you please.] Express your answers as polynomials in $n$ of degree not exceeding $2$. [asy] draw((30,0)--(-70,0), Arrow); draw((30,0)--(-20,-40)); draw((-20,-40)--(80,-40), Arrow); draw((0,-60)--(-40,20), dashed, Arrow); draw((0,-60)--(0,15), dashed); draw((0,15)--(40,-65),dashed, Arrow); [/asy]

Verify that, for each $r \ge 1$, there are infinitely many primes $p$ with $p \equiv 1 \; \pmod{2^r}$.

Find $ \lim_{x\to\infty} \int_{e^{\minus{}x}}^1 \left(\ln \frac{1}{t}\right)^ n\ dt\ (x\geq 0,\ n\equal{}1,\ 2,\ \cdots)$.

Let $m$ and $n$ be natural numbers such that \[A=\frac{(m+3)^{n}+1}{3m}\] is an integer. Prove that $A$ is odd.

A number of unit discs are given inside a square of side $100$ such that (i) no two of the discs have a common interior point, and (ii) every segment of length $10$, lying entirely within the square, meets at least one disc. Prove that there are at least $400$ discs in the square.

A castle has a number of halls and $n$ doors. Every door leads into another hall or outside. Every hall has at least two doors. A knight enters the castle. In any hall, he can choose any door for exit except the one he just used to enter that hall. Find a strategy allowing the knight to get outside after visiting no more than $2n$ halls (a hall is counted each time it is entered).

Prove that for any odd prime number $ p,$ the number of positive integer $ n$ satisfying $ p|n! \plus{} 1$ is less than or equal to $ cp^\frac{2}{3}.$ where $ c$ is a constant independent of $ p.$

Prove that total number of ones which is showed in all nonrestricted partitions of natural number $n$ is equal to sum of numbers of distinct elements in that partitions.

There is an integer $n > 1$. There are $n^2$ stations on a slope of a mountain, all at different altitudes. Each of two cable car companies, $A$ and $B$, operates $k$ cable cars; each cable car provides a transfer from one of the stations to a higher one (with no intermediate stops). The $k$ cable cars of $A$ have $k$ different starting points and $k$ different finishing points, and a cable car which starts higher also finishes higher. The same conditions hold for $B$. We say that two stations are linked by a company if one can start from the lower station and reach the higher one by using one or more cars of that company (no other movements between stations are allowed). Determine the smallest positive integer $k$ for which one can guarantee that there are two stations that are linked by both companies. [i]Proposed by Tejaswi Navilarekallu, India[/i]

Find all positive integers $n$ such that $4^n+6^n+9^n$ is a square. [i]David Yang, Alex Zhu.[/i]

The numbers $1,2,...,2n-1,2n$ are divided into two disjoint sets, $a_1 < a_2 < ... < a_n$ and $b_1 > b_2 > ... > b_n$. Prove that $$|a_1 - b_1| + |a_2 - b_2| + ... + |a_n - b_n| = n^2.$$