The tetrahedron has the smallest number of faces in the five Platonic Solids, having only 4 faces. And in fact, four faces are the minimium requirement for a polyhedron. Other features of tetrahedron includes:

• Each face is an equilaterial triangle
• Each vertex is the meeting of 3 faces

Introduction

Platonic solids are polyhedron which satisfy 3 conditions

1. all its faces are congruent convex regular polygons,
2. none of its faces intersect except at their edges, and
3. the same number of faces meet at each of its vertices

Hexahedron

The most commonly recognised platonic solid, also known as a cube. 

All of my projects to date have required step by step instructions (some upwards of 300 lines of code!), so I decided to have a go at working out how to create a recursive code. After studying "Cayley graph 3D" working out in my head how the code was constructed, I was finally able to start my own. The following is based on an image of 

Cayley Graph of the Free Product Z₃ * Z₅

_{After much trial and error I was able to develop ...}

I was in the keynote session of AAMT conference. In the keynote, the mathematician Hanna Neumann was mentioned. I immediately googled and started reading about her on Wikipedia.

While reading, my thoughts are like the hyperlinks that go everywhere, then suddenly I saw and clicked into the Group theory, where I found the Cayley graph that caught my attention.

It is easily recognisable that this cayley graph is a fractal image, which can be produced with a simple recursive procedure in VRMath2's LOGO language.