# Solution

(related to Problem: Building The Tetrahedron)

Take your constructed pyramid and hold it so that one stick only lies on the table. Now, four sticks must branch off from it in different directions — two at each end. Anyone of the five sticks may be left out of this connection; therefore the four may be selected in $5$ different ways. But these four matches may be placed in $24$ different orders. And as any match may be joined at either of its ends, they may further be varied (after their situations are settled for any particular arrangement) in $16$ different ways. In every arrangement, the sixth stick may be added in $2$ different ways. Now multiply these results together, and we get $$5 \times 24 \times 16 \times 2 = 3,840$$ as the exact number of ways in which the pyramid may be constructed. This method excludes all possibility of error.

A common cause of an error is this. If you calculate your combinations by working upwards from a basic triangle lying on the table, you will get half the correct number of ways, because you overlook the fact that an equal number of pyramids may be built on that triangle downwards, so to speak, through the table. They are, in fact, reflections of the others, and examples from the two sets of pyramids cannot be set up to resemble one another — except under fourth-dimensional conditions!

Thank you to the contributors under CC BY-SA 4.0!

Github:

non-Github:
@H-Dudeney

### References

#### Project Gutenberg

1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.