Let $n$ be a nonnegative integer. Determine the number of ways that one can choose $(n+1)^2$ sets $S_{i,j}\subseteq\{1,2,\ldots,2n\}$, for integers $i,j$ with $0\leq i,j\leq n$, such that: [list] [*] for all $0\leq i,j\leq n$, the set $S_{i,j}$ has $i+j$ elements; and [*] $S_{i,j}\subseteq S_{k,l}$ whenever $0\leq i\leq k\leq n$ and $0\leq j\leq l\leq n$. [/list] [i]Proposed by Ricky Liu[/i]

Through point $ P $ inside triangle $ ABC $, straight lines were drawn, parallel to the sides, until they intersect with the sides. In the three resulting parallelograms, diagonals that do not contain point $ P $, are drawn. Points $ A_1 $, $ B_1 $ and $ C_1 $ are the intersection points of the lines containing these diagonals such that $A_1$ and $A$ are in different sides of line $BC$ and $B_1$ and $C_1$ are similar. Prove that if hexagon $ AC_1BA_1CB_1 $ is inscribed and convex, then point $ P $ is the orthocenter of triangle $ A_1B_1C_1 $.

The non-isosceles triangle $ABC$ is inscribed in the circle $\omega$. The tangent line to this circle at the point $C$ intersects the line $AB$ at the point $D$. Let the bisector of the angle $CDB$ intersect the segments $AC$ and $BC$ at the points $K$ and $L$, respectively. The point $M$ is on the side $AB$ such that $\frac{AK}{BL} = \frac{AM}{BM}$. Let the perpendiculars from the point $M$ to the straight lines $KL$ and $DC$ intersect the lines $AC$ and $DC$ at the points $P$ and $Q$ respectively. Prove that $2\angle CQP=\angle ACB$

Positive integers $a$ and $b$ satisfy the condition \[\log_2(\log_{2^a}(\log_{2^b}(2^{1000})))=0.\] Find the sum of all possible values of $a+b$.

For certain pairs $ (m,n)$ of positive integers with $ m\ge n$ there are exactly $ 50$ distinct positive integers $ k$ such that $ |\log m \minus{} \log k| < \log n$. Find the sum of all possible values of the product $ mn$.

In the diagram below, the circle with center $A$ is congruent to and tangent to the circle with center $B$. A third circle is tangent to the circle with center $A$ at point $C$ and passes through point $B$. Points $C$, $A$, and $B$ are collinear. The line segment $\overline{CDEFG}$ intersects the circles at the indicated points. Suppose that $DE = 6$ and $FG = 9$. Find $AG$. [asy] unitsize(5); pair A = (-9 sqrt(3), 0); pair B = (9 sqrt(3), 0); pair C = (-18 sqrt(3), 0); pair D = (-4 sqrt(3) / 3, 10 sqrt(6) / 3); pair E = (2 sqrt(3), 4 sqrt(6)); pair F = (7 sqrt(3), 5 sqrt(6)); pair G = (12 sqrt(3), 6 sqrt(6)); real r = 9sqrt(3); draw(circle(A, r)); draw(circle(B, r)); draw(circle((B + C) / 2, 3r / 2)); draw(C -- D); draw("$6$", E -- D); draw(E -- F); draw("$9$", F -- G); dot(A); dot(B); label("$A$", A, plain.E); label("$B$", B, plain.E); label("$C$", C, W); label("$D$", D, dir(160)); label("$E$", E, S); label("$F$", F, SSW); label("$G$", G, N); [/asy]

Prove that if $a$, $b$ and $c$ are integers and the sums $$\frac{a}{b}+\frac{b}{c}+\frac{c}{a} \,\,\,\, and \,\,\,\, \frac{a}{c}+\frac{c}{b}+\frac{b}{a}$$ are also integers, then we have $|a| = |v| = |c|$. (A Gribalko)

A function $g$ defined for all positive integers $n$ satisfies [list][*]$g(1) = 1$; [*]for all $n\ge 1$, either $g(n+1)=g(n)+1$ or $g(n+1)=g(n)-1$; [*]for all $n\ge 1$, $g(3n) = g(n)$; and [*]$g(k)=2001$ for some positive integer $k$.[/list] Find, with proof, the smallest possible value of $k$.

Let $C$ be a circle with two diameters intersecting at an angle of $30$ degrees. A circle $S$ is tangent to both diameters and to $C$, and has radius $1$. Find the largest possible radius of $C$.

Determine which of the prime numbers $2,3,5,7,11,13,109,151,491$ divide $z =1963^{1965} -1963$.

A sphere is tangent to six edges of a regular tetrahedron. If the length of each edge is $a$, then the volume of the sphere is________.

For any integer $n\geq 2$, let $N(n)$ be the maxima number of triples $(a_i, b_i, c_i)$, $i=1, \ldots, N(n)$, consisting of nonnegative integers $a_i$, $b_i$ and $c_i$ such that the following two conditions are satisfied: [list][*] $a_i+b_i+c_i=n$ for all $i=1, \ldots, N(n)$, [*] If $i\neq j$ then $a_i\neq a_j$, $b_i\neq b_j$ and $c_i\neq c_j$[/list] Determine $N(n)$ for all $n\geq 2$. [i]Proposed by Dan Schwarz, Romania[/i]

