All the routes from the * at A to the . at G.
My method for the cuboid in the diagram
above is to start at A (*) and then find all
the routes that began A-B, then all the routes
that began A-D and finally A-E. I came up
with 16 different routes.
Triangular Prism
I am going to show you all the routes that the triangular prism has within it.
I start with the A to B combinations and the
The A to C and finally A-E
These prism polyhedra’s fit the rule 4n or 4n-1 because N=No. of edges on bottom face.
= 4 X number of edges on the bottom face
Pyramid
My system is the same as described in the method
This square based pyramid has 7 routes
The rule for pyramids is 2n-1
Both the pyramids and prisms amount of routes are numerically connected to the number of edges on the bottom face of the shape.
16 routes form
B-Z
A-Z
D-Z
And 15 routes form
C-Z
This means that the total amount of
Routes is 63.
When adding two shapes together we add all the possible routes from the different points on the shape.
All the shapes have a numerical connection
