The integers $1, 2,. . . , n$ are arranged in order so that each value is strictly larger than all values above or is strictly less than all values previous. In how many ways can this be done?

What is the hybridization of the carbon atom in a carboxyl group? $ \textbf{(A) }sp \qquad\textbf{(B) } sp^2\qquad\textbf{(C) } sp^3\qquad\textbf{(D) } dsp^3\qquad $

Let $a,b$ be coprime positive integers. Show that the number of positive integers $n$ for which the equation $ax+by=n$ has no positive integer solutions is equal to $\frac{(a-1)(b-1)}{2}-1$.

Compute $$\int\frac{(\sin x+\cos x)(4-2\sin2x-\sin^22x)e^x}{\sin^32x}dx$$ where $x\in\left(0,\frac\pi2\right)$. [i]Proposed by Mihály Bencze[/i]

Four positive integers $x,y,z$ and $t$ satisfy the relations \[ xy - zt = x + y = z + t. \] Is it possible that both $xy$ and $zt$ are perfect squares?

On a board are drawn the points $A,B,C,D$. Yetti constructs the points $A^\prime,B^\prime,C^\prime,D^\prime$ in the following way: $A^\prime$ is the symmetric of $A$ with respect to $B$, $B^\prime$ is the symmetric of $B$ wrt $C$, $C^\prime$ is the symmetric of $C$ wrt $D$ and $D^\prime$ is the symmetric of $D$ wrt $A$. Suppose that Armpist erases the points $A,B,C,D$. Can Yetti rebuild them? $\star \, \, \star \, \, \star$ [b]Note.[/b] [i]Any similarity to real persons is purely accidental.[/i]

[b]p1.[/b] Denote $S_n = 1 + \frac12 + \frac13 + ...+ \frac{1}{n}$. What is $144169\cdot S_{144169} - (S_1 + S_2 + ... + S_{144168})$? [b]p2.[/b] Let $A,B,C$ be three collinear points, with $AB = 4$, $BC = 8$, and $AC = 12$. Draw circles with diameters $AB$, $BC$, and $AC$. Find the radius of the two identical circles that will lie tangent to all three circles. [b]p3.[/b] Let $s(i)$ denote the number of $1$’s in the binary representation of $i$. What is $$\sum_{x=1}{314}\left( \sum_{i=0}^{2^{576}-2} x^{s(i)} \right) \,\, mod \,\,629 ?$$ [b]p4.[/b] Parallelogram $ABCD$ has an area of $S$. Let $k = 42$. $E$ is drawn on AB such that $AE =\frac{AB}{k}$ . $F$ is drawn on $CD$ such that $CF = \frac{CD}{k}$ . $G$ is drawn on $BC$ such that $BG = \frac{BC}{k}$ . $H$ is drawn on $AD$ such that $DH = \frac{AD}{k}$ . Line $CE$ intersects $BH$ at $M$, and $DG$ at $N$. Line $AF$ intersects $DG$ at $P$, and $BH$ at $Q$. If $S_1$ is the area of quadrilateral $MNPQ$, find $\frac{S_1}{S}$. [b]p5.[/b] Let $\phi$ be the Euler totient function. What is the sum of all $n$ for which $\frac{n}{\phi(n)}$ is maximal for $1 \le n \le 500$? [b]p6.[/b] Link starts at the top left corner of an $12 \times 12$ grid and wants to reach the bottom right corner. He can only move down or right. A turn is defined a down move immediately followed by a right move, or a right move immediately followed by a down move. Given that he makes exactly $6$ turns, in how many ways can he reach his destination? PS. You had better use hide for answers.

Let \[ f(n)= \sum_{p|n , \;p^{\alpha} \leq n < p^{\alpha+1} \ } p^{\alpha} .\] Prove that \[ \limsup_{n \rightarrow \infty}f(n) \frac{ \log \log n}{n \log n}=1 .\] [i]P. Erdos[/i]

Inscribe in the triangle $ABC$ a triangle with minimum perimeter.

