Fuzzy draws a segment of positive length in a plane. How many locations can Fuzzy place another point in the same plane to form a non-degenerate isosceles right triangle with vertices consisting of his new point and the endpoints of the segment? [i]Proposed by Timothy Qian[/i]

For real numbers $a,b,c$, if $$a^2-bc-8a+7=b^2+c^2+bc-6a-6=0,$$ then the range value of $a$ is $\text{(A)}(-\infty,+\infty)\qquad\text{(B)}(-\infty,1]\cup[9,+\infty)\qquad\text{(C)}(0,7)\qquad\text{(D)}[1,9]$

On the plane of triangle $ABC$ with $\angle BAC = 90^\circ$ we raise perpendicular lines in $A$ and $B$, on the same side of the plane. On these two perpendicular lines we consider the points $M$ and $N$ respectively such that $BN < AM$. Knowing that $AC = 2a$, $AB = a\sqrt 3$, $AM=a$ and that the plane $MNC$ makes an angle of $30^\circ$ with the plane $ABC$ find a) the area of the triangle $MNC$; b) the distance from $B$ to the plane $MNC$.

A sequence $\{a_n\}$ is defined by $a_n=\int_0^1 x^3(1-x)^n dx\ (n=1,2,3.\cdots)$ Find the constant number $c$ such that $\sum_{n=1}^{\infty} (n+c)(a_n-a_{n+1})=\frac{1}{3}$

If $x,y$ are real, then the $\textit{absolute value}$ of the complex number $z=x+yi$ is \[|z|=\sqrt{x^2+y^2}.\] Find the number of polynomials $f(t)=A_0+A_1t+A_2t^2+A_3t^3+t^4$ such that $A_0,\ldots,A_3$ are integers and all roots of $f$ in the complex plane have absolute value $\leq 1$.

Compute the value of the sum \[ \sum_{k = 1}^{11} \frac{\sin(2^{k + 4} \pi / 89)}{\sin(2^k \pi / 89)} \, . \]

Evaluate $\tfrac1{\sqrt1+\sqrt2}+\tfrac1{\sqrt2+\sqrt3}+\cdots+\tfrac1{\sqrt{1368}+\sqrt{1369}}$.

Fill in each cell of the grid with one of the numbers 1, 2, or 3. After all numbers are filled in, if a row, column, or any diagonal has a number of cells equal to a multiple of 3, then it must have the same amount of 1’s, 2’s, and 3’s. (There are 10 such diagonals, and they are all marked in the grid by a gray dashed line.) Some numbers have been given to you. [asy] defaultpen(linewidth(0.45)); real[][] arr = { {0, 2, 1, 0, 0, 0, 0, 0, 0}, {3, 0, 0, 2, 0, 0, 0, 0, 0}, {0, 0, 0, 2, 0, 0, 3, 2, 0}, {0, 2, 1, 0, 0, 1, 0, 0, 3}, {3, 0, 0, 0, 0, 3, 0, 0, 3}, {2, 0, 0, 0, 0, 0, 2, 3, 0}, {3, 2, 3, 2, 0, 2, 0, 0, 3}, {0, 0, 0, 0, 0, 3, 0, 0, 1}, {0, 0, 0, 0, 0, 0, 1, 3, 0}}; for (int i=0; i<9; ++i){ for (int j=0; j<9; ++j){ draw((i,j)--(i+1,j)--(i+1, j+1)--(i,j+1)--cycle); if(arr[8-j][i] != 0){ label((string) arr[8-j][i], (i+0.5, j+0.5)); } } } draw((3,0)--(0,3), linetype(new real[] {4,4})+grey); draw((6,0)--(0,6), linetype(new real[] {4,4})+grey); draw((9,0)--(0,9), linetype(new real[] {4,4})+grey); draw((3,9)--(9,3), linetype(new real[] {4,4})+grey); draw((6,9)--(9,6), linetype(new real[] {4,4})+grey); draw((6,0)--(9,3), linetype(new real[] {4,4})+grey); draw((3,0)--(9,6), linetype(new real[] {4,4})+grey); draw((0,0)--(9,9), linetype(new real[] {4,4})+grey); draw((0,3)--(6,9), linetype(new real[] {4,4})+grey); draw((0,6)--(3,9), linetype(new real[] {4,4})+grey); [/asy] You do not need to prove that your answer is the only one possible; you merely need to find an answer that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.)

