How many different sets of three points in this equilateral triangular grid are the vertices of an equilateral triangle? Justify your answer. [center][img]http://i.imgur.com/S6RXkYY.png[/img][/center]

\[\int_0^1 \frac{(x+1)\log(x)}{x^3-1}\,\mathrm dx\] [i]Proposed by Vlad Oleksenko[/i]

Consider a coordinate system in the plane, with the origin $O$. We call a lattice point $A{}$ [i]hidden[/i] if the open segment $OA$ contains at least one lattice point. Prove that for any positive integer $n$ there exists a square of side-length $n$ such that any lattice point lying in its interior or on its boundary is hidden.

Denote by $F_0(x)$, $F_1(x)$, $\ldots$ the sequence of Fibonacci polynomials, which satisfy the recurrence $F_0(x)=1$, $F_1(x)=x$, and $F_n(x)=xF_{n-1}(x)+F_{n-2}(x)$ for all $n\geq 2$. It is given that there exist unique integers $\lambda_0$, $\lambda_1$, $\ldots$, $\lambda_{1000}$ such that \[x^{1000}=\sum_{i=0}^{1000}\lambda_iF_i(x)\] for all real $x$. For which integer $k$ is $|\lambda_k|$ maximized?

[asy] label("$1$",(0,0),S); label("$1$",(-1,-1),S); label("$1$",(-2,-2),S); label("$1$",(-3,-3),S); label("$1$",(-4,-4),S); label("$1$",(1,-1),S); label("$1$",(2,-2),S); label("$1$",(3,-3),S); label("$1$",(4,-4),S); label("$2$",(0,-2),S); label("$3$",(-1,-3),S); label("$3$",(1,-3),S); label("$4$",(-2,-4),S); label("$4$",(2,-4),S); label("$6$",(0,-4),S); label("etc.",(0,-5),S); //Credit to chezbgone2 for the diagram[/asy] Pascal's triangle is an array of positive integers(See figure), in which the first row is $1$, the second row is two $1$'s, each row begins and ends with $1$, and the $k^\text{th}$ number in any row when it is not $1$, is the sum of the $k^\text{th}$ and $(k-1)^\text{th}$ numbers in the immediately preceding row. The quotient of the number of numbers in the first $n$ rows which are not $1$'s and the number of $1$'s is $\textbf{(A) }\dfrac{n^2-n}{2n-1}\qquad\textbf{(B) }\dfrac{n^2-n}{4n-2}\qquad\textbf{(C) }\dfrac{n^2-2n}{2n-1}\qquad\textbf{(D) }\dfrac{n^2-3n+2}{4n-2}\qquad \textbf{(E) }\text{None of these}$

Seven identical-looking coins are given, of which four are real and three are counterfeit. The three counterfeit coins have equal weight, and the four real coins have equal weight. It is known that a counterfeit coin is lighter than a real one. In one weighing, one can select two sets of coins and check which set has a smaller total weight, or if they are of equal weight. How many weightings are needed to identify one counterfeit coin?

Let $ABC$ be a triangle such that such that $AB=14, BC=13$, and $AC=15$. Let $X$ be a point inside triangle $ABC$. Compute the minimum possible value of $(\sqrt{2}AX+BX+CX)^2$.

There are $n$ light bulbs in a circle and one of them is marked. Let operation $A$: Take a positive divisor $d$ of the number $n,$ starting with the light bulb marked and clockwise, we count around the circumference from $1$ to $dn$, changing the state (on or off) to those light bulbs that correspond to the multiples of $d$. Let operation $B$ be: Apply operation$ A$ to all positive divisors of $n$ (to the first divider that is applied is with all the light bulbs off and the remaining divisors is with the state resulting from the previous divisor). Determine all the positive integers $n$, such that when applying the operation on $B$, all the light bulbs are on.

Show that for nonnegative real numbers $a,b$ and integers $n\ge 2$, \[\frac{a^n+b^n}{2}\ge\left(\frac{a+b}{2}\right)^n\] When does equality hold?

Let $ABCD$ be a quadrilateral and let $l$ be a line. Let $l$ intersect the lines $AB,CD,BC,DA,AC,BD$ at points $X,X',Y,Y',Z,Z'$ respectively. Given that these six points on $l$ are in the order $X,Y,Z,X',Y',Z'$, show that the circles with diameter $XX',YY',ZZ'$ are coaxal.

