Ten positive integers are arranged around a circle. Each number is one more than the greatest common divisor of its two neighbors. What is the sum of the ten numbers?

Let $\triangle{ABC}$ exist such that $AB=6, BC=8, AC=10.$ Let $P$ lie on the circumcircle of $ABC,$ $\omega,$ such that $P$ lies strictly on the arc between $B$ and $C$ (i.e. $P \neq B, C$). Drop altitudes from $P$ to $BC, AC$ at points $J$ and $Q$ respectively. Let $l$ be a line through $B$ such that it intersects $AC$ at a point $K.$ Let $M$ be the midpoint of $BQ.$ Let $CM$ intersect line $l$ at a point $I.$ Let $AI$ intersect $JQ$ at a point $U.$ Now, $B, J, U, M$ are cyclic. Now, let $\angle{QJC}=\theta.$ If we set $y=\sin(\theta), x=\cos(\theta),$ they satisfy the equation $$768(xy)=(16-8x^2+6xy)(x^2y^2(8x-6y)^2+(8x-8xy^2+6y^3)^2)$$ The numerical values of $x,y$ are approximately: $$x=0.72951, y=0.68400$$ Let $BK$ intersect the circumcircle of $ABC,$ $\omega,$ at a point $L.$ Find the value of $BL.$ We will only look up to two decimal places for correctness.

Let us say that a pair of distinct positive integers is nice if their arithmetic mean and their geometric mean are both integer. Is it true that for each nice pair there is another nice pair with the same arithmetic mean? (The pairs $(a, b)$ and $(b, a)$ are considered to be the same pair.) [i]Boris Frenkin[/i]

Determine a triangle for which the three sides and an altitude are four consecutive integers and for which this altitude partitions the triangle into two right triangles with integer sides. Show that there is only one such triangle.

Let $n$ be a positive integer. Alice and Bob play the following game. First, Alice picks $n + 1$ subsets $A_1,...,A_{n+1}$ of $\{1,... ,2^n\}$ each of size $2^{n-1}$. Second, Bob picks $n + 1$ arbitrary integers $a_1,...,a_{n+1}$. Finally, Alice picks an integer $t$. Bob wins if there exists an integer $1 \le i \le n + 1$ and $s \in A_i$ such that $s + a_i \equiv t$ (mod $2^n$). Otherwise, Alice wins. Find all values of $n$ where Alice has a winning strategy.

Show that the equation $x^4 +y^4 +4z^4 =1$ has infinitely many rational solutions.

Let $k$ be a positive integer larger than $1$. Build an infinite set $\mathcal{A}$ of subsets of $\mathbb{N}$ having the following properties: [b](a)[/b] any $k$ distinct sets of $\mathcal{A}$ have exactly one common element; [b](b)[/b] any $k+1$ distinct sets of $\mathcal{A}$ have void intersection.

Compute the remainder when $20^{\left(13^{14}\right)}$ is divided by $11$. $\text{(A) }1\qquad\text{(B) }3\qquad\text{(C) }4\qquad\text{(D) }5\qquad\text{(E) }9$

Let $S$ be a set of $n>0$ elements, and let $A_1 , A_2 , \ldots A_k$ be a family of distinct subsets such that any two have a non-empty intersection. Assume that no other subset of $S$ intersects all of the $A_i.$ Prove that $ k=2^{n-1}.$

Let $A=\{1,2,\ldots,2012\}, \: B=\{1,2,\ldots,19\}$ and $S$ be the set of all subsets of $A.$ Find the number of functions $f : S\to B$ satisfying $f(A_1\cap A_2)=\min\{f(A_1),f(A_2)\}$ for all $A_1, A_2 \in S.$

Suppose you have a sphere tangent to the $xy$-plane with its center having positive $z$-coordinate. If it is projected from a point $P=(0,b,a)$ to the $xy$-plane, it gives the conic section $y=x^2$. If we write $a=\tfrac pq$ where $p,q$ are integers, find $p+q$.

The zeroes of the function $f(x)=x^2-ax+2a$ are integers. What is the sum of all possible values of $a$? $\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$

Given a square sheet of paper with side $1$. Measure on this sheet a distance of $ 5/6$. (The sheet can be folded, including, along any segment with ends at the edges of the paper and unbend back, after unfolding, a trace of the fold line remains on the paper).

In a geometric series of positive terms the difference between the fifth and fourth terms is $576$, and the difference between the second and first terms is $9$. What is the sum of the first five terms of this series? $ \textbf{(A)}\ 1061 \qquad\textbf{(B)}\ 1023 \qquad\textbf{(C)}\ 1024 \qquad\textbf{(D)}\ 768 \qquad\textbf{(E)}\ \text{none of these} $

