Is it possible to split a prism into disjoint set of pyramids so that each pyramid has its base on one base of the prism, while its vertex on another base of the prism ? (6)

Let $ ABCD$ be a triangular pyramid such that no face of the pyramid is a right triangle and the orthocenters of triangles $ ABC$, $ ABD$, and $ ACD$ are collinear. Prove that the center of the sphere circumscribed to the pyramid lies on the plane passing through the midpoints of $ AB$, $ AC$ and $ AD$.

A beetle crawls along the edges of an $n$-lateral pyramid, starting and ending at the midpoint $A$ of a base edge and passing through each point at most once. How many ways are there for the beetle to do this (two ways are said to be equal if they go through the same vertices)? Show that the sum of the numbers of passed vertices (over all these ways) equals $1^2 +2^2 +\ldots +n^2. $

Given a pyramid with square base $ ABCD $ and vertex $ S $. Find the shortest path whose starting and ending point is the point $ S $ and which passes through all the vertices of the base.

It is given that $r=\left(3\left(\sqrt6-1\right)-4\left(\sqrt3+1\right)+5\sqrt2\right)R$ where $r$ and $R$ are the radii of the inscribed and circumscribed spheres in a regular $n$-angled pyramid. If it is known that the centers of the spheres given coincide, (a) find $n$; (b) if $n=3$ and the lengths of all edges are equal to a find the volumes of the parts from the pyramid after drawing a plane $\mu$, which intersects two of the edges passing through point $A$ respectively in the points $E$ and $F$ in such a way that $|AE|=p$ and $|AF|=q$ $(p<a,q<a)$, intersects the extension of the third edge behind opposite of the vertex $A$ wall in the point $G$ in such a way that $|AG|=t$ $(t>a)$.

Let $E$ be a finite set of points such that $E$ is not contained in a plane and no three points of $E$ are collinear. Show that at least one of the following alternatives holds: (i) $E$ contains five points that are vertices of a convex pyramid having no other points in common with $E;$ (ii) some plane contains exactly three points from $E.$

A square is called [i]proper[/i] if its sides are parallel to the coordinate axes. Point $P$ is randomly selected inside a proper square $S$ with side length 2012. Denote by $T$ the largest proper square that lies within $S$ and has $P$ on its perimeter, and denote by $a$ the expected value of the side length of $T$. Compute $\lfloor a \rfloor$, the greatest integer less than or equal to $a$. [i]Proposed by Lewis Chen[/i]

The solid shown has a square base of side length $s$. The upper edge is parallel to the base and has length $2s$. All other edges have length $s$. Given that $s = 6 \sqrt{2}$, what is the volume of the solid? [asy] import three; size(170); pathpen = black+linewidth(0.65); pointpen = black; currentprojection = perspective(30,-20,10); real s = 6 * 2^.5; triple A=(0,0,0),B=(s,0,0),C=(s,s,0),D=(0,s,0),E=(-s/2,s/2,6),F=(3*s/2,s/2,6); draw(F--B--C--F--E--A--B); draw(A--D--E, dashed); draw(D--C, dashed); label("$2s$", (s/2, s/2, 6), N); label("$s$", (s/2, 0, 0), SW); [/asy]

In how many distinguishable ways can $10$ distinct pool balls be formed into a pyramid ($6$ on the bottom, $3$ in the middle, one on top), assuming that all rotations of the pyramid are indistinguishable?

Given the pyramid $ABCD$. Let $O$ be the midpoint of edge $AC$. Given that $DO$ is the height of the pyramid, $AB=BC=2DO$ and the angle $ABC$ is right. Cut this pyramid into $8$ equal and similar to it pyramids.

Bottom surface of triangular pyramid $S-ABC$ is an isosceles right triangle (hypotenuse is $AB$). $SA=SB=SC=AB=2$, and $S,A,B,C$ are on a sphere with center of $O$. The distance of $O$ to plane $ABC$ is________.

Given any triangle $ABC$ and any positive integer $n$, we say that $n$ is a [i]decomposable[/i] number for triangle $ABC$ if there exists a decomposition of the triangle $ABC$ into $n$ subtriangles with each subtriangle similar to $\triangle ABC$. Determine the positive integers that are decomposable numbers for every triangle.

Pyramid $EARLY$ is placed in $(x,y,z)$ coordinates so that $E=(10,10,0),A=(10,-10,0)$, $R=(-10,-10,0)$, $L=(-10,10,0)$, and $Y=(0,0,10)$. Tunnels are drilled through the pyramid in such a way that one can move from $(x,y,z)$ to any of the $9$ points $(x,y,z-1)$, $(x\pm 1,y,z-1)$, $(x,y\pm 1, z-1)$, $(x\pm 1, y\pm 1, z-1)$. Sean starts at $Y$ and moves randomly down to the base of the pyramid, choosing each of the possible paths with probability $\dfrac{1}{9}$. What is the probability that he ends up at the point $(8,9,0)$?

Each diagonal of the base and each lateral edge of a $9$-gonal pyramid is colored either green or red. Show that there must exist a triangle with the vertices at vertices of the pyramid having all three sides of the same color.

Given is a regular $n$-sided pyramid with top $T$ and base $A_1A_2A_3... A_n$. The line perpendicular to the ground plane through a point $B$ of the ground plane within $A_1A_2A_3... A_n$ intersects the plane $TA_1A_2$ at $C_1$, the plane $TA_2A_3$ at $C_2$, and so on, and finally the plane $TA_nA_1$ at $C_n$. Prove that $BC_1 + BC_2 + ... + BC_n$ is independent of choice of $B$'s.