Given non-zero reals $ a$, $ b$, find all functions $ f: \mathbb{R} \longmapsto \mathbb{R}$, such that for every $ x, y \in \mathbb{R}$, $ y \neq 0$, $ f(2x) \equal{} af(x) \plus{} bx$ and $ \displaystyle f(x)f(y) \equal{} f(xy) \plus{} f \left( \frac {x}{y} \right)$.

$2.$ The equations $x^2-4x+k=0$ and $x^2+kx-4=0,$ where $k$ is a real number, have exactly one common root. What is the value of $k ?$

If $x$ and $y$ are positive integers, and $x^4+y^4=4721$, find all possible values of $x+y$

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

Let SABC be a regular triangular pyramid. Find the set of all points $ D (D! \equal{} S)$ in the space satisfing the equation $ |cos ASD \minus{} 2cosBSD \minus{} 2 cos CSD| \equal{} 3$.

Prove that $1 + x + x^2 + x^3 + ...+ x^{2011} \ge 0$ for every $x \ge - 1$ .

Given the positive real numbers $a_{1},a_{2},\dots,a_{n},$ such that $n>2$ and $a_{1}+a_{2}+\dots+a_{n}=1,$ prove that the inequality \[ \frac{a_{2}\cdot a_{3}\cdot\dots\cdot a_{n}}{a_{1}+n-2}+\frac{a_{1}\cdot a_{3}\cdot\dots\cdot a_{n}}{a_{2}+n-2}+\dots+\frac{a_{1}\cdot a_{2}\cdot\dots\cdot a_{n-1}}{a_{n}+n-2}\leq\frac{1}{\left(n-1\right)^{2}}\] does holds.

Find all pairs of positive integers $m, n$ such that $9^{|m-n|}+3^{|m-n|}+1$ is divisible by $m$ and $n$ simultaneously.

* Let $A, B, C$ be three nodes of a graph paper. Prove that if $\vartriangle ABC$ is an acute one, then there is at least one more node either inside $\vartriangle ABC$ or on one of its sides.

Let $E$ be the set of all continuous functions $u:[0,1]\to\mathbb R$ satisfying $$u^2(t)\le1+4\int^t_0s|u(s)|\text ds,\qquad\forall t\in[0,1].$$Let $\varphi:E\to\mathbb R$ be defined by $$\varphi(u)=\int^1_0\left(u^2(x)-u(x)\right)\text dx.$$Prove that $\varphi$ has a maximum value and find it.

Prove that the equation $$\frac{1}{\sqrt{x} +\sqrt{1006}}+\frac{1}{\sqrt{2012 -x} +\sqrt{1006}}=\frac{2}{\sqrt{x} +\sqrt{2012 -x}}$$ has $2013$ integer solutions.

Let $A$ be a finite set, and $A_1,A_2,\cdots, A_n$ are subsets of $A$ with the following conditions: (1) $|A_1|=|A_2|=\cdots=|A_n|=k$, and $k>\frac{|A|}{2}$; (2) for any $a,b\in A$, there exist $A_r,A_s,A_t\,(1\leq r<s<t\leq n)$ such that $a,b\in A_r\cap A_s\cap A_t$; (3) for any integer $i,j\, (1\leq i<j\leq n)$, $|A_i\cap A_j|\leq 3$. Find all possible value(s) of $n$ when $k$ attains maximum among all possible systems $(A_1,A_2,\cdots, A_n,A)$.

a) Let $AB CD$ be a regular tetrahedron. On the sides $AB$, $AC$ and $AD$, the points $M$, $N$ and $P$, are considered. Determine the volume of the tetrahedron $AMNP$ in terms of $x, y, z$, where $x=AM$, $y=AN$, $z=AP$. b) Show that for any real numbers $x, y, z, t, u, v \in (0, 1)$ : $$xyz + uv(1- x) + (1- y)(1- v)t + (1- z)(1- w)(1- t) < 1.$$

Let $a,b$ be positive integers such that $a+b=10$. Let $\tfrac{p}{q}$ be the difference between the maximum and minimum possible values of $\tfrac{1}{a}+\tfrac{1}{b}$, where $p$ and $q$ are relatively prime positive integers. Compute $p+q$.

