Let a quardilateral $ABCD$ with $AB=AD$ and $\widehat B=\widehat D=90$. At $CD$ we take point $E$ and at $BC$ we take point $Z$ such that $AE\bot DZ$. Prove that $AZ\bot BE$

The altitudes of a tetrahedron $ABCD$ are extended externally to points $A'$, $B'$, $C'$, and $D'$, where $AA' = k/h_a$, $BB' = k/h_b$, $CC' = k/h_c$, and $DD' = k/h_d$. Here, $k$ is a constant and $h_a$ denotes the length of the altitude of $ABCD$ from vertex $A$, etc. Prove that the centroid of tetrahedron $A'B'C'D'$ coincides with the centroid of $ABCD$.

In an acute triangle $\triangle{ABC}$, let $AE$ and $BF$ be highs of it, and $H$ its orthocenter. The symmetric line of $AE$ with respect to the angle bisector of $\sphericalangle{A}$ and the symmetric line of $BF$ with respect to the angle bisector of $\sphericalangle{B}$ intersect each other on the point $O$. The lines $AE$ and $AO$ intersect again the circuncircle to $\triangle{ABC}$ on the points $M$ and $N$ respectively. Let $P$ be the intersection of $BC$ with $HN$; $R$ the intersection of $BC$ with $OM$; and $S$ the intersection of $HR$ with $OP$. Show that $AHSO$ is a paralelogram.

A cube with side length $ 1$ is sliced by a plane that passes through two diagonally opposite vertices $ A$ and $ C$ and the midpoints $ B$ and $ D$ of two opposite edges not containing $ A$ and $ C$, ac shown. What is the area of quadrilateral $ ABCD$? [asy]import three; size(200); defaultpen(fontsize(8)+linewidth(0.7)); currentprojection=obliqueX; dotfactor=4; draw((0.5,0,0)--(0,0,0)--(0,0,1)--(0,0,0)--(0,1,0),linetype("4 4")); draw((0.5,0,1)--(0,0,1)--(0,1,1)--(0.5,1,1)--(0.5,0,1)--(0.5,0,0)--(0.5,1,0)--(0.5,1,1)); draw((0.5,1,0)--(0,1,0)--(0,1,1)); dot((0.5,0,0)); label("$A$",(0.5,0,0),WSW); dot((0,1,1)); label("$C$",(0,1,1),NE); dot((0.5,1,0.5)); label("$D$",(0.5,1,0.5),ESE); dot((0,0,0.5)); label("$B$",(0,0,0.5),NW);[/asy]$ \textbf{(A)}\ \frac {\sqrt6}{2} \qquad \textbf{(B)}\ \frac {5}{4} \qquad \textbf{(C)}\ \sqrt2 \qquad \textbf{(D)}\ \frac {3}{2} \qquad \textbf{(E)}\ \sqrt3$

Let $n$ be a positive integer. Suppose we are given $2^n+1$ distinct sets, each containing finitely many objects. Place each set into one of two categories, the red sets and the blue sets, so that there is at least one set in each category. We define the [i]symmetric difference[/i] of two sets as the set of objects belonging to exactly one of the two sets. Prove that there are at least $2^n$ different sets which can be obtained as the symmetric difference of a red set and a blue set.

In rectangle $ ABCD$, we have $ A \equal{} (6, \minus{} 22)$, $ B \equal{} (2006,178)$, and $ D \equal{} (8,y)$, for some integer $ y$. What is the area of rectangle $ ABCD$? $ \textbf{(A) } 4000 \qquad \textbf{(B) } 4040 \qquad \textbf{(C) } 4400 \qquad \textbf{(D) } 40,000 \qquad \textbf{(E) } 40,400$

Let $ABC$ be a triangle with orthocenter $H$, incenter $I$ and centroid $S$, and let $d$ be the diameter of the circumcircle of triangle $ABC$. Prove the inequality \[9\cdot HS^2+4\left(AH\cdot AI+BH\cdot BI+CH\cdot CI\right)\geq 3d^2,\] and determine when equality holds.

