Constructing a tetrahedron

For this problem, we will define a "unit polyhedron" to be a polyhedron of edge length one.

The picture to the right shows how a larger tetrahedron can be built from four unit tetrahedra and one unit octahedron.

Amanda wishes to construct a much larger tetrahedron with many more unit tetrahedra and octahedra. In the end, she builds one using exactly 364 unit octahedra and some unit tetrahedra.

How many unit tetrahedra did she use?

Assumption: The final construction is one solid tetrahedron, with nothing extra sticking out, and nothing missing (no holes). No unit octahedra or tetrahedra are cut in any way.


Image credit: http://www.matematicasvisuales.com/


The answer is 741.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Geoff Pilling
Dec 26, 2016

The formulae for constructing the tetrahedron (thanks Michael Mendrin for providing these!) are as follows:

To make tetrahedra of linear size n n , you need

  • 1 6 n ( n 2 1 ) \frac{1}{6}n(n^2 - 1) octahedra
  • 1 3 n ( n 2 + 2 ) \frac{1}{3}n(n^2 + 2) tetrahedra

These equations can be derived as follows:

===========================================

Consider the triangular numbers, Δ n = n ( n + 1 ) 2 \Delta_n = \frac{n(n+1)}{2}

Also, lets consider ( O n , T n ) (O_n,T_n) for the number of octahedra and tetrehedra in a "great tetrahedra" of linear dimension, n n . Clearly for n = 1 n=1 and n = 2 n=2 we have:

  • ( O 1 , T 1 ) = ( 0 , 1 ) (O_1,T_1) = (0,1)
  • ( O 2 , T 2 ) = ( 1 , 4 ) (O_2,T_2) = (1,4)

(The second equation being the picture in the problem)

The thing to notice here, is that each time we add a row of tetrahedra and octahedra to construct the next "great tetrahedra" with one more linear dimension, we add Δ n 1 \Delta_{n-1} octahedra and Δ n + Δ n 2 \Delta_n + \Delta_{n-2} tetrahedra.

So, for n>2

  • O n = O n 1 + Δ n 1 O_n = O_{n-1} + \Delta_{n-1}
  • T n = T n 1 + Δ n + Δ n 2 T_n = T_{n-1} + \Delta_{n} + \Delta_{n-2}

These recurrence relations translate into:

  • O n = 1 6 n ( n 2 1 ) O_n = \frac{1}{6}n(n^2 - 1)
  • T n = 1 3 n ( n 2 + 2 ) T_n = \frac{1}{3}n(n^2 + 2)

===========================================

The first equation gives us 364 364 octahedra for n = 13 n=13 .

So, for n = 13 n=13 the second equation gives us that there are 741 \boxed{741} tetrahedra.

To make tetrahedra of linear size n n , you need

  • 1 6 n ( n 2 1 ) \frac{1}{6}n(n^2 - 1) octahedra
  • 1 3 n ( n 2 + 2 ) \frac{1}{3}n(n^2 + 2) tetrahedra

Got a proof?

Pi Han Goh - 4 years, 5 months ago

Log in to reply

Let me see if I can find my original derivation...

Geoff Pilling - 4 years, 5 months ago

There... I've added a derivation to the solution. What do you think?

Geoff Pilling - 4 years, 5 months ago

Log in to reply

Well, you seem to be missing out in a lot of steps here

These recurrence relations translate into:

  • O n = 1 6 n ( n 2 1 ) O_n = \frac{1}{6}n(n^2 - 1)
  • T n = 1 3 n ( n 2 + 2 ) T_n = \frac{1}{3}n(n^2 + 2)

But overall, it looks good! Thankss

Pi Han Goh - 4 years, 5 months ago

Log in to reply

@Pi Han Goh Thanks for the feedback... When I get a chance, perhaps I'll try to fill in the missing steps...

Geoff Pilling - 4 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...