A rectangle, with sides parallel to the $x-$axis and $y-$axis, has opposite vertices located at $(15, 3)$ and$(16, 5).$ A line is drawn through points $A(0, 0)$ and $B(3, 1).$ Another line is drawn through points $C(0, 10)$ and $D(2, 9).$ How many points on the rectangle lie on at least one of the two lines? [asy] size(9cm); draw((0,-.5)--(0,11),EndArrow(size=.15cm)); draw((1,0)--(1,11),mediumgray); draw((2,0)--(2,11),mediumgray); draw((3,0)--(3,11),mediumgray); draw((4,0)--(4,11),mediumgray); draw((5,0)--(5,11),mediumgray); draw((6,0)--(6,11),mediumgray); draw((7,0)--(7,11),mediumgray); draw((8,0)--(8,11),mediumgray); draw((9,0)--(9,11),mediumgray); draw((10,0)--(10,11),mediumgray); draw((11,0)--(11,11),mediumgray); draw((12,0)--(12,11),mediumgray); draw((13,0)--(13,11),mediumgray); draw((14,0)--(14,11),mediumgray); draw((15,0)--(15,11),mediumgray); draw((16,0)--(16,11),mediumgray); draw((-.5,0)--(17,0),EndArrow(size=.15cm)); draw((0,1)--(17,1),mediumgray); draw((0,2)--(17,2),mediumgray); draw((0,3)--(17,3),mediumgray); draw((0,4)--(17,4),mediumgray); draw((0,5)--(17,5),mediumgray); draw((0,6)--(17,6),mediumgray); draw((0,7)--(17,7),mediumgray); draw((0,8)--(17,8),mediumgray); draw((0,9)--(17,9),mediumgray); draw((0,10)--(17,10),mediumgray); draw((-.13,1)--(.13,1)); draw((-.13,2)--(.13,2)); draw((-.13,3)--(.13,3)); draw((-.13,4)--(.13,4)); draw((-.13,5)--(.13,5)); draw((-.13,6)--(.13,6)); draw((-.13,7)--(.13,7)); draw((-.13,8)--(.13,8)); draw((-.13,9)--(.13,9)); draw((-.13,10)--(.13,10)); draw((1,-.13)--(1,.13)); draw((2,-.13)--(2,.13)); draw((3,-.13)--(3,.13)); draw((4,-.13)--(4,.13)); draw((5,-.13)--(5,.13)); draw((6,-.13)--(6,.13)); draw((7,-.13)--(7,.13)); draw((8,-.13)--(8,.13)); draw((9,-.13)--(9,.13)); draw((10,-.13)--(10,.13)); draw((11,-.13)--(11,.13)); draw((12,-.13)--(12,.13)); draw((13,-.13)--(13,.13)); draw((14,-.13)--(14,.13)); draw((15,-.13)--(15,.13)); draw((16,-.13)--(16,.13)); label(scale(.7)*"$1$", (1,-.13), S); label(scale(.7)*"$2$", (2,-.13), S); label(scale(.7)*"$3$", (3,-.13), S); label(scale(.7)*"$4$", (4,-.13), S); label(scale(.7)*"$5$", (5,-.13), S); label(scale(.7)*"$6$", (6,-.13), S); label(scale(.7)*"$7$", (7,-.13), S); label(scale(.7)*"$8$", (8,-.13), S); label(scale(.7)*"$9$", (9,-.13), S); label(scale(.7)*"$10$", (10,-.13), S); label(scale(.7)*"$11$", (11,-.13), S); label(scale(.7)*"$12$", (12,-.13), S); label(scale(.7)*"$13$", (13,-.13), S); label(scale(.7)*"$14$", (14,-.13), S); label(scale(.7)*"$15$", (15,-.13), S); label(scale(.7)*"$16$", (16,-.13), S); label(scale(.7)*"$1$", (-.13,1), W); label(scale(.7)*"$2$", (-.13,2), W); label(scale(.7)*"$3$", (-.13,3), W); label(scale(.7)*"$4$", (-.13,4), W); label(scale(.7)*"$5$", (-.13,5), W); label(scale(.7)*"$6$", (-.13,6), W); label(scale(.7)*"$7$", (-.13,7), W); label(scale(.7)*"$8$", (-.13,8), W); label(scale(.7)*"$9$", (-.13,9), W); label(scale(.7)*"$10$", (-.13,10), W); dot((0,0)); label(scale(.65)*"$A$", (0,0), NE); dot((3,1)); label(scale(.65)*"$B$", (3,1), NE); dot((0,10)); label(scale(.65)*"$C$", (0,10), NE); dot((2,9)); label(scale(.65)*"$D$", (2,9), NE); draw((15,3)--(16,3)--(16,5)--(15,5)--cycle,linewidth(1.125)); dot((15,3)); dot((16,3)); dot((16,5)); dot((15,5)); [/asy] $\textbf{(A) } 0\qquad\textbf{(B) } 1\qquad\textbf{(C) } 2\qquad\textbf{(D) } 3\qquad\textbf{(E) } 4$

The Abba tribe language alphabet contains two letters only. Not a word of this language is a beginning of another word. Can this tribe vocabulary contain $3$ four-letter, $10$ five-letter, $30$ six-letter and $5$ seven-letter words?