Last year, Master Cheung is famous for multi-rotation. This year, he comes to DAMO to make noodles for sweeping monk. One day, software engineer Xiao Li talks with Master Cheung about his job. Xiao Li mainly researches and designs the algorithm to adjust the paramter of different kinds of products. These paramters can normally be obtainly by minimising loss function $f$ on $\mathbb{R}^n$. In the recent project of Xiao Li, this loss function is obtained by other topics. For safety consideration and technique reasons, this topic makes Xiao Li difficult to find the interal details of the function. They only provide a port to calculate the value of $f(\text x)$ for any $\text x\in\mathbb{R}^n$. Therefore, Xiao Li must only use the value of the function to minimise $f$. Also, every times calculating the value of $f$ will use a lot of calculating resources. It is good to know that the dimension $n$ is not very high (around $10$). Also, colleague who provides the function tells Xiao Li to assume $f$ is smooth first. This problem reminds Master Cheung of his antique radio. If you want to hear a programme from the radio, you need to turn the knob of the radio carefully. At the same time, you need to pay attention to the quality of the radio received, until the quality is the best. In this process, no one knows the relationship between the angle of turning the knob and the quality of the radio received. Master Cheung and Xiao Li realizes that minimising $f$ is same as adjusting the machine with multiple knobs: Assume every weight of $\text x$ is controlled by a knob. $f(\text x)$ is a certain performance of the machine. We only need to adjust every knobs again and again and observes the value of $f$ in the same time. Maybe there is hope to find the best $\text x$. As a result, two people suggest an iteration algorithm (named Automated Forward/Backward Tuning, $\text{AFBT}$, to minimise $f$. In $k$-th iteration, the algorithm adjusts the individual weight of $\text{x}_k$ to $2n$ points $\{\text x_k\pm t_k\text e^i:i=1,...,n\}$, where $t_k$ is the step size; then, make $y_k$ be the smallest one among the value of the function of thosse points. Then check if $\text y_k$ sufficiently makes $f$ decrease; then, take $\text x_{k+1}=\text y_k$, then make the step size doubled. Otherwise, make $\text x_{k+1}=\text x_k$ and makes the step size decrease in half. In the algorithm, $\text e^i$ is the $i$-th coordinate vector in $\mathbb{R}^n$. The weight of $i$-th is $1$. Others are $0$; $\mathbf{1}(\cdot)$ is indicator function. If $f(\text x_k)-f(\text y_k)$ is at least the square of $t_k$, then take the value of $\mathbf{1}(f(\text k)-f(y_k)\ge t^2_k)$ as $1$. Otherwise, take it as $0$. $\text{AFBT}$ algorithm Input $\text{x}_0\in \mathbb{R}^n$, $t_0>0$. For $k=0, 1, 2, ...$, perform the following loop: 1: #Calculate loss function. 2: $s_k:=\mathbb{1}[f(\text{x}_k)-f(\text{y}_k)\ge t^2_k]$ #Is it sufficiently decreasing? Yes: $s_k=1$; No: $s_k=0$. 3: $\text{x}_{k+1}:=(1-s_k)\text{x}_k+s_k\text{y}_k$ #Update the point of iteration. 4: $t_{k+1}:=2^{2S_k-1}t_k$ #Update step size. $s_k=1$: Step size doubles; $s_k=0$: Step size decreases by half. Now, we made assumption to the loss function $f:\mathbb{R}^n\to \mathbb{R}$. Assumption 1. Let $f$ be a convex function. For any $\text{x}, \text{y}\in \mathbb{R}^n$ and $\alpha \in [0, 1]$, we have $f((1-\alpha)\text{x}+\text{y})\le (1-\alpha)f(\text{x})+\alpha f(\text{y})$. Assumption 2. $f$ is differentiable on $\mathbb{R}^n$ and $\nabla f$ is L-Lipschitz continuous on $\mathbb{R}^n$. Assumption 3. The level set of $f$ is bounded. For any $\lambda\in\mathbb{R}$, set $\{\text x\in \mathbb{R}^n:f(\text x)\le \lambda\}$ is all bounded. Based on assumption 1 and 2, we can prove that $\left\langle \nabla f(\text x),\text y-\text x \right\rangle \le f(\text y)-f(\text x)\le \left\langle \nabla f(\text x),\text y-\text x\right\rangle+\frac{L}{2}||\text x-\text y||^2$ You can refer to any convex analysis textbook for more properties of convex function. Prove that under the assumption 1-3, for $AFBT$, $\lim_{k \to \infty}f(\text{x}_k)=f^*$

Let $\Delta$ be a convex figure in a plane $\mathcal P$. Given a point $A\in\mathcal P$, to each pair $(M,N)$ of points in $\Delta$ we associate the point $m\in\mathcal P$ such that $\overrightarrow{Am}=\frac{\overrightarrow{MN}}2$ and denote by $\delta_A(\Delta)$ the set of all so obtained points $m$. (a) i. Prove that $\delta_A(\Delta)$ is centrally symmetric. ii. Under which conditions is $\delta_A(\Delta)=\Delta$? iii. Let $B,C$ be points in $\mathcal P$. Find a transformation which sends $\delta_B(\Delta)$ to $\delta_C(\Delta)$. (b) Determine $\delta_A(\Delta)$ if i. $\Delta$ is a set in the plane determined by two parallel lines. ii. $\Delta$ is bounded by a triangle. iii. $\Delta$ is a semi-disk. (c) Prove that in the cases $b.2$ and $b.3$ the lengths of the boundaries of $\Delta$ and $\delta_A(\Delta)$ are equal.

Point $O$ is the origin of a space. Points $A_1, A_2,\dots, A_n$ have nonnegative coordinates. Prove the following inequality: $$|\overrightarrow{OA_1}|+|\overrightarrow {OA_2}|+\dots+|\overrightarrow {OA_n}|\leq \sqrt{3}|\overrightarrow {OA_1}+\overrightarrow{OA_2}+\dots+\overrightarrow{OA_n}|$$ [I]Proposed by A. Khrabrov[/i]

On the sides $BC$, $CA$, $AB$ of an acute-angled triangle $ABC$, we erect (outwardly) the squares $BB_aC_aC$, $CC_bA_bA$, $AA_cB_cB$, respectively. On the sides $B_cB_a$ and $C_aC_b$ of the triangles $BB_cB_a$ and $CC_aC_b$, we erect (outwardly) the squares $B_cB_vB_uB_a$ and $C_aC_uC_vC_b$. Prove that $B_uC_u\parallel BC$. [i]Comment.[/i] This problem originates in the 68th Moscow MO 2005, and a solution was posted in http://www.mathlinks.ro/Forum/viewtopic.php?t=30184 . However ingenious this solution is, there is a different one which shows a bit more: $B_uC_u=4\cdot BC$. Darij

Suppose $V= \mathbb{Z}_2^n$ and for a vector $x=(x_1,..x_n)$ in $V$ and permutation $\sigma$.We have $x_{\sigma}=(x_{\sigma(1)},...,x_{\sigma(n)})$ Suppose $ n=4k+2,4k+3$ and $f:V \to V$ is injective and if $x$ and $y$ differ in more than $n/2$ places then $f(x)$ and $f(y)$ differ in more than $n/2$ places. Prove there exist permutaion $\sigma$ and vector $v$ that $f(x)=x_{\sigma}+v$

For each pair of integers $(i,k)$ such that $1\le i\le k$, the linear transformation $P_{i,k}:\mathbb{R}^k\to\mathbb{R}^k$ is defined as: $P_{i,k}(a_1,\cdots,a_{i-1},a_i,a_{i+1},\cdots,a_k)=(a_1,\cdots,a_{i-1},0,a_{i+1},\cdots,a_k)$ Prove that for all $n\ge2$ and for every set of $n-1$ linearly independent vectors $v_1,\cdots,v_{n-1}$ in $\mathbb{R}^n$, there is an integer $k$ such that $1\le k\le n$ and such that the vectors $P_{k,n}(v_1),\cdots,P_{k,n}(v_{n-1})$ are linearly independent.

Find the minimum value of $\int_0^{\pi} (a\sin x+b\sin 2x+c\sin 3x-x)^2\ dx$

Let $a_{i}$ and $b_{i}$ ($i=1,2, \cdots, n$) be rational numbers such that for any real number $x$ there is: \[x^{2}+x+4=\sum_{i=1}^{n}(a_{i}x+b)^{2}\] Find the least possible value of $n$.

Find the angle between two common sections of the page $2x+y-z=0$ and the cone $4x^2-y^2+3z^2=0.$

The centre $O$ of the circumcircle of $\vartriangle ABC$ lies inside the triangle. Perpendiculars are drawn rom $O$ on the sides. When produced beyond the sides they meet the circumcircle at points $K, M$ and $P$. Prove that $\overrightarrow{OK} + \overrightarrow{OM} + \overrightarrow{OP} = \overrightarrow{OI}$, where $I$ is the centre of the inscribed circle of $\vartriangle ABC$. (V Galperin, Moscow)

Let $ABCDEF$ be a convex hexagon, and let $P= AB \cap CD$, $Q = CD \cap EF$, $R = EF \cap AB$, $S = BC \cap DE$, $T = DE \cap FA$, $U = FA \cap BC$. Prove that $\frac{PQ}{CD} = \frac{QR}{EF} = \frac{RP}{AB}$ if and only if $\frac{ST}{DE} = \frac{TU}{FA} = \frac{US}{BC}$

Let $ABCD$ be a convex quadrilateral.Let diagonals $AC$ and $BD$ intersect at $P$. Let $PE,PF,PG$ and $PH$ are altitudes from $P$ on the side $AB,BC,CD$ and $DA$ respectively. Show that $ABCD$ has a incircle if and only if $\frac{1}{PE}+\frac{1}{PG}=\frac{1}{PF}+\frac{1}{PH}.$

In triangle $ABC$ we havev $\angle A=\frac{\pi}{3}$. Construct $E$ and $F$ on continue of $AB$ and $AC$ respectively such that $BE=CF=BC$. Suppose that $EF$ meets circumcircle of $\triangle ACE$ in $K$. ($K\not \equiv E$). Prove that $K$ is on the bisector of $\angle A$.

Let $v_{0}$ be the zero ector and let $v_{1},...,v_{n+1}\in\mathbb{R}^{n}$ such that the Euclidian norm $|v_{i}-v_{j}|$ is rational for all $0\le i,j\le n+1$. Prove that $v_{1},...,v_{n+1}$ are linearly dependent over the rationals.

21 people take a test with 15 true or false questions. It is known that every 2 people have at least 1 correct answer in common. What is the minimum number of people that could have correctly answered the question which the most people were correct on?

Given a table with $2^n * n$ 1*1 squares ( $2^n$ rows and n column). In any square we put a number in {1, -1} such that no two rows are the same. Then we change numbers in some squares by 0. Prove that in new table we can choose some rows such that sum of all numbers in these rows equal to 0.

Let $S$ be the unit circle with center $O$ and let $P_1, P_2,\ldots, P_n$ be points of $S$ such that the sum of vectors $v_i=\stackrel{\longrightarrow}{OP_i}$ is the zero vector. Prove that the inequality $\sum_{i=1}^n XP_i \geq n$ holds for every point $X$.

We consider three vectors drawn from the same initial point $O,$ of lengths $a,b$ and $c$, respectively. Let $E$ be the parallelepiped with vertex $O$ of which the given vectors are the edges and $H$ the parallelepiped with vertex $O$ of which the given vectors are the altitudes. Show that the product of the volumes of $E$ and $H$ equals $(abc)^{2}$ and generalize this result to $n$ dimensions.