Copyright © University of Cambridge. All rights reserved.
'Sierpinski Triangle' printed from https://nrich.maths.org/
If you break a line of length $1$ into self similar bits of length
${1\over m}$ there are $m^1$ bits and we say the dimension of the
line is $1$.
If you break up a square of side $1$ into self similar squares with
edge ${1\over m}$ then there are $m^2$ smaller squares and we say
the dimension is $2$.
If you break up a cube of side$1$ into self similar cubes with edge
${1\over m}$ then there are $m^3$ smaller cubes and we say the
dimension is $3$.
In each case we say the magnification factor is $m$ meaning that we
have to scale the lengths by a factor of $m$ to produce the
original shape. So the formula is: $$\text{number of bits} =
\text{(magnification factor})^d$$ where $d$ is the dimension, i.e.
$n = m^d$.