Prove that for each triangle, there exists a vertex, such that with the two sides starting from that vertex and each cevian starting from that vertex, is possible to construct a triangle.

Determine all integers \( x \) for which the expression \( x^2 + 10x + 160 \) is a perfect square.

Let $ n$ be a positive integer, let the sets $ A_{1},A_{2},\cdots,A_{n \plus{} 1}$ be non-empty subsets of the set $ \{1,2,\cdots,n\}.$ prove that there exist two disjoint non-empty subsets of the set $ \{1,2,\cdots,n \plus{} 1\}$: $ \{i_{1},i_{2},\cdots,i_{k}\}$ and $ \{j_{1},j_{2},\cdots,j_{m}\}$ such that $ A_{i_{1}}\cup A_{i_{2}}\cup\cdots\cup A_{i_{k}} \equal{} A_{j_{1}}\cup A_{j_{2}}\cup\cdots\cup A_{j_{m}}$.

Each of two boxes contains three chips numbered $1$, $2$, $3$. A chip is drawn randomly from each box and the numbers on the two chips are multiplied. What is the probability that their product is even? $\textbf{(A) }\frac{1}{9}\qquad\textbf{(B) }\frac{2}{9}\qquad\textbf{(C) }\frac{4}{9}\qquad\textbf{(D) }\frac{1}{2}\qquad \textbf{(E) }\frac{5}{9}$

Compute the sum of all positive integers $n$ for which the expression \[\frac{n+7}{\sqrt{n-1}}\] is an integer.

Let $a$ and $b$ be real numbers satisfying \[a^4 + 8b = 4(a^3 - 1) - 16 \sqrt{3}\] and \[b^4 + 8a = 4(b^3 - 1) + 16 \sqrt{3}.\] Find $a^4 + b^4$.

If $X$ is a finite set, let $X$ denote the number of elements in $X$. Call an ordered pair $(S,T)$ of subsets of $ \{ 1, 2, \cdots, n \} $ $ \emph {admissible} $ if $ s > |T| $ for each $ s \in S $, and $ t > |S| $ for each $ t \in T $. How many admissible ordered pairs of subsets $ \{ 1, 2, \cdots, 10 \} $ are there? Prove your answer.

There are $ m \plus{} 1$ horizontal lines and $ m$ vertical lines on the plane so that $ m(m \plus{} 1)$ intersections are made. A mark is placed at one of the $ m$ points of the lowest horizontal line. 2 players play the game of the following rules on this lines and points. 1. Each player moves a mark from a point to a point along the lines in turns. 2. The segment is erased after a mark moved along it. 3. When a player cannot make a move, then he loses. Prove that the lead always wins the game. PS I haven't found a student who solved it. There can be no one.

a tournament is playing between n persons. Everybody plays with everybody one time. There is no draw here. A number $k$ is called $n$ good if there is any tournament such that in that tournament they have any player in the tournament that has lost all of $k$'s. prove that 1. $n$ is greater than or equal to $2^{k+1}-1$ 2.Find all $n$ such that $2$ is a n-good

Find all permutations $a_1, a_2, \ldots, a_9$ of $1, 2, \ldots, 9$ such that \[ a_1+a_2+a_3+a_4=a_4+a_5+a_6+a_7= a_7+a_8+a_9+a_1 \] and \[ a_1^2+a_2^2+a_3^2+a_4^2=a_4^2+a_5^2+a_6^2+a_7^2= a_7^2+a_8^2+a_9^2+a_1^2 \]

If $\frac{a}{10^x-1}+\frac{b}{10^x+2}=\frac{2 \cdot 10^x+3}{(10^x-1)(10^x+2)}$ is an identity for positive rational values of $x$, then the value of $a-b$ is: $\textbf{(A)}\ \frac{4}{3} \qquad \textbf{(B)}\ \frac{5}{3} \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ \frac{11}{4} \qquad \textbf{(E)}\ 3$

Suppose that $$\frac{(\sqrt2)^5 + 1}{\sqrt2 + 1} \times \frac{2^5 + 1}{2 + 1} \times \frac{4^5 + 1}{4 + 1} \times \frac{16^5 + 1}{16 + 1} =\frac{m}{7 + 3\sqrt2}$$ for some integer $m$. How many $0$’s are in the binary representation of $m$? (For example, the number $20 = 10100_2$ has three $0$’s in its binary representation.)

We consider the ways to divide a $1$ by $1$ square into rectangles (of which the sides are parallel to those of the square). All rectangles must have the same circumference, but not necessarily the same shape. a) Is it possible to divide the square into 20 rectangles, each having a circumference of $2:5$? b) Is it possible to divide the square into 30 rectangles, each having a circumference of $2$?