Suppose $ABCD$ is a rectangle whose diagonals meet at $E$. The perimeter of triangle $ABE$ is $10\pi$ and the perimeter of triangle $ADE$ is $n$. Compute the number of possible integer values of $n$.

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

Let the centroid of the triangle $ABC$ be $G$ and let the line parallel to $\overline{BC}$ that passes through $A$ be $l$. Define a point, $D$ on $l$ such that $\angle DGC=90^o$. Prove that \[2[ADCG]\leq AB\cdot DC\] For clarification, [ADGC] represents the area of the quadrilateral ADGC.

Let $t_{k} = a_{1}^k + a_{2}^k +...+a_{n}^k$, where $a_{1}$, $a_{2}$, ... $a_{n}$ are positive real numbers and $k \in \mathbb{N}$. Prove that $$\frac{t_{5}^2 t_1^{6}}{15} - \frac{t_{4}^4 t_{2}^2 t_{1}^2}{6} + \frac{t_{2}^3 t_{4}^5}{10} \geq 0 $$ [i]Proposed by Daniel Velinov[/i]

For a positive integer $n$, denote $A_n=\{(x,y)\in\mathbb Z^2|x^2+xy+y^2=n\}$. (a) Prove that the set $A_n$ is always finite. (b) Prove that the number of elements of $A_n$ is divisible by $6$ for all $n$. (c) For which $n$ is the number of elements of $A_n$ divisible by $12$?

The two cats Fitz and Will play the following game. On a blackboard is written the expression \[ x^{100} + {\square} x^{99} + {\square} x^{98} + {\square} x^{97} + \dots + {\square } x^2 + {\square} x +1. \] Both cats take alternate turns replacing one $\square$ with a $0$ or $1$, with Fitz going first, until (after 99 turns) all the blanks have been filled. If the resulting polynomial obtained has a real root, then Will wins, otherwise Fitz wins. Determine, with proof, which player has a winning strategy.

The world-renowned Marxist theorist [i]Joric[/i] is obsessed with both mathematics and social egalitarianism. Therefore, for any decimal representation of a positive integer $n$, he tries to partition its digits into two groups, such that the difference between the sums of the digits in each group be as small as possible. Joric calls this difference the [i]defect[/i] of the number $n$. Determine the average value of the defect (over all positive integers), that is, if we denote by $\delta(n)$ the defect of $n$, compute \[\lim_{n \rightarrow \infty}\frac{\sum_{k = 1}^{n}\delta(k)}{n}.\] [i]Iurie Boreico[/i]

Let $N$ be the number of ordered lists of $9$ positive integers $(a,b,c,d,e,f,g,h,i)$ such that $$\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}+\frac{1}{e}+\frac{1}{f}+\frac{1}{g}+\frac{1}{h}+\frac{1}{i}=1.$$ Determine whether $N$ is even or odd.

Fix a triangle $ABC$. We say that triangle $XYZ$ is elegant if $X$ lies on segment $BC$, $Y$ lies on segment $CA$, $Z$ lies on segment $AB$, and $XYZ$ is similar to $ABC$ (i.e., $\angle A=\angle X, \angle B=\angle Y, \angle C=\angle Z $). Of all the elegant triangles, which one has the smallest perimeter?

Determine all integers $m$ for which all solutions of the equation $3x^3-3x^2+m = 0$ are rational.

Let $ a_1,a_2,...,a_n$ with arithmetic mean equals zero; what is the value of: $ \sum_{j=1}^n{\frac{1}{a_j(a_j+a_{j+1})(a_j+a_{j+1}+a_{j+2})...(a_j+a_{j+1}+...+a_{j+n-2})}}$ , where $ a_{n+k}=a_k$ ?

Given a line $p$ and a triangle $\Delta$ in the plane, construct an equilateral triangle one of whose vertices lies on the line $p$, while the other two halve the perimeter of $\Delta.$

A positive integer $N$ has base-eleven representation $\underline{a}\,\underline{b}\,\underline{c}$ and base-eight representation $\underline{1}\,\underline{b}\,\underline{c}\,\underline{a}$, where $a$, $b$, and $c$ represent (not necessarily distinct) digits. Find the least such $N$ expressed in base ten.

Let $\{a_i\}$ be a strictly increasing sequence of positive integers. Define the sequence $\{s_k\}$ as $$s_k = \sum_{i=1}^{k}\frac{1}{[a_i,a_{i+1}]},$$ where $[a_i,a_{i+1}]$ is the least commun multiple of $a_i$ and $a_{i+1}$. Show that the sequence $\{s_k\}$ is convergent.

Logan is constructing a scaled model of his town. The city's water tower stands $ 40$ meters high, and the top portion is a sphere that holds $ 100,000$ liters of water. Logan's miniature water tower holds $ 0.1$ liters. How tall, in meters, should Logan make his tower? $ \textbf{(A)}\ 0.04\qquad \textbf{(B)}\ \frac{0.4}{\pi}\qquad \textbf{(C)}\ 0.4\qquad \textbf{(D)}\ \frac{4}{\pi}\qquad \textbf{(E)}\ 4$

Given $m\in\mathbb{Z}^+$. Find all natural numbers $n$ that does not exceed $10^m$ satisfying the following conditions: i) $3|n.$ ii) The digits of $n$ in decimal representation are in the set $\{2,0,1,5\}$.