Problems

Let \(ABC\) be a triangle with midpoints \(D\) on the side \(BC\), \(E\) on the side \(AC\), and \(F\) on the side \(AB\). Prove that the perpendicular bisectors to the sides \(AB\), \(BC\), \(AC\) intersect at one point.

Let \(ABC\) be a triangle with midpoints \(D\) on the side \(BC\), \(E\) on the side \(AC\), and \(F\) on the side \(AB\). Let \(M\) be the point of intersection of all medians of the triangle \(ABC\), let \(H\) be the point of intersection of the heights \(AJ\), \(BI\) and \(CK\). Prove that the points \(D\), \(J\), \(I\), \(E\), \(F\) and \(K\) all lie on one circle.

Let \(\phi(n)\) be Euler’s function. Namely \(\phi(n)\) counts how many integers from \(1\) to \(n\) inclusive are coprime with \(n\). For two natural numbers \(m\), \(n\) such that \(\gcd(m,n)=1\), prove that \(\phi(mn) = \phi(m)\phi(n)\).

Prove the \(GM-HM\) inequality for positive real numbers \(a_1\), \(a_2\), ..., \(a_n\): \[\sqrt[n]{a_1a_2...a_n} \geq \frac{n}{\frac{1}{a_1} + ... \frac{1}{a_n}}.\]

Draw a Sperner’s coloring for the following \(3\)-dimensional simplex. The blue segments are visible, the grey ones are inside the tetrahedron. The point \(F\) is on the face \(ABC\), point \(E\) is on the face \(BCD\), point \(G\) is on the face \(ACD\) and the point \(H\) is on the face \(ABD\).

Prove Sperner’s lemma in dimension \(1\), namely on a line.
The simplex in this case is just a segment, the triangulation is subdivision of the segment into multiple small segments, and the conditions of a Sperner’s coloring are the following:

• There are only two colors;

• The opposite ends of the main segment are colored differently;

Then one needs to prove that there exists a small segment with two ends colored in different colors. In particular there is an odd number of such small segments.

Draw Sperner’s coloring for the following triangulation. Try to avoid rainbow triangles at all costs.

So far we have discussed polynomials in one variable, i.e: with only an \(x\) as our variable. We can however, include as many as we want. For example, we can talk of a polynomial such as \[P(x,y)=x^2-y^2,\] where both \(x\) and \(y\) are variables. This is an example of an antisymmetric polynomial, which means that \(P(x,y)=-P(y,x)\) (i.e: switching \(x\) for \(y\) gives the original polynomial with a minus sign). Conversely, a polynomial \(Q(x,y)\) such that \(Q(x,y)=Q(y,x)\) is called symmetric. Show that every antisymmetric polynomial \(P(x,y)\) can be factored as \[P(x,y)=(x-y)Q(x,y),\] where \(Q(x,y)\) is a symmetric polynomial.

Solve the equation \[\left(x^2-3x+3\right)^2-3\left(x^2-3x+3\right)+3=x\]

Find all integer solutions to \(x^2+y^2-1=4xy\).