Show that among any $n\geq 3$ vertices of a regular $(2n-1)$-gon we can find $3$ of them forming an isosceles triangle.

You can inscribe a circle in the pentagon $ABCDE$. It is also known that $\angle ABC = \angle BAE = \angle CDE = 90^o$. Find the measure of the angle $ADB$.

Given a square $ABCD$ with side $1$, and a square inside $ABCD$ with side $x$, find (in terms of $x$) the radio $r$ of the circle tangent to two sides of $ABCD$ and touches the square with side $x$. (See picture).

Assume a triangle $ABC$ satisfies $|AB| = 1, |AC| = 2$ and $\angle ABC = \angle ACB + 90^\circ.$ What is the area of $ABC?$ \[ \mathrm a. ~ 6/7\qquad \mathrm b.~5/7\qquad \mathrm c. ~1/2 \qquad \mathrm d. ~4/5 \qquad \mathrm e. ~3/5 \]

The four bottom corners of a cube are colored red, green, blue, and purple. How many ways are there to color the top four corners of the cube so that every face has four different colored corners? Prove that your answer is correct.

Assume that a face of a convex polyhedron $ P$ has a common edge with every other face. Show that there exists a simple closed polygon that consists of edges of $ P$ and passes through all vertices. [i]L .Lovasz[/i]

In $\triangle ABC$ with incenter $I$, $AB = 61$, $AC = 51$, and $BC=71$. The circumcircles of triangles $AIB$ and $AIC$ meet line $BC$ at points $D$ ($D \neq B$) and $E$ ($E \neq C$), respectively. Determine the length of segment $DE$. [i]James Tao[/i]

Fencing Ferdinand wants to fence three rectangular areas. there are fences in three types, with $4$ amount of fences of each type. You will notice that there is always at least as much area it manages to enclose a total of three by enclosing three square areas (i.e., each area fencing elements of the same size to enclose it) as if it were three different, rectangular would encircle an area (i.e., use two different elements for each of the three areas). Why is this is so? When does it not matter how he fences the rectangles, in terms of the sum of the areas?

Given a triangle $ABC$, $BC = 2 \cdot AC$. Point $M$ is the midpoint of side $ BC$ and point $D$ lies on $AB$, with $AD = 2 \cdot BD$. Prove that the lines $AM$ and $MD$ are perpendicular.

In the cube $ABCDA'B'C'D'$, with side $a$, the plane $(AB'D')$ intersects the planes $(A'BC),(A'CD),(A'DB)$ after the lines $d_1,d_2$ and $d_3$ respectively. a) Show that the lines $d_1,d_2,d_3$ intersect pairwise. b) Determine the area of the triangle formed by these three lines.

Let $ABCD$ be a square. Let $N,P$ be two points on sides $AB, AD$, respectively such that $NP=NC$, and let $Q$ be a point on $AN$ such that $\angle QPN = \angle NCB$. Prove that \[ \angle BCQ = \dfrac{1}{2} \angle AQP .\]

Can we say that two triangles are congruent if the radii of the inscribed circles, the radii of the circumscribed circles, and the areas of these triangles are equal?

$\vartriangle ABC$ is a triangle, $M$ the midpoint of $BC, D$ the projection of $M$ on $AC$ and $E$ the midppoint of $MD$. Prove that the lines $AE,BD$ are orthogonal if and only if $AB = AC$.

Consider a trapezium $ ABCD $ in which $ AB\parallel CD. $ Show that $$ (AC^2+AB^2-BC^2)(BD^2-BC^2+CD^2) =(AC^2-AD^2+CD^2)(BD^2+AB^2-AD^2) . $$

Let $ABC$ be an acute-angled triangle with $AB \ne BC$ and radius $k$. Let $P$ and $Q$ be the points of intersection of $k$ with the internal bisector and the external bisector of $\angle CBA$ respectively. Let $D$ be the intersection of $AC$ and $PQ$. Find the ratio $AD: DC$.

Consider 2 concentric circle radii $ R$ and $ r$ ($ R > r$) with centre $ O.$ Fix $ P$ on the small circle and consider the variable chord $ PA$ of the small circle. Points $ B$ and $ C$ lie on the large circle; $ B,P,C$ are collinear and $ BC$ is perpendicular to $ AP.$ [b]i.)[/b] For which values of $ \angle OPA$ is the sum $ BC^2 \plus{} CA^2 \plus{} AB^2$ extremal? [b]ii.)[/b] What are the possible positions of the midpoints $ U$ of $ BA$ and $ V$ of $ AC$ as $ \angle OPA$ varies?

