The taxi fare in Gotham City is $\$2.40$ for the first $\frac12$ mile and additional mileage charged at the rate $\$ 0.20$ for each additional 0.1 mile. You plan to give the driver a $\$2$ tip. How many miles can you ride for $\$10?$ $ \textbf{(A)}3.0\qquad\textbf{(B)}3.25\qquad\textbf{(C)}3.3\qquad\textbf{(D)}3.5\qquad\textbf{(E)}3.75 $

There are some balls, on each of which a positive integer not exceeding $14$ (and not necessarily distinct) is written, and the sum of the numbers on all balls is $S$. Find the greatest possible value of $S$ such that, regardless of what the integers are, one can ensure that the balls can be divided into two piles so that the sum of the numbers on the balls in each pile does not exceed $129$.

Prove that among any $42$ numbers from the interval $[1,10^6]$, you can choose four numbers so that for any permutation $(a, b, c, d)$ of these numbers, the inequality $$25 (ab + cd) (ad + bc) \ge 16 (ac + bd)^ 2$$ holds.

Compute $\frac{664.02}{9.3}$.

Show that there are $1977$ non-similar triangles such that the angles $A, B, C$ satisfy $\frac{\sin A + \sin B + \sin C}{\cos A +\cos B + \cos C} = \frac{12}{7}$ and $\sin A \sin B \sin C = \frac{12}{25}$.

Given a non- isosceles triangle $ABC$. Let the points $B'$ and $C'$ be symmetric to the points $B$ and $C$ wrt $AC$ and $AB$ respectively. If the circles circumscribed around triangles $ABB'$ and $ACC'$ intersect at point $P$, prove that the line $AP$ passes through the center of the circumcircle of the triangle $ABC$.

For given integer $n \geq 3$, set $S =\{p_1, p_2, \cdots, p_m\}$ consists of permutations $p_i$ of $(1, 2, \cdots, n)$. Suppose that among every three distinct numbers in $\{1, 2, \cdots, n\}$, one of these number does not lie in between the other two numbers in every permutations $p_i$ ($1 \leq i \leq m$). (For example, in the permutation $(1, 3, 2, 4)$, $3$ lies in between $1$ and $4$, and $4$ does not lie in between $1$ and $2$.) Determine the maximum value of $m$.

For any integer $n$ greater than $1$, the number of prime numbers greater than $n!+1$ and less than $n!+n$ is: $\textbf{(A) }0\qquad \textbf{(B) }1\qquad \textbf{(C) }\dfrac n2\text{ for }n\text{ even,}\,\dfrac{n+1}2\text{ for }n\text{ odd}$ $\textbf{(D) }n-1\qquad \textbf{(E) }n$

Determine all three-digit numbers $N$ such that the average of the six numbers that can be formed by permutation of its three digits is equal to $N$.

Find the digits left and right of the decimal point in the decimal form of the number \[ (\sqrt{2} + \sqrt{3})^{1980}. \]

A polyhedron $P$ is given in space. Find whether there exist three edges in $P$ which can be the sides of a triangle. Justify your answer! [i]Barbu Berceanu[/i]

Let $ABC$ be a triangle with $BA=BC$ and $\angle ABC=90^{\circ}$. Let $D$ and $E$ be the midpoints of $CA$ and $BA$ respectively. The point $F$ is inside of $\triangle ABC$ such that $\triangle DEF$ is equilateral. Let $X=BF\cap AC$ and $Y=AF\cap DB$. Prove that $DX=YD$.

Find the smallest number with exactly 28 divisors.

Let $ABC$ be a right triangle with $AB = BC = 2$. Let $ACD$ be a right triangle with angle $\angle DAC = 30$ degrees and $\angle DCA = 60$ degrees. Given that $ABC$ and $ACD$ do not overlap, what is the area of triangle $BCD$?

A positive integer $n$ is given. A cube $3\times3\times3$ is built from $26$ white and $1$ black cubes $1\times1\times1$ such that the black cube is in the center of $3\times3\times3$-cube. A cube $3n\times 3n\times 3n$ is formed by $n^3$ such $3\times3\times3$-cubes. What is the smallest number of white cubes which should be colored in red in such a way that every white cube will have at least one common vertex with a red one. [hide=thanks] Thanks to the user Vlados021 for translating the problem.[/hide]

For $ n \equal{} 1,\ 2,\ 3,\ \cdots$, let $ (p_n,\ q_n)\ (p_n > 0,\ q_n > 0)$ be the point of intersection of $ y \equal{} \ln (nx)$ and $ \left(x \minus{} \frac {1}{n}\right)^2 \plus{} y^2 \equal{} 1$. (1) Show that $ 1 \minus{} q_n^2\leq \frac {(e \minus{} 1)^2}{n^2}$ to find $ \lim_{n\to\infty} q_n$. (2) Find $ \lim_{n\to\infty} n\int_{\frac {1}{n}}^{p_n} \ln (nx)\ dx$.

