Find the number of functions $f:\mathbb{Z}\mapsto\mathbb{Z}$ for which $f(h+k)+f(hk)=f(h)f(k)+1$, for all integers $h$ and $k$.

Two points $K$ and $L$ are chosen inside triangle $ABC$ and a point $D$ is chosen on the side $AB$. Suppose that $B$, $K$, $L$, $C$ are concyclic, $\angle AKD = \angle BCK$ and $\angle ALD = \angle BCL$. Prove that $AK = AL$.

$n(n>3)$ ping-pong players have played a few ping-pong games. The set of players that player A has played with is $A$, The set of players that player B has played with is $B$. for any two players, $A\neq B$. Prove that we can delete a player, so that this character remains.

[b]p1.[/b] Consider a normal $8 \times 8$ chessboard, where each square is labelled with either $1$ or $-1$. Let $a_k$ be the product of the numbers in the $k$th row, and let $b_k$ be the product of the numbers in the $k$th column. Find, with proof, all possible values of $\sum^8_{k=1}(a_kb_k)$. [b]p2.[/b] Let $\overline{AB}$ be a line segment with $AB = 1$, and $P$ be a point on $\overline{AB}$ with $AP = x$, for some $0 < x < 1$. Draw circles $C_1$ and $C_2$ with $\overline{AP}$, $\overline{PB}$ as diameters, respectively. Let $\overline{AB_1}$, $\overline{AB_2}$ be tangent to $C_2$ at $B_1$ and $B_2$, and let $\overline{BA_1}$;$\overline{BA_2}$ be tangent to $C_1$ at $A_1$ and $A_2$. Now $C_3$ is a circle tangent to $C_2$, $\overline{AB_1}$, and $\overline{AB_2}$; $C_4$ is a circle tangent to $C_1$, $\overline{BA_1}$, and $\overline{BA_2}$. (a) Express the radius of $C_3$ as a function of $x$. (b) Prove that $C_3$ and $C_4$ are congruent. [img]https://cdn.artofproblemsolving.com/attachments/c/a/fd28ad91ed0a4893608b92f5ccbd01088ae424.png[/img] [b]p3.[/b] Suppose that the graphs of $y = (x + a)^2$ and $x = (y + a)^2$ are tangent to one another at a point on the line $y = x$. Find all possible values of $a$. [b]p4.[/b] You may assume without proof or justification that the infinite radical expressions $\sqrt{a-\sqrt{a-\sqrt{a-\sqrt{a-...}}}}$ and $\sqrt{a-\sqrt{a+\sqrt{a-\sqrt{a+...}}}}$ represent unique values for $a > 2$. (a) Find a real number $a$ such that $$\sqrt{a-\sqrt{a-\sqrt{a-\sqrt{a+...}}}}= 2017$$ (b) Show that $$\sqrt{2018-\sqrt{2018+\sqrt{2018-\sqrt{2018+...}}}}=\sqrt{2017-\sqrt{2017-\sqrt{2017-\sqrt{2017-...}}}}$$ [b]p5.[/b] (a) Suppose that $m, n$ are positive integers such that $7n^2 - m^2 > 0$. Prove that, in fact, $7n^2 - m^2 \ge 3$. (b) Suppose that $m, n$ are positive integers such that $\frac{m}{n} <\sqrt7$. Prove that, in fact, $\frac{m}{n}+\frac{1}{mn} <\sqrt7$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A set of points in the plane is called disharmonic, if the ratio of any two distances between the points is between $100/101$ and $101/100$, or at least $100$ or at most $1/100$. Is it true that for any distinct points $A_1,A_2,\ldots,A_n$ in the plane it is always possible to find distinct points $A_1',A_2',\ldots, A_n'$ that form a disharmonic set of points, and moreover $A_i, A_j$ and $A_k$ are collinear in this order if and only if $A_i', A_j'$ and $A_k'$ are collinear in this order (for all distinct $1 \le i,j,k\le n$? [i]Submitted by Dömötör Pálvölgyi and Balázs Keszegh, Budapest[/i]

We call an integer $k \geq 1$ having property $P$, if there exists at least one integer $m \geq 1$ which cannot be expressed in the form $m = \varepsilon_1 z_1^k + \varepsilon_2 z_2^k + \cdots + \varepsilon_{2k} z_{2k}^k $ , where $z_i$ are nonnegative integer and $\varepsilon _i = 1$ or $-1$, $i = 1, 2, \ldots, 2k$. Prove that there are infinitely many integers $k$ having the property $P.$

Two coprime positive integers $ a, b $ are given. Integer sequence $ \{ a_n \}, \{b_n \} $ satisties \[ (a+b \sqrt2 )^{2n} = a_n + b_n \sqrt2 \] Find all prime numbers $ p $ such that there exist positive integer $ n \le p $ satisfying $ p | b_n $.

The cost $ C$ of sending a parcel post package weighing $ P$ pounds, $ P$ and integer, is $ 10$ cents for the first pound and $ 3$ cents for each additional pound. The formula for the cost is: $ \textbf{(A)}\ C \equal{} 10 \plus{} 3P \qquad\textbf{(B)}\ C \equal{} 10P \plus{} 3 \qquad\textbf{(C)}\ C \equal{} 10 \plus{} 3(P \minus{} 1)$ $ \textbf{(D)}\ C \equal{} 9 \plus{} 3P \qquad\textbf{(E)}\ C \equal{} 10P \minus{} 7$

