Let $f:\mathbb{R}\rightarrow \mathbb{R}$ be a function defined by $f(x)=\frac{2008^{2x}}{2008+2008^{2x}}$. Prove that \[\begin{aligned} f\left(\frac{1}{2007}\right)+f\left(\frac{2}{2007}\right)+\cdots+f\left(\frac{2005}{2007}\right)+f\left(\frac{2006}{2007}\right)=1003. \end{aligned}\]

Prove for all real numbers $x, y$, $$(x^2 + 1)(y^2 + 1) + 4(x - 1)(y - 1) \geq 0.$$ Determine when equality holds.

Let $a$, $b$ and $c$ be real positive numbers such that $\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = 1$ Prove that: $a^2+b^2+b^2 \ge 2a+2b+2c+9$

Let $x_i$, $1\leq i\leq n$ be real numbers. Prove that \[ \sum_{1\leq i<j\leq n}|x_i+x_j|\geq\frac{n-2}{2}\sum_{i=1}^n|x_i|. \] [i]Discrete version by Dan Schwarz of a Putnam problem[/i]

When Cheenu was a boy he could run $15$ miles in $3$ hours and $30$ minutes. As an old man he can now walk $10$ miles in $4$ hours. How many minutes longer does it take for him to walk a mile now compared to when he was a boy? $\textbf{(A) }6\qquad\textbf{(B) }10\qquad\textbf{(C) }15\qquad\textbf{(D) }18\qquad \textbf{(E) }30$

The positive real numbers $a_1,\ldots ,a_n$ and $k$ are such that $a_1+\cdots +a_n=3k$, $a_1^2+\cdots +a_n^2=3k^2$ and $a_1^3+\cdots +a_n^3>3k^3+k$. Prove that the difference between some two of $a_1,\ldots,a_n$ is greater than $1$.

Prove that every triangle can be cut into three pieces so that every piece has axis of symmetry. Show how to cut it (a) using three line segments, (b) using two line segments.

Suppose $ f(x)\equal{}a_0x^n\plus{}a_1x^{n\minus{}1}\plus{}\ldots\plus{}a_{n\minus{}1}x\plus{}a_n$ ($ a_0\neq 0$) is a polynomial with real coefficients satisfying $ f(x)f(2x^2) \equal{} f(2x^3 \plus{} x)$ for all $ x \in\mathbb{R}$. Prove that $ f(x)$ has no real roots.

In acute triangle $ABC, AB<AC$, $I$ is its incenter, $D$ is the foot of perpendicular from $I$ to $BC$, altitude $AH$ meets $BI,CI$ at $P,Q$ respectively. Let $O$ be the circumcenter of $\triangle IPQ$, extend $AO$ to meet $BC$ at $L$. Circumcircle of $\triangle AIL$ meets $BC$ again at $N$. Prove that $\frac{BD}{CD}=\frac{BN}{CN}$.

For a given triangle $A_1A_2A_3$ and a point $X{}$ inside of it we denote by $X_i$ the intersection of line $A_iX$ with the side opposite to $A_i$ for all $1\leqslant i \leqslant 3.$ Let $P{}$ and $Q{}$ be distinct points inside the triangle. We then say that the two points are isotomic (i.e. they form an isotomic pair) if for all $i{}$ the points $P_i$ and $Q_i$ are symmetric with respect to the midpoint of the side opposite to $A_i.$ Augustus wants to construct isotomic pairs with his favourite app, [i]GeoZebra[/i]. He already constructed the vertices and sidelines of a non-isosceles acute triangle when suddenly his computer got infected with a virus. Most tools became unavailable, only a few are usable, some of which even require a fee: [list] [*][b]Point:[/b] select an arbitrary point (with respect to the position of the mouse) on the plane or on a figure (circle or line) [b]- free[/b] [*][b]Intersection:[/b] intersection points of two figures (where each figure is a circle or a line) [b]- free[/b] [*][b]Line:[/b] line through two points [b]- \$5 per use[/b] [*][b]Perpendicular:[/b] perpendicular from a point to an already constructed line [b]- \$50 per use[/b] [*][b]Circumcircle:[/b] circle through three points [b]- \$10 per use[/b] [/list] [list=a] [*]Agatha selected a point $P{}$ inside the triangle, which is not the centroid of the triangle. Show that Augustus can construct a point $Q{}$ at a cost of at most 1000 dollars such that $P{}$ and $Q{}$ are isotomic. [*]Prove that for any $n\geqslant 1$ Augustus can construct $n{}$ different isotomic pairs at a cost of at most $200 + 10n$ dollars. [/list] [i]Note: The parts are unrelated, that is Augustus can’t use his constructions from part a) in part b).[/i]

Let the sequence $a_i$ be defined as $a_{i+1} = 2^{a_i}$. Find the number of integers $1 \le n \le 1000$ such that if $a_0 = n$, then $100$ divides $a_{1000} - a_1$.

[b]Q1.[/b] Assum that $a-b=-(a-b).$ Then: $(A) \; a=b; \qquad (B) \; a<b; \qquad (C) \; a>b \qquad (D) \; \text{ It is impossible to compare those of a and b.}$