Let $BC$ be a fixed chord of a circle $\omega$. Let $A$ be a variable point on the major arc $BC$ of $\omega$. Let $H$ be the orthocenter of $ABC$. The points $D, E$ lie on $AB, AC$ such that $H$ is the midpoint of $DE$. $O_A$ is the circumcenter of $ADE$. Prove that as $A$ varies, $O_A$ lies on a fixed circle.

Points $P$ and $Q$ are taken sides $AB$ and $AC$ of a triangle $ABC$ respectively such that $\hat{APC}=\hat{AQB}=45^{0}$. The line through $P$ perpendicular to $AB$ intersects $BQ$ at $S$, and the line through $Q$ perpendicular to $AC$ intersects $CP$ at $R$. Let $D$ be the foot of the altitude of triangle $ABC$ from $A$. Prove that $SR\parallel BC$ and $PS,AD,QR$ are concurrent.

Let $p \geq 5$ be a prime number. Prove that there exist at least 2 distinct primes $q_1, q_2$ satisfying $1 < q_i < p - 1$ and $q_i^{p-1} \not\equiv 1 \mbox{ (mod }p^2)$, for $i = 1, 2$.

Towns $A$, $B$ and $C$ are connected with a telecommunications cable. If you for example want to send a message from $A$ to $B$ is assigned to either a direct line between $A$ and $B$, or if necessary, a line via $C$. There are $43$ lines between $A$ and $B$, including those who go through $C$, and $29$ lines between $B$ and $C$, including those who go via $A$. How many lines, are there between $A$ and $C$ (including those who go via $B$)?

Consider the equilateral triangle $ABC$ with $|BC| = |CA| = |AB| = 1$. On the extension of side $BC$, we define points $A_1$ (on the same side as B) and $A_2$ (on the same side as C) such that $|A_1B| = |BC| = |CA_2| = 1$. Similarly, we define $B_1$ and $B_2$ on the extension of side $CA$ such that $|B_1C| = |CA| =|AB_2| = 1$, and $C_1$ and $C_2$ on the extension of side $AB$ such that $|C_1A| = |AB| = |BC_2| = 1$. Now the circumcentre of 4ABC is also the centre of the circle that passes through the points $A_1,B_2,C_1,A_2,B_1$ and $C_2$. Calculate the radius of the circle through $A_1,B_2,C_1,A_2,B_1$ and $C_2$. [asy] unitsize(1.5 cm); pair[] A, B, C; A[0] = (0,0); B[0] = (1,0); C[0] = dir(60); A[1] = B[0] + dir(-60); A[2] = C[0] + dir(120); B[1] = C[0] + dir(60); B[2] = A[0] + dir(240); C[1] = A[0] + (-1,0); C[2] = B[0] + (1,0); draw(A[1]--A[2]); draw(B[1]--B[2]); draw(C[1]--C[2]); draw(circumcircle(A[2],B[1],C[2])); dot("$A$", A[0], SE); dot("$A_1$", A[1], SE); dot("$A_2$", A[2], NW); dot("$B$", B[0], SW); dot("$B_1$", B[1], NE); dot("$B_2$", B[2], SW); dot("$C$", C[0], N); dot("$C_1$", C[1], W); dot("$C_2$", C[2], E); [/asy]

Given that $a,b,c$ are integers with $abc = 60$, and that complex number $\omega \neq 1$ satisfies $\omega^3=1$, find the minimum possible value of $|a + b\omega + c\omega^2|$.  

Find all composite positive integers $a{}$ for which there exists a positive integer $b\geqslant a$ with the same number of divisors as $a{}$ with the following property: if $a_1<\cdots<a_n$ and $b_1<\cdots<b_n$ are the proper divisors of $a{}$ and $b{}$ respectively, then $a_i+b_i, 1\leqslant i\leqslant n$ are the proper divisors of some positive integer $c.{}$

A natural number $n$ is said to have the property $P$, if whenever $n$ divides $a^{n}-1$ for some integer $a$, $n^2$ also necessarily divides $a^{n}-1$. [list=a] [*] Show that every prime number $n$ has the property $P$. [*] Show that there are infinitely many composite numbers $n$ that possess the property $P$. [/list]

Evaluate the following expression: $2013^2 + 2011^2 + … + 5^2 + 3^2 -2012^2 -2010^2-…-4^2-2^2$