Prove that \[ab+bc+ca\ge 2(a+b+c)\] where $a,b,c$ are positive reals such that $a+b+c+2=abc$.

If $a,b,c,x$ are real numbers such that $abc \not= 0$ and \[ \frac{xb + (1-x)c}{a} = \frac{xc + (1-x)a}{b} = \frac{xa + (1-x) b }{c}, \] then prove that $a = b = c$.

Let $n>1$ be a natural number. Find the real values of the parameter $a$, for which the equation $\sqrt[n]{1+x}+\sqrt[n]{1-x}=a$ has a single real root.

Let $ABC$ be an equilateral triangle with $AB=1.$ Let $M$ be the midpoint of $BC,$ and let $P$ be on segment $AM$ such that $AM/MP=4.$ Find $BP.$

Consider an acute-angled triangle $ABC$. Let $P$ be the foot of the altitude of triangle $ABC$ issuing from the vertex $A$, and let $O$ be the circumcenter of triangle $ABC$. Assume that $\angle C \geq \angle B+30^{\circ}$. Prove that $\angle A+\angle COP < 90^{\circ}$.

We have N objects with weights $1, 2,\cdots , N$ grams. We wish to choose two or more of these objects so that the total weight of the chosen objects is equal to average weight of the remaining objects. Prove that [i](a)[/i] (2 points) if $N + 1$ is a perfect square, then the task is possible; [i](b)[/i] (6 points) if the task is possible, then $N + 1$ is a perfect square.

Prove that: there exists a positive constant $K$, and an integer series $\{a_n\}$, satisfying: $(1)$ $0<a_1<a_2<\cdots <a_n<\cdots $; $(2)$ For any positive integer $n$, $a_n<1.01^n K$; $(3)$ For any finite number of distinct terms in $\{a_n\}$, their sum is not a perfect square.

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

Prove that if $N{}$ is a large enough positive integer, then for any permutation $\pi_1,\ldots,\pi_N$ of $1,\ldots, N$ at least $11\%$ of the pairs $(i,j)$ of indices from $1{}$ to $N{}$ satisfy $\gcd(i,j)=1=\gcd(\pi_i,\pi_j).$ [i]Proposed by Vlad Spătaru[/i]

Some of the $n + 1$ cities in a country (including the capital city) are connected by one-way or two-way airlines. No two cities are connected by both a one-way airline and a two-way airline, but there may be more than one two-way airline between two cities. If $d_A$ denotes the number of airlines from a city $A$, then $d_A \le n$ for any city $A$ other than the capital city and $d_A + d_B \le n$ for any two cities $A$ and $B$ other than the capital city which are not connected by a two-way airline. Every airline has a return, possibly consisting of several connected flights. Find the largest possible number of two-way airlines and all configurations of airlines for which this largest number is attained.

In triangle $\triangle ABC, AB=AC.$ Let $D$ be on segment $AC$ and $E$ be a point on the extended line $BC$ such that $C$ is located between $B$ and $E$ and $\frac{AD}{DC}=\frac{BC}{2CE}$. Let $\omega$ be the circle with diameter $AB,$ and $\omega$ intersects segment $DE$ at $F.$ Prove that $B,C,F,D$ are concyclic.

Define the sequences $a_{0}, a_{1}, a_{2}, ...$ and $b_{0}, b_{1}, b_{2}, ...$ by $a_{0}= 2, b_{0}= 1, a_{n+1}= 2a_{n}b_{n}/(a_{n}+b_{n}), b_{n+1}= \sqrt{a_{n+1}b_{n}}$. Show that the two sequences converge to the same limit, and find the limit.

Let $S=\{1,2\dots,n\}$ for some integer $n>1.$ Say a permutation $\pi$ of $S$ has a local maximum at $k\in S$ if \[\begin{array}{ccc}\text{(i)}&\pi(k)>\pi(k+1)&\text{for }k=1\\ \text{(ii)}&\pi(k-1)<\pi(k)\text{ and }\pi(k)>\pi(k+1)&\text{for }1<k<n\\ \text{(iii)}&\pi(k-1)M\pi(k)&\text{for }k=n\end{array}\] (For example, if $n=5$ and $\pi$ takes values at $1,2,3,4,5$ of $2,1,4,5,3,$ then $\pi$ has a local maximum of $2$ as $k=1,$ and a local maximum at $k-4.$) What is the average number of local maxima of a permutation of $S,$ averaging over all permuatations of $S?$

Evaluate $\int_0^{\frac{\pi}{4}} \frac{\sin \theta (\sin \theta \cos \theta +2)}{\cos ^ 4 \theta}\ d\theta$.

How many integers $n$ are there such that $(n+1!)(n+2!)(n+3!)\cdots(n+2013!)$ is divisible by $210$ and $1 \le n \le 210$? [i]Proposed by Lewis Chen[/i]

Does there exist a triangle in which two sides are integer multiples of the median to that side? Does there exist a triangle in which every side is an integer multiple of the median to that side?

Let $a\# b$ be defined as $ab-a-3$. For example, $4\#5=20-4-3=13$ Compute $(2\#0)\#(1\#4)$.