let $ABC$ be a right angled triangle with inradius $1$ find the minimum area of triangle $ABC$

In scalene $\triangle ABC$, the tangent from the foot of the bisector of $\angle A$ to the incircle of $\triangle ABC$, other than the line $BC$, meets the incircle at point $K_a$. Points $K_b$ and $K_c$ are analogously defined. Prove that the lines connecting $K_a$, $K_b$, $K_c$ with the midpoints of $BC$, $CA$, $AB$, respectively, have a common point on the incircle.

Show that each convex pentagon has a vertex from which the distance to the opposite side of the pentagon is strictly less than the sum of the distances from the two adjacent vertices to the same side. [i]Note[/i]. If the pentagon is labeled $ ABCDE$, the adjacent vertices of $ A$ are $ B$ and $ E$, the ones of $ B$ are $ A$ and $ C$ etc.

Square $EFGH$ has one vertex on each side of square $ABCD$. Point $E$ is on $\overline{AB}$ with $AE=7\cdot EB$. What is the ratio of the area of $EFGH$ to the area of $ABCD$? $\textbf{(A)}\,\frac{49}{64} \qquad\textbf{(B)}\,\frac{25}{32} \qquad\textbf{(C)}\,\frac78 \qquad\textbf{(D)}\,\frac{5\sqrt{2}}{8} \qquad\textbf{(E)}\,\frac{\sqrt{14}}{4} $

Let $a$ and $b$ be the solutions to $x^2-x+q=0$, find $a^3+b^3+3(a^3b+ab^3)+6(a^3b^2+a^2b^3)$.

Prove that you can represent an arbitrary number not exceeding $n!$ as a sum of $k$ different numbers ($k\le n$) that are divisors of $n!$.

Let $f(x) = x^3-7x^2+16x-10$. As $x$ ranges over all integers, find the sum of distinct prime values taken on by $f(x)$.

Determine all values of $x$ in the interval $0 \leq x \leq 2\pi$ which satisfy the inequality \[ 2 \cos{x} \leq \sqrt{1+\sin{2x}}-\sqrt{1-\sin{2x}} \leq \sqrt{2}. \]

Josh and Mike live 13 miles apart. Yesterday, Josh started to ride his bicycle toward Mike's house. A little later Mike started to ride his bicycle toward Josh's house. When they met, Josh had ridden for twice the length of time as Mike and at four-fifths of Mike's rate. How many miles had Mike ridden when they met? $ \textbf{(A)}\ 4\qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 6\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 8$

In triangle $ABC$, angle $C$ is equal to $60^o$. Bisectors $AA'$ and $BB'$ intersect at point $I$. Point $K$ is symmetric to $I$ with respect to line $AB$. Prove that lines $CK$ and $A'B'$ are perpendicular. (D. Shvetsov, A. Zaslavsky)

Each positive integer is coloured red or blue. A function $f$ from the set of positive integers to itself has the following two properties: (a) if $x\le y$, then $f(x)\le f(y)$; and (b) if $x,y$ and $z$ are (not necessarily distinct) positive integers of the same colour and $x+y=z$, then $f(x)+f(y)=f(z)$. Prove that there exists a positive number $a$ such that $f(x)\le ax$ for all positive integers $x$. [i](United Kingdom) Ben Elliott[/i]

In a triangle $\triangle XYZ$, $\tan(x)\tan(z)=2$, $\tan(y)\tan(z)=18$. Then what is $\tan^2(z)$?

Cut the $19 \times 20$ grid rectangle along the grid lines into several squares so that there are exactly four of them with odd sidelengths.

Let $\mathcal F = \{ f: [0,1] \to [0,\infty) \mid f$ continuous $\}$ and $n$ an integer, $n\geq 2$. Find the smallest real constant $c$ such that for any $f\in \mathcal F$ the following inequality takes place \[ \int^1_0 f \left( \sqrt [n] x \right) dx \leq c \int^1_0 f(x) dx. \]

For positive reals $x,y,z\ge \frac{1}{2}$ with $x^2+y^2+z^2=1$, prove this inequality holds $$(\frac{1}{x}+\frac{1}{y}-\frac{1}{z})(\frac{1}{x}-\frac{1}{y}+\frac{1}{z})\ge 2$$