Kira has $3$ blocks with the letter $A$, $3$ blocks with the letter $B$, and $3$ blocks with the letter $C$. She puts these $9$ blocks in a sequence. She wants to have as many distinct distances between blocks with the same letter as possible. For example, in the sequence $ABCAABCBC$ the blocks with the letter A have distances $1, 3$, and $4$ between one another, the blocks with the letter $B$ have distances $2, 4$, and $6$ between one another, and the blocks with the letter $C$ have distances $2, 4$, and $6$ between one another. Altogether, we got distances of $1, 2, 3, 4$, and $6$; these are $5$ distinct distances. What is the maximum number of distinct distances that can occur?

Let $S$ be the set of all 3-tuples $(a, b, c)$ of positive integers such that $a + b + c = 2013$. Find $$\sum_{(a,b,c)\in S} abc.$$

In a heap there are $2021$ stones. Two players $A$ and $B$ play removing stones of the pile, alternately starting with $A$. A valid move for $A$ consists of remove $1, 2$ or $7$ stones. A valid move for B is to remove $1, 3, 4$ or $6$ stones. The player who leaves the pile empty after making a valid move wins. Determine if some of the players have a winning strategy. If such a strategy exists, explain it.

In an acute triangle $ABC$ with $|AB| \not= |AC|$, let $I$ be the incenter and $O$ the circumcenter. The incircle is tangent to $\overline{BC}, \overline{CA}$ and $\overline{AB}$ in $D,E$ and $F$ respectively. Prove that if the line parallel to $EF$ passing through $I$, the line parallel to $AO$ passing through $D$ and the altitude from $A$ are concurrent, then the point of concurrence is the orthocenter of the triangle $ABC$. [i]Proposed by Petar Nizié-Nikolac[/i]

Country $\mathcal{A}$ has $c\%$ of the world's population and owns $d\%$ of the world's wealth. Country $\mathcal{B}$ has $e\%$ of the world's population and $f\%$ of its wealth. Assume that the citizens of $\mathcal{A}$ share the wealth of $\mathcal{A}$ equally, and assume that those of $\mathcal{B}$ share the wealth of $\mathcal{B}$ equally. Find the ratio of the wealth of a citizen of $\mathcal{A}$ to the wealth of a citizen of $\mathcal{B}$. $ \textbf{(A)}\ \frac{cd}{ef} \qquad\textbf{(B)}\ \frac{ce}{df} \qquad\textbf{(C)}\ \frac{cf}{de} \qquad\textbf{(D)}\ \frac{de}{cf} \qquad\textbf{(E)}\ \frac{df}{ce} $

Find all real solutions of the system of equations: \[\sum^n_{k=1} x^i_k = a^i\] for $i = 1,2, \ldots, n.$

What is the probability of having $2$ adjacent white balls or $2$ adjacent blue balls in a random arrangement of $3$ red, $2$ white and $2$ blue balls? $ \textbf{(A)}\ \dfrac{2}{5} \qquad\textbf{(B)}\ \dfrac{3}{7} \qquad\textbf{(C)}\ \dfrac{16}{35} \qquad\textbf{(D)}\ \dfrac{10}{21} \qquad\textbf{(E)}\ \dfrac{5}{14} $

How many noncongruent triangles are there with one side of length $20,$ one side of length $17,$ and one $60^{\circ}$ angle?

Positive integers $a$, $b$ and $c$ satisfy the system of equations \begin{align*} (ab-1)^2&=c(a^2+b^2)+ab+1,\\ a^2+b^2&=c^2+ab. \end{align*} a) Prove that $c+1$ is a perfect square. b) Find all such triples $(a,b,c)$.

In an election, there are a total of $12$ candidates. An election committee has $6$ members voting. It is known that at most two candidates voted by any two committee members are the same. Find the maximum number of committee members.

Let $ABCD$ be a convex quadrilateral, and let $\omega_A$ and $\omega_B$ be the incircles of $\triangle ACD$ and $\triangle BCD$, with centers $I$ and $J$. The second common external tangent to $\omega_A$ and $\omega_B$ touches $\omega_A$ at $K$ and $\omega_B$ at $L$. Prove that lines $AK$, $BL$, $IJ$ are concurrent.

Let $A_1A_2A_3 \ldots A_{21}$ be a 21-sided regular polygon inscribed in a circle with centre $O$. How many triangles $A_iA_jA_k$, $1 \leq i < j < k \leq 21$, contain the centre point $O$ in their interior?

Call a set of $n$ lines [i]good[/i] if no $3$ lines are concurrent. These $n$ lines divide the Euclidean plane into regions (possible unbounded). A [i]coloring[/i] is an assignment of two colors to each region, one from the set $\{A_1, A_2\}$ and the other from $\{B_1, B_2, B_3\}$, such that no two adjacent regions (adjacent meaning sharing an edge) have the same $A_i$ color or the same $B_i$ color, and there is a region colored $A_i, B_j$ for any combination of $A_i, B_j$. A number $n$ is [i]colourable[/i] if there is a coloring for any set of $n$ good lines. Find all colourable $n$.