Find all functions $f: \mathbb{R} \to \mathbb{R}$ such that for any reals $x \neq y$ the following equality is true: $$f(x+y)^2=f(x+y)+f(x)+f(y)$$ [i]D. Zmiaikou[/i]

Three different faces of a regular dodecahedron are selected at random and painted. What is the probability that there is at least one pair of painted faces that share an edge?

Let $k > 1$ be a fixed odd number, and for non-negative integers $n$ let $$f_n=\sum_{\substack{0\leq i\leq n\\ k\mid n-2i}}\binom{n}{i}.$$ Prove that $f_n$ satisfy the following recursion: $$f_{n}^2=\sum_{i=0}^{n} \binom{n}{i}f_{i}f_{n-i}.$$

Given that $n$ is a natural number such that the leftmost digits in the decimal representations of $2^n$ and $3^n$ are the same, find all possible values of the leftmost digit.

Let $a_0$ be an arbitrary positive integer. Consider the infinite sequence $(a_n)_{n\geq 1}$, defined inductively as follows: given $a_0, a_1, ..., a_{n-1}$ define the term $a_n$ as the smallest positive integer such that $a_0+a_1+...+a_n$ is divisible by $n$. Prove that there exist a positive integer a positive integer $M$ such that $a_{n+1}=a_n$ for all $n\geq M$.

\[\int_{-1}^1 \frac{1}{(8 + x^2)\sqrt{1-x^2}} \,\mathrm dx\] [i]Proposed by Vlad Oleksenko[/i]

Given any two positive real numbers $x$ and $y$, then $x\Diamond y$ is a positive real number defined in terms of $x$ and $y$ by some fixed rule. Suppose the operation $x\Diamond y$ satisfies the equations $(x\cdot y)\Diamond y=x(y\Diamond y)$ and $(x\Diamond 1)\Diamond x=x\Diamond 1$ for all $x,y>0$. Given that $1\Diamond 1=1$, find $19\Diamond 98$.

Compute the average of the integers $2, 3, 4, \dots, 2012$. [i]Proposed by Eugene Chen[/i]

Simplify $\sqrt{6+\sqrt{6+\sqrt{6+\cdots}}}$.

Given are $n$ points with different abscissas in the plane. Through every pair points is drawn a parabola - a graph of a square trinomial with leading coefficient equal to $1$. A parabola is called $good$ if there are no other marked points on it, except for the two through which it is drawn, and there are no marked points above it (i.e. inside it). What is the greatest number of $good$ parabolas?

The intersection of two squares with perimeter $8$ is a rectangle with diagonal length $1$. Given that the distance between the centers of the two squares is $2$, the perimeter of the rectangle can be expressed as $P$. Find $10P$.

$AB$ and $CD$ are two parallel chords of a parabola. Circle $S_1$ passing through points $A,B$ intersects circle $S_2$ passing through $C,D$ at points $E,F$. Prove that if $E$ belongs to the parabola, then $F$ also belongs to the parabola. I.Voronovich

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

Determine all real numbers $x$ which satisfy \[ x = \sqrt{a - \sqrt{a+x}} \] where $a > 0$ is a parameter.

Let $p > 2$ be a prime number. Prove that there is a permutation $k_1, k_2, ..., k_{p-1}$ of numbers $1,2,...,p-1$ such that the number $1^{k_1}+2^{k_2}+3^{k_3}+...+(p-1)^{k_{p-1}}$ is divisible by $p$. Note: The numbers $k_1, k_2, ..., k_{p-1}$ are a permutation of the numbers $1,2,...,p-1$ if each of of numbers $1,2,...,p-1$ appears exactly once among the numbers $k_1, k_2, ..., k_{p-1}$.

Let $S$ be a set of positive integers, each of them having exactly $100$ digits in base $10$ representation. An element of $S$ is called [i]atom[/i] if it is not divisible by the sum of any two (not necessarily distinct) elements of $S$. If $S$ contains at most $10$ atoms, at most how many elements can $S$ have?