Tag Archives: solve

Matchsticks and n-dimensional hypercubes

Here’s an addictive maths challenge for you to try.

It’s separated into four stages:

  • blue (easy);
  • green (medium);
  • yellow (hard); and
  • orange (very hard).

k = 3 in each example.

how many matchsticks are required to make a cube matchsticks 3 matchsticks 2 matchsticks 1

If you know the solutions to any of them, write them in the comments section below.