Is it possible to make an irregular polyhedron using only polygons of, say, six, seven and eight sides? The answer (rather surprisingly) is 'no', but how do we prove a statement like this?
Here is a proof of Euler's formula in the plane and on a sphere together with projects to explore cases of the formula for a polygon with holes, for the torus and other solids with holes and the relationship between Euler's formula and angle deficiency of polyhedra.
Some puzzles requiring no knowledge of knot theory, just a careful inspection of the patterns. A glimpse of the classification of knots, prime knots, crossing numbers and knot arithmetic.
This is the second of two articles and discusses problems relating
to the curvature of space, shortest distances on surfaces,
triangulations of surfaces and representation by graphs.
This article (the first of two) contains ideas for investigations.
Space-time, the curvature of space and topology are introduced with
some fascinating problems to explore.