Finitely many points are given on the surface of a sphere, such that every four of them lie on the surface of open hemisphere. Prove that all points lie on the surface of an open hemisphere.

We consider a fixed point $P$ in the interior of a fixed sphere$.$ We construct three segments $PA, PB,PC$, perpendicular two by two$,$ with the vertexes $A, B, C$ on the sphere$.$ We consider the vertex $Q$ which is opposite to $P$ in the parallelepiped (with right angles) with $PA, PB, PC$ as edges$.$ Find the locus of the point $Q$ when $A, B, C$ take all the positions compatible with our problem.

A regular $n$-gonal truncated pyramid is circumscribed around a sphere. Denote the areas of the base and the lateral surfaces of the pyramid by $S_1, S_2$, and $S$, respectively. Let $\sigma$ be the area of the polygon whose vertices are the tangential points of the sphere and the lateral faces of the pyramid. Prove that \[\sigma S = 4S_1S_2 \cos^2 \frac{\pi}{n}.\]

Let $ T$ be a triangulation of an $ n$-dimensional sphere, and to each vertex of $ T$ let us assign a nonzero vector of a linear space $ V$. Show that if $ T$ has an $ n$-dimensional simplex such that the vectors assigned to the vertices of this simplex are linearly independent, then another such simplex must also exist. [i]L. Lovasz[/i]

Let $ U$ be an $ n \times n$ orthogonal matrix. Prove that for any $ n \times n$ matrix $ A$, the matrices \[ A_m=\frac{1}{m+1} \sum_{j=0}^m U^{-j}AU^j\] converge entrywise as $ m \rightarrow \infty.$ [i]L. Kovacs[/i]

A triangle $ABC$ and spheres are given in space $S_1$ and $S_2$, each of which passes through points $A, B$ and $C$. For points $M$ spheres $S_1$ not lying in the plane of triangle $ABC$ are drawn lines $MA, MB$ and $MC$, intersecting the sphere $S_2$ for the second time at points $A_1,B_1$ and $C_1$, respectively. Prove that the planes passing through points $A_1, B_1$ and $C_1$, touch a fixed sphere or pass through a fixed point.

In tetrahedron $SABC$, the circumcircles of faces $SAB$, $SBC$, and $SCA$ each have radius $108$. The inscribed sphere of $SABC$, centered at $I$, has radius $35.$ Additionally, $SI = 125$. Let $R$ be the largest possible value of the circumradius of face $ABC$. Given that $R$ can be expressed in the form $\sqrt{\frac{m}{n}}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. [i]Author: Alex Zhu[/i]

Consider two spheres $\Sigma_1$ and $\Sigma_2$ and a line $\Delta$ not meeting them. Let $C_i$ and $r_i$ be the center and radius of $\Sigma_i$, and let $H_i$ and $d_i$ be the orthogonal projection of $C_i$ onto $\Delta$ and the distance of $C_i$ from $\Delta~(i=1,2)$. For a point $M$ on $\Delta$, let $\delta_i(M)$ be the length of a tangent $MT_i$ to $\Sigma_i$, where $T_i\in\Sigma_i~(i=1,2)$. Find $M$ on $\Delta$ for which $\delta_1(M)+\delta_2(M)$ is minimal.

There is given a triangle $ABC$ in a space. A sphere does not intersect the plane of $ABC$. There are $4$ points $K, L, M, P$ on the sphere such that $AK, BL, CM$ are tangent to the sphere and $\frac{AK}{AP} = \frac{BL}{BP} = \frac{CM}{CP}$. Show that the sphere touches the circumsphere of $ABCP$.

There is an infinitely tall tetrahedral stack of spheres where each row of the tetrahedron consists of a triangular arrangement of spheres, as shown below. There is $1$ sphere in the top row (which we will call row $0$), $3$ spheres in row $1$, $6$ spheres in row $2$, $10$ spheres in row $3$, etc. The top-most sphere in row $0$ is assigned the number $1$. We then assign each other sphere the sum of the number(s) assigned to the sphere(s) which touch it in the row directly above it. Find a simplified expression in terms of $n$ for the sum of the numbers assigned to each sphere from row $0$ to row $n$. [asy] import three; import solids; size(8cm); //currentprojection = perspective(1, 1, 10); triple backright = (-2, 0, 0), backleft = (-1, -sqrt(3), 0), backup = (-1, -sqrt(3) / 3, 2 * sqrt(6) / 3); draw(shift(2 * backleft) * surface(sphere(1,20)), white); //2 draw(shift(backleft + backright) * surface(sphere(1,20)), white); //2 draw(shift(2 * backright) * surface(sphere(1,20)), white); //3 draw(shift(backup + backleft) * surface(sphere(1,20)), white); draw(shift(backup + backright) * surface(sphere(1,20)), white); draw(shift(2 * backup) * surface(sphere(1,20)), white); draw(shift(backleft) * surface(sphere(1,20)), white); draw(shift(backright) * surface(sphere(1,20)), white); draw(shift(backup) * surface(sphere(1,20)), white); draw(surface(sphere(1,20)), white); label("Row 0", 2 * backup, 15 * dir(20)); label("Row 1", backup, 25 * dir(20)); label("Row 2", O, 35 * dir(20)); dot(-backup); dot(-7 * backup / 8); dot(-6 * backup / 8); dot((backleft - backup) + backleft * 2); dot(5 * (backleft - backup) / 4 + backleft * 2); dot(6 * (backleft - backup) / 4 + backleft * 2); dot((backright - backup) + backright * 2); dot(5 * (backright - backup) / 4 + backright * 2); dot(6 * (backright - backup) / 4 + backright * 2); [/asy]

In $3$-dimensional space there is given a point $O$ and a finite set $A$ of segments with the sum of lengths equal to $1988$. Prove that there exists a plane disjoint from $A$ such that the distance from it to $O$ does not exceed $574$.

Let $S=\{(x,y,z)\in \mathbb{Z}^3\}$ the set of points with integer coordinates in the space. Gugu has infinitely many solid spheres. All with radii $\ge (\frac{\pi}2)^3$. Is it possible for Gugu to cover all points of $S$ with his spheres?

In a tetrahedron, the midpoints of all the edges lie on the same sphere. Prove that it's altitudes intersect at one point.

Rosemonde is stacking spheres to make pyramids. She constructs two types of pyramids $S_n$ and $T_n$. The pyramid $S_n$ has $n$ layers, where the top layer is a single sphere and the $i^{th}$ layer is an $i\times $i square grid of spheres for each $2 \le i \le n$. Similarly, the pyramid $T_n$ has $n$ layers where the top layer is a single sphere and the $i^{th}$ layer is $\frac{i(i+1)}{2}$ spheres arranged into an equilateral triangle for each $2 \le i \le n$.