A segment of unit length is cut into eleven smaller segments, each with length of no more than $a$. For what values of $a$, can one guarantee that any three segments form a triangle? [i](4 points)[/i]

The sum of $n > 2$ nonzero real numbers (not necessarily distinct) equals zero. For each of the $2^n - 1$ ways to choose one or more of these numbers, their sums are written in non-increasing order in a row. The first number in the row is $S$. Find the smallest possible value of the second number.

Define the functions $g_k \colon \mathbb{Z} \to \mathbb{Z}$, $g_k(x) = x^k$, where $k$ is a positive integer. Find the set $M_k$ of positive integers $n$ for which there exist injective functions $f_1,f_2, \dots ,f_n \colon \mathbb{Z} \to \mathbb{Z}$ such that $g_k=f_1\cdot f_2 \cdot \ldots \cdot f_n$. (Here, $\cdot$ denotes component-wise function multiplication)

There are $20$ points marked on a circle. Two players take turns drawing chords with ends at marked points that do not intersect the already drawn chords. The one who cannot make the next move loses. Who can secure their win?

$M$ is midpoint of $BC$.$P$ is an arbitary point on $BC$. $C_{1}$ is tangent to big circle.Suppose radius of $C_{1}$ is $r_{1}$ Radius of $C_{4}$ is equal to radius of $C_{1}$ and $C_{4}$ is tangent to $BC$ at P. $C_{2}$ and $C_{3}$ are tangent to big circle and line $BC$ and circle $C_{4}$. [img]http://aycu01.webshots.com/image/4120/2005120338156776027_rs.jpg[/img] Prove : \[r_{1}+r_{2}+r_{3}=R\] ($R$ radius of big circle)

$(GDR 3)$ Find the number of permutations $a_1, \cdots, a_n$ of the set $\{1, 2, . . ., n\}$ such that $|a_i - a_{i+1}| \neq 1$ for all $i = 1, 2, . . ., n - 1.$ Find a recurrence formula and evaluate the number of such permutations for $n \le 6.$

Find all non-negative integers $m,n,p,q$ such that \[ p^mq^n = (p+q)^2 +1 . \]

Let $n$ be an integer greater than $2$ and consider the set \begin{align*} A = \{2^n-1,3^n-1,\dots,(n-1)^n-1\}. \end{align*} Given that $n$ does not divide any element of $A$, prove that $n$ is a square-free number. Does it necessarily follow that $n$ is a prime?

The number of four-digit odd numbers having digits $1,2,3,4$, each occuring exactly once, is:

A [i]lame king[/i] is a chess piece that can move from a cell to any cell that shares at least one vertex with it, except for the cells in the same column as the current cell. A lame king is placed in the top-left cell of a $7\times 7$ grid. Compute the maximum number of cells it can visit without visiting the same cell twice (including its starting cell).

We are given an acute triangle $ABC$ with $AB\neq AC$. Let $D$ be a point of $BC$ such that $DA$ is tangent to the circumcircle of $ABC$. Let $E$ and $F$ be the circumcenters of triangles $ABD$ and $ACD$, respectively, and let $M$ be the midpoints $EF$. Prove that the line tangent to the circumcircle of $AMD$ through $D$ is also tangent to the circumcircle of $ABC$. [i]Proposed by Patrik Bak, Slovakia[/i]

On a horizontal line, $2005$ points are marked, each of which is either white or black. For every point, one finds the sum of the number of white points on the right of it and the number of black points on the left of it. Among the $2005$ sums, exactly one number occurs an odd number of times. Find all possible values of this number.

What is the maximum displacement from start for the toy car? (a) $\text{3 m}$ (b) $\text{5 m}$ (c) $\text{6.5 m}$ (d) $\text{7 m}$ (e) $\text{7.5 m}$

For every $n$ in the set $\mathrm{N} = \{1,2,\dots \}$ of positive integers, let $r_n$ be the minimum value of $|c-d\sqrt{3}|$ for all nonnegative integers $c$ and $d$ with $c+d=n$. Find, with proof, the smallest positive real number $g$ with $r_n \leq g$ for all $n \in \mathbb{N}$.

Given 11 natural numbers under 21, show that you can choose two such that one divides the other.

Find all functions $f: N_0 \to N_0$, (where $N_0$ is the set of all non-negative integers) such that $f(f(n))=f(n)+1$ for all $n \in N_0$ and the minimum of the set $\{ f(0), f(1), f(2) \cdots \}$ is $1$.

Bamicin is initially at $(20, 20)$ in a cartesian plane. Every minute, if Bamicin is at point $P$, Bamicin can move to a lattice point exactly $37$ units from $P$. Determine all lattice points Bamicin can visit.

How many line segments have both their endpoints located at the vertices of a given cube? $\text{(A)}\ 12 \qquad \text{(B)}\ 15 \qquad \text{(C)}\ 24 \qquad \text{(D)}\ 28\qquad \text{(E)}\ 56$

Let $D$ be a point on the small arc $AC$ of the circumcircle of an equilateral triangle $ABC$, different from $A$ and $C$. Let $E$ and $F$ be the projections of $D$ onto $BC$ and $AC$ respectively. Find the locus of the intersection point of $EF$ and $OD$, where $O$ is the center of $ABC$.

Let $A,B,C,D$ denote four points in space such that at most one of the distances $AB,AC,AD,BC,BD,CD$ is greater than $1$. Determine the maximum value of the sum of the six distances.

Let $ABCD$ be a rectangle. Let $K,L$ be the midpoints of $BC, AD$ respectively. From point $B$ the perpendicular line on $AK$, intersects $AK$ at point $E$ and $CL$ at point $Z$. a) Prove that the quadrilateral $AKZL$ is an isosceles trapezoid b) Prove that $2S_{ABKZ}=S_{ABCD}$ c) If quadrilateral $ABCD$ is a square of side $a$, calculate the area of the isosceles trapezoid $AKZL$ in terms of side $BC=a$

[b]p10.[/b] Three rectangles of dimension $X \times 2$ and four rectangles of dimension $Y \times 1$ are the pieces that form a rectangle of area $3XY$ where $X$ and $Y$ are positive, integer values. What is the sum of all possible values of $X$? [b]p11.[/b] Suppose we have a polynomial $p(x) = x^2 + ax + b$ with real coefficients $a + b = 1000$ and $b > 0$. Find the smallest possible value of $b$ such that $p(x)$ has two integer roots. [b]p12.[/b] Ten square slips of paper of the same size, numbered $0, 1, 2, ..., 9$, are placed into a bag. Four of these squares are then randomly chosen and placed into a two-by-two grid of squares. What is the probability that the numbers in every pair of blocks sharing a side have an absolute difference no greater than two? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\times$ represent the cross product in $\mathbb{R}^3.$ For what positive integers $n$ does there exist a set $S \subset \mathbb{R}^3$ with exactly $n$ elements such that $$S=\{v \times w: v, w \in S\}?$$

Determine all integers $n > 1$ such that \[\frac{2^{n}+1}{n^{2}}\] is an integer.

Let $\omega_1$ and $\omega_2$ be two circles with centers $O_1$ and $O_2$. The two circles intersect at $A$ and $B$. $\ell$ is the circles' common external tangent that is closer to $B$, and it meets $\omega_1$ at $T_1$ and $\omega_2$ at $T_2$. Let $C$ be the point on line $AB$ not equal to $A$ that is the same distance from $\ell$ as $A$ is. Given that $O_1O_2=15$, $AT_1=5$ and $AT_2=12$, find $AC^2+{T_1T_2}^2$. [i]Proposed by Zachary Perry[/i]