This shelf is displaying several Sierpinski tetrahedra:
The linear dimensions of the five big ones from left to right are 1, 2, 4, 8, and 16.
You can fill the void in the second one perfectly with one octahedron.
The third one can be filled with five octahedra, a big one and four smaller ones.
How many octahedra (of different sizes) would it take to fill all the voids in a Sierpinski tetrahedra of linear dimension 1024?
Image credit: http://www.fractalnature.com/
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice explanation! Could you turn the recursion relation into the explicit formula (1/3)(4^n) - (1/3)?
Log in to reply
Lets see, I think my recursion relation is equivalent to the explicit formula:
N n = i = 0 ∑ n − 1 4 i
It looks like thats equivalent to ( 3 1 ⋅ 4 n − 3 1 ) ?
Ah... Interesting... Lemme think about it for a bit...
Sure. You also know in this circumstance the format is a*4^n+b and you can just set a system of two equations where n = 1 and n = 2.
Just listing this out in case it's easier for someone:
Sierpinski Tetrahedra
Linear Dimension | Missing Octahedra |
1 | 0 |
2 | 1 |
4 | 5 |
8 | 21 |
16 | 85 |
32 | 341 |
64 | 1365 |
128 | 5461 |
256 | 21845 |
512 | 87381 |
1024 | 349525 |
Problem Loading...
Note Loading...
Set Loading...
Every time you double the linear dimension, the number of octahedra needed is multiplied by four (one for each of the four pyramids replicated) plus one for the big hole in the middle.
So, if N n = The number of octahedra required to fill a Sierpinski Tetrahedra with linear dimension 2 n , then:
From this recursion relation:
N 1 0 = 3 4 9 5 2 5