## Regular tetrahedron – computing various quantities in terms of the side-length

Sometimes one needs to find certain quantities related to the regular tetrahedron in , like volume, radius of the circumscribed sphere, radius of inscribed sphere, distance between opposite sides, etc. in terms of the side-length which we’ll note in the following with . In the past I needed to find the angle under which every side is seen when looking from the center of the regular tetrahedron.

Here’s a trick which can help you find rather easily everything you need related to the regular tetrahedron: *just embed it into a cube*. We can see rather easily that when drawing certain diagonals of the faces of a cube, like in the figure below, we can recover a regular tetrahedron. Now it becomes rather easy to solve all questions above. We note that the ratio between the side of the cube (denoted by ) and the side of the embedded tetrahedron (denoted by ) is : .

Here are a few ideas:

**1. Finding the volume of the tetrahedron in terms of its sides.**

The volume of the cube is . The volume of the tetrahedron can be obtained by cutting four corner pyramids with volumes (recall that volume of a pyramid is (area of base) (height) ). Therefore the volume of the regular tetrahedron is . Replacing we get that the volume of the tetrahedron is .

**2. Finding the circumradius .**

It is not difficult to see that the sphere passing through the vertices of the tetrahedron also passes through the vertices of the cube. Therefore its radius is a long diagonal of the cube divided by . This gives . Replacing we get that the circumradius is .

**3. Finding the inradius .**

Once we have the volume and the circumradius, finding the inradius is not that difficult, since the symmetry of the figure shows that , where is the distance from a vertex to the opposite face, also called the height. We can find the height from the formula of the volume (recalled above), and then find . Also note that since the center of the tetrahedron is also the centroid, we must have , so we have another quick finish solution.

However, let’s use the cube to do this. We can choose a system of coordinates putting the origin at the center of the cube (and tetrahedron). Put the cube so that its vertices have coordinates and suppose that the tetrahedron corresponds to the vertices , , , . All we need to do is to compute the distance from the origin to the plane . This is immediate if we know the equation of this plane. Fortunately, it is really easy to see that the coordinates of verify (if not, then note that the normal to is the vector and figure out the remaining translation constant). We know that if a plane is defined by the equation then the distance from to this plane is

Apply this to our problem and the distance from the origin to becomes . Replace and we get .

**4. Find distance between opposite sides.**

This is particularly easy with the cube. The distance between the opposite sides is exactly the distance between two parallel faces of the cube and that is .

**5. Find angle made by two rays connecting the center with vertices.**

Use the coordinate system introduced in **3.** and just compute the angle between vectors and , for example. If is the angle between and we get that

Therefore .

## Missing digit – short puzzle

The number has digits, all different; which digit is missing?

*Mathematical Mind-Benders, Peter Winkler*

## Project Euler Problem 285

Another quite nice problem from Project Euler is number 285. The result of the problem depends on the computation of a certain probability, which in turn is related to the computation of a certain area. Below is an illustration of the computation for k equal to 10.

To save you some time, here’s a picture of the case k=1 which I ignored and spent quite a lot of time debugging… Plus, it only affects the last three digits or so after the decimal point…

Here’s a Matlab code which can construct the pictures above and can compute the result for low cases. To solve the problem, you should compute explicitly all these areas.

function problem285(k) N = 100000; a = rand(1,N); b = rand(1,N); ind = find(abs(sqrt((k*a+1).^2+(k*b+1).^2)-k)<0.5); plot(a(ind),b(ind),'.'); axis equal M = k; pl = 1; for k=1:M if mod(k,100)==0 k end r1 = (k+0.5)/k; r2 = (k-0.5)/k; f1 = @(x) (x<=(-1/k+r1)).*(x>=(-1/k-r1)).*(sqrt(r1^2-(x+1/k).^2)-1/k).*(x>=0).*(x<=1); f1 = @(x) f1(x).*(f1(x)>=0); f2 = @(x) (x<=(-1/k+r2)).*(x>=(-1/k-r2)).*(sqrt(r2^2-(x+1/k).^2)-1/k).*(x>=0).*(x<=1); f2 = @(x) f2(x).*(f2(x)>=0); if k == pl thetas = linspace(0,pi/2,200); hold on plot(-1/k+r1*cos(thetas),-1/k+r1*sin(thetas),'r','LineWidth',2); plot(-1/k+r2*cos(thetas),-1/k+r2*sin(thetas),'r','LineWidth',2); plot([0 1 1 0 0],[0 0 1 1 0],'k','LineWidth',3); hold off axis off end A(k) = integral(@(x) f1(x)-f2(x),0,1); end xs = xlim; ys = ylim; w = 0.01; axis([xs(1)-w xs(2)+w ys(1)-w ys(2)+w]); sum((1:k).*A)

## Some of the easy Putnam 2016 Problems

Here are a few of the problems of the Putnam 2016 contest. I choose to only list problems which I managed to solve. Most of them are pretty straightforward, so maybe the solutions posted here may be very similar to the official ones. You can find a complete list of the problems on other sites, for example here.

**A1.** Find the smallest integer such that for every polynomial with integer coefficients and every integer , the number

that is the -th derivative of evaluated at , is divisible by .

**Hints.** Successive derivatives give rise to terms containing products of consecutive numbers. The product of consecutive numbers is divisible by . Find the smallest number such that . Prove that does not work by choosing . Prove that works by working only on monomials…

## Monotonic bijection from naturals to pairs of natural numbers

This is a cute problem I found this evening.

Suppose is a bijection such that if and , then .

Prove that if then .

*Proof:* The trick is to divide the pairs of positive integers into families with the same product.

Note that the -th column contains as many elements as the number of divisors of . Now we just just use a simple observation. Let be on the -th column (i.e. ). If then cannot be on one of the first columns. Indeed, the monotonicity property implies . The fact that is a bijection assures us that cover the first columns. Moreover, one element from the -th column is surely covered, namely . This means that

where we have denoted by the number of positive divisors of .

## Necessary condition for the uniform convergence of a certain series

Let be a decreasing sequence of positive numbers such that the series

is uniformly convergent. Then must satisfy .

Note that this result implies that the series is not uniformly convergent on . It is surprisngly similar to the following result:

Suppose that is a decreasing sequence of positive real numbers such that the series is convergence. Then . It is no surprise that the proofs of these two results are similar.

## Nice inequality similar to IMO 2011

Prove that

*Note the similarity to the IMO 2011 inequality, and *surprisingly* the same method works.*