Let $m,\ n$ be non negative integers. Calculate \[\sum_{k=0}^{n}(-1)^{k}\frac{n+m+1}{k+m+1}\ nC_{k}. \] where $_{i}C_{j}$ is a binomial coefficient which means $\frac{i\cdot (i-1)\cdots(i-j+1)}{j\cdot (j-1)\cdots 2\cdot 1}$.

For a positive integer $n$, denote by $g(n)$ the number of strictly ascending triples chosen from the set $\{1, 2, ..., n\}$. Find the least positive integer $n$ such that the following holds:[i] The number $g(n)$ can be written as the product of three different prime numbers which are (not necessarily consecutive) members in an arithmetic progression with common difference $336$.[/i]

[b]p1.[/b] Given an equilateral triangle $ABC$ with area $16\sqrt3$, and an interior point $P$ with distances from vertices $|AP| = 4$ and $|BP| = 6$. (a) Find the length of each side. (b) Find the distance from point $P$ to the side $AB$. (c) Find the distance $|PC|$. [b]p2.[/b] Several players play the following game. They form a circle and each in turn tosses a fair coin. If the coin comes up heads, that player drops out of the game and the circle becomes smaller, if it comes up tails that player remains in the game until his or her next turn to toss. When only one player is left, he or she is the winner. For convenience let us name them $A$ (who tosses first), $B$ (second), $C$ (third, if there is a third), etc. (a) If there are only two players, what is the probability that $A$ (the first) wins? (b) If there are exactly $3$ players, what is the probability that $A$ (the first) wins? (c) If there are exactly $3$ players, what is the probability that $B$ (the second) wins? [b]p3.[/b] A circular castle of radius $r$ is surrounded by a circular moat of width $m$ ($m$ is the shortest distance from each point of the castle wall to its nearest point on shore outside the moat). Life guards are to be placed around the outer edge of the moat, so that at least one life guard can see anyone swimming in the moat. (a) If the radius $r$ is $140$ feet and there are only $3$ life guards available, what is the minimum possible width of moat they can watch? (b) Find the minimum number of life guards needed as a function of $r$ and $m$. [img]https://cdn.artofproblemsolving.com/attachments/a/8/d7ff0e1227f9dcf7e49fe770f7dae928581943.png[/img] [b]p4.[/b] (a)Find all linear (first degree or less) polynomials $f(x)$ with the property that $f(g(x)) = g(f(x))$ for all linear polynomials $g(x)$. (b) Prove your answer to part (a). (c) Find all polynomials $f(x)$ with the property that $f(g(x)) = g(f(x))$ for all polynomials $g(x)$. (d) Prove your answer to part (c). [b]p5.[/b] A non-empty set $B$ of integers has the following two properties: i. each number $x$ in the set can be written as a sum $x = y+ z$ for some $y$ and $z$ in the set $B$. (Warning: $y$ and $z$ may or may not be distinct for a given $x$.) ii. the number $0$ can not be written as a sum $0 = y + z$ for any $y$ and $z$ in the set $B$. (a) Find such a set $B$ with exactly $6$ elements. (b) Find such a set $B$ with exactly $6$ elements, and such that the sum of all the $6$ elements is $1988$. (c) What is the smallest possible size of such a set $B$ ? (d) Prove your answer to part (c). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

One can define the greatest common divisor of two positive rational numbers as follows: for $a$, $b$, $c$, and $d$ positive integers with $\gcd(a,b)=\gcd(c,d)=1$, write \[\gcd\left(\dfrac ab,\dfrac cd\right) = \dfrac{\gcd(ad,bc)}{bd}.\] For all positive integers $K$, let $f(K)$ denote the number of ordered pairs of positive rational numbers $(m,n)$ with $m<1$ and $n<1$ such that \[\gcd(m,n)=\dfrac{1}{K}.\] What is $f(2017)-f(2016)$?

Tanya has cut out a triangle from checkered paper as shown in the picture. The lines of the grid have faded. Can Tanya restore them without any instruments only folding the triangle (she remembers the triangle sidelengths)? (T. Kazitsyna)

Prove that on a coordinate plane it is impossible to draw a closed broken line such that [list][*] coordinates of each vertex are rational, [*] the length of its every edge is equal to $1$, [*] the line has an odd number of vertices.[/list]

Let $A_1,A_2,...,A_n$ be $n \ge 2$ distinct points on a circle. Find the number of colorings of these points with $p \ge 2$ colors such that every two adjacent points receive different colors

Let $P$ and $Q$ be points inside a triangle $ABC$ such that $\angle PAC = \angle QAB$ and $\angle PBC = \angle QBA$. Let $D$ and $E$ be the feet of the perpendiculars from $P$ to the lines $BC$ and $AC$, and $F$ be the foot of perpendicular from $Q$ to the line $AB$. Let $M$ be intersection of the lines $DE$ and $AB$. Prove that $MP \perp CF$

Let $ f: (1,\infty)\to\mathbb{R}$ be a differentiable function such that \[ f'(x)\equal{}\frac{x^2\minus{}\left(f(x)\right)^2}{x^2\left(\left(f(x)\right)^2\plus{}1\right)}\quad\text{for all }x>1.\] Prove that $ \displaystyle\lim_{x\to\infty}f(x)\equal{}\infty.$