A strip of width $w$ is the set of all points which lie on, or between, two parallel lines distance $w$ apart. Let $S$ be a set of $n$ ($n \ge 3$) points on the plane such that any three different points of $S$ can be covered by a strip of width $1$. Prove that $S$ can be covered by a strip of width $2$.

Let $ P$ be a polyhedron whose all edges are congruent and tangent to a sphere. Suppose that one of the facesof $ P$ has an odd number of sides. Prove that all vertices of $ P$ lie on a single sphere.

Let $ABC$ be a triangle with circumcircle $k$. The points $A_1, B_1,$ and $C_1$ on $k$ are the midpoints of arcs $\widehat{BC}$ (not containing $A$), $\widehat{AC}$ (not containing $B$), and $\widehat{AB}$ (not containing $C$), respectively. The pairwise distinct points $A_2, B_2,$ and $C_2$ are chosen such that the quadrilaterals $AB_1A_2C_1, BA_1B_2C_1,$ and $CA_1C_2B_1$ are parallelograms. Prove that $k$ and the circumcircle of triangle $A_2B_2C_2$ have a common center. [b]Comment.[/b] Point $A_2$ can also be defined as the reflection of $A$ with respect to the midpoint of $B_1C_1$, and analogous definitions can be used for $B_2$ and $C_2$.

Prove that in the Euclidean plane every regular polygon having an even number of sides can be dissected into lozenges. (A lozenge is a quadrilateral whose four sides are all of equal length).

Given a rectangle $ ABCD,$ let $ AB \equal{} b, AD \equal{} a ( a\geq b),$ three points $ X,Y,Z$ are put inside or on the boundary of the rectangle, arbitrarily. Find the maximum of the minimum of the distances between any two points among the three points. (Denote it by $ a,b$)

Let ABC be a triangle and let $r, r_a, r_b, r_c$ denote the inradius and ex-radii opposite to the vertices $A, B, C$, respectively. Suppose that $a>r_a, b>r_b, c>r_c$. Prove that [b](a)[/b] $\triangle ABC$ is acute. [b](b)[/b] $a+b+c > r+r_a+r_b+r_c$.

Two parallel chords in a circle have lengths $10$ and $14$, and the distance between them is $6$. The chord parallel to these chords and midway between them is of length $\sqrt{a}$ where $a$ is [asy] // note: diagram deliberately not to scale -- azjps void htick(pair A, pair B, real r){ D(A--B); D(A-(r,0)--A+(r,0)); D(B-(r,0)--B+(r,0)); } size(120); pathpen = linewidth(0.7); pointpen = black+linewidth(3); real min = -0.6, step = 0.5; pair[] A, B; D(unitcircle); for(int i = 0; i < 3; ++i) { A.push(intersectionpoints((-9,min+i*step)--(9,min+i*step),unitcircle)[0]); B.push(intersectionpoints((-9,min+i*step)--(9,min+i*step),unitcircle)[1]); D(D(A[i])--D(B[i])); } MP("10",(A[0]+B[0])/2,N); MP("\sqrt{a}",(A[1]+B[1])/2,N); MP("14",(A[2]+B[2])/2,N); htick((B[1].x+0.1,B[0].y),(B[1].x+0.1,B[2].y),0.06); MP("6",(B[1].x+0.1,B[0].y/2+B[2].y/2),E);[/asy] $\textbf{(A)}\ 144 \qquad \textbf{(B)}\ 156 \qquad \textbf{(C)}\ 168 \qquad \textbf{(D)}\ 176 \qquad \textbf{(E)}\ 184$

A $\vartriangle ABC$ is given with $\angle A = 70^o$. The angle bisectors of $\vartriangle ABC$ intersect at $I$. Suppose that $CA + AI=BC$. Find, with proof, the value of $\angle B$.

a) A castle is equilateral triangle with the side of $100$ metres. It is divided onto $100$ triangle rooms. Each wall between the rooms is $10$ metres long and contain one door. You are inside and are allowed to pass through every door not more than once. Prove that you can visit not more than $91$ room (not exiting the castle). b) Every side of the triangle is divided onto $k$ parts by the lines parallel to the sides. And the triangle is divided onto $k^2$ small triangles. Let us call the "chain" such a sequence of triangles, that every triangle in it is included only once, and the consecutive triangles have the common side. What is the greatest possible number of the triangles in the chain?