* A bus route has $14$ stops (counting the first and the last). A bus cannot carry more than $25$ passengers. We assume that a passenger takes a bus from $A$ to $B$ if (s)he enters the bus at $A$ and gets off at $B$. Prove that for any bus route: a) there are $8$ distinct stops $A_1, B_1, A_2, B_2, A_3, B_3, A_4, B_4$ such that no passenger rides from $A_k$ to $B_k$ for all $k = 1, 2, 3, 4$ (#) b) there might not exist $10$ distinct stops $A_1, B_1, . . . , A_5, B_5$ with property (#).

Rosencrantz plays $n \leq 2015$ games of question, and ends up with a win rate $\left(\text{i.e.}\: \frac{\text{\# of games won}}{\text{\# of games played}}\right)$ of $k$. Guildenstern has also played several games, and has a win rate less than $k$. He realizes that if, after playing some more games, his win rate becomes higher than $k$, then there must have been some point in time when Rosencrantz and Guildenstern had the exact same win-rate. Find the product of all possible values of $k$.

The complete set of $x$-values satisfying the inequality $\dfrac{x^2-4}{x^2-1}>0$ is the set of all $x$ such that: $\textbf{(A) }x>2\text{ or }x<-2\text{ or }-1<x<1\qquad\, \textbf{(B) }x>2\text{ or }x<-2$ $\textbf{(C) }x>1\text{ or }x<-2\qquad\qquad\qquad\qquad\,\,\,\,\,\,\, \textbf{(D) }x>1\text{ or }x<-2\qquad$ $\textbf{(E) }x\text{ is any real number except }1\text{ or }-1$

Tetris is a Soviet block game developed in $1984$, probably to torture misbehaving middle school children. Nowadays, Tetris is a game that people play for fun, and we even have a mini-event featuring it, but it shall be used on this test for its original purpose. The $7$ Tetris pieces, which will be used in various problems in this theme, are as follows: [img]https://cdn.artofproblemsolving.com/attachments/b/c/f4a5a2b90fcf87968b8f2a1a848ad32ef52010.png[/img] [b]p1.[/b] Each piece has area $4$. Find the sum of the perimeters of each of the $7$ Tetris pieces. [b]p2.[/b] In a game of Tetris, Qinghan places $4$ pieces every second during the first $2$ minutes, and $2$ pieces every second for the remainder of the game. By the end of the game, her average speed is $3.6$ pieces per second. Find the duration of the game in seconds. [b]p3.[/b] Jeff takes all $7$ different Tetris pieces and puts them next to each other to make a shape. Each piece has an area of $4$. Find the least possible perimeter of such a shape. [b]p4.[/b] Qepsi is playing Tetris, but little does she know: the latest update has added realistic physics! She places two blocks, which form the shape below. Tetrominoes $ABCD$ and $EFGHI J$ are both formed from $4$ squares of side length $1$. Given that $CE = CF$, the distance from point $I$ to the line $AD$ can be expressed as $\frac{A\sqrt{B}-C}{D}$ . Find $1000000A+10000B +100C +D$. [img]https://cdn.artofproblemsolving.com/attachments/9/a/5e96a855b9ebbfd3ea6ebee2b19d7c0a82c7c3.png[/img] [b]p5.[/b] Using the following tetrominoes: [img]https://cdn.artofproblemsolving.com/attachments/3/3/464773d41265819c4f452116c1508baa660780.png[/img] Find the number of ways to tile the shape below, with rotation allowed, but reflection disallowed: [img]https://cdn.artofproblemsolving.com/attachments/d/6/943a9161ff80ba23bb8ddb5acaf699df187e07.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The diagonals of a convex quadrilateral $ABCD$ are orthogonal and intersect at a point $E$. Prove that the projections of $E$ on $AB,BC,CD,DA$ are concyclic.

Let $x_n=2^{2^{n}}+1$ and let $m$ be the least common multiple of $x_2, x_3, \ldots, x_{1971}.$ Find the last digit of $m.$

Suppose $a,b,c$ are distinct positive integers such that $\sqrt{a\sqrt{b\sqrt{c}}}$ is an integer. Compute the least possible value of $a+b+c.$

Alice, Bob, and Charlie were on a hike and were wondering how far away the nearest town was. When Alice said, "We are at least 6 miles away," Bob replied, "We are at most 5 miles away." Charlie then remarked, "Actually the nearest town is at most 4 miles away." It turned out that none of the three statements were true. Let $d$ be the distance in miles to the nearest town. Which of the following intervals is the set of all possible values of $d$? $\textbf{(A) } (0,4) \qquad \textbf{(B) } (4,5) \qquad \textbf{(C) } (4,6) \qquad \textbf{(D) } (5,6) \qquad \textbf{(E) } (5,\infty) $

Let $K$ be a finite field and $f:K\to K^*$. Prove that there is a reducible polynomial $P\in K[X]$ s.t. $P(x)=f(x),\forall x\in K$. [i]Marian Andronache[/i]

Let $T$ be an isosceles right triangle. Let $S$ be the circle such that the difference in the areas of $T \cup S$ and $T \cap S$ is the minimal. Prove that the centre of $S$ divides the altitude drawn on the hypotenuse of $T$ in the golden ratio (i.e., $\frac{(1 + \sqrt{5})}{2}$)

Given positive integers $n,k$, $n \ge 2$. Find the minimum constant $c$ satisfies the following assertion: For any positive integer $m$ and a $kn$-regular graph $G$ with $m$ vertices, one could color the vertices of $G$ with $n$ different colors, such that the number of monochrome edges is at most $cm$.