Polymorphous Pursuit

Monday, 25th Jul, 2016 by Krilling for Company in Geometry, Mathematics, Pursuit Curves and tagged animated gif, animated gifs, geometrical, geometry, logarithmic spiral, logarithmic spirals, math, math animation, math animations, mathematics, maths, maths animation, maths animations, mice problem, mouse problem, pursuit curve, Pursuit Curves, recreational math, recreational mathematics, recreational maths, spiral, spirals | 2 Comments

Suppose four mice are standing on the corners of a large square. Each mouse begins running at the same speed towards the mouse one place away, reckoning clockwise. The mice will meet at the centre of the square and the path taken by each mouse will be what is known as a pursuit curve:

vertices = 4, mouse-increment = 1

v = 4, mi = 1 (animated)

As I showed in “Persecution Complex”, it’s easy to find variants on the basic pursuit curve. If mi = 2, i.e. each mouse runs towards the mouse two places away, the mice will run in straight lines direct to the centre of the square:

v = 4, mi = 2

v = 4, mi = 2 (animated)

That variant is trivial, but suppose there are eight mice, four starting on the corners of the square and four starting on the midpoints of the sides. Mice starting on the corners will run different pursuit curves to those starting on the midpoints, because the corners are further from the centre than the midpoints are:

v = 4, si = 1, mi = 1

If mi = 3, the pursuit curves look like this:

v = 4, si = 1, mi = 3

v = 4, si = 1, mi = 3 (animated)

Suppose there are twelve mice, four on each corner and two more on each side. If each mouse runs towards the mouse four places away, then the pursuit curves don’t all meet in the centre of the square. Instead, they meet in groups of three at four points equidistant from the centre, like this:

v = 4, si = 2, mi = 4

v = 4, si = 2, mi = 4 (animated)

v = 4, si = 4, mi = 4 (animated)

v = 4, si = 4, mi = 4 (zoom)

Now suppose each mouse become sophisticated and runs toward the combined positions of two other mice, one two places away, the other three places away, like this:

v = 4, si = 1, mi = (2, 3)

v = 4, si = 1, mi = (2, 3) (animated)

These polypursuits, as they could be called, can have complicated central regions:

v = 4, si = 2, mi = (1, 4)

v = 4, si = 2, mi = (1, 4) (animated)

v = 4, si = various, mi = various

And what if you have two teams of mice, running towards one or more mice on the other team? For example, suppose two mice, one from each team, start on each corner of a square. Each mouse on team 1 runs towards the mouse on team 2 that is one place away, while each mouse on team 2 runs towards the mouse on team 1 that is two places away. If the pursuits curves of team 1 are represented in white and the pursuit curves of team 2 in green, the curves look like this:

v = 4 * 2, vmi = 1, vmi = 2

v = 4 * 2, vmi = 1, vmi = 2 (animated)

Now suppose the four mice of team 1 start on the corners while the mice of team 2 start at the centre of the square.

v = 4, centre = 4, vmi = 1, cmi = 2 (white team)

v = 4, centre = 4, vmi = 1, cmi = 2 (green team)

v = 4, centre = 4, vmi = 1, cmi = 2 (both teams)

v = 4, centre = 4, vmi = 1, cmi = 2 (animated)

Here are more variants on pursuit curves formed by two teams of mice, one starting on the corners, one at the centre:

v = 4, centre = 4, vmi = (0, 1), cmi = 0

v = 4, centre = 4, vmi = (0, 2), cmi = 0

v = 4, centre = 4, vmi = (0, 3), cmi = 0

Get Your Ox Off

Saturday, 2nd Jul, 2016 by Krilling for Company in Clark Ashton Smith, Integer Sequences, Mathematics, Prime numbers, Reciprocals and tagged "The Demon of the Flower", Ancient Greek, animated gif, animated gifs, as the ox ploughs, boustrophedon, Clark Ashton Smith, grid, integers, math, mathematics, maths, modulus, number patterns, number-grid, numbers, oxen, prime numbers, primes, reciprocals, recreational math, recreational mathematics, recreational maths, writing | Leave a comment

Boustrophedon (pronounced “bough-stra-FEE-dun” or “boo-stra-FEE-dun”) is an ancient Greek word literally meaning “as the ox turns (in ploughing)”, that is, moving left-right, right-left, and so on. The word is used of writing that runs down the page in the same way. To see what that means, examine two versions of the first paragraph of Clark Ashton Smith’s story “The Demon of the Flower” (1933). The first is written in the usual way, the second is written boustrophedon:

Not as the plants and flowers of Earth, growing peacefully beneath a simple sun, were the blossoms of the planet Lophai. Coiling and uncoiling in double dawns; tossing tumultuously under vast suns of jade green and balas-ruby orange; swaying and weltering in rich twilights, in aurora-curtained nights, they resembled fields of rooted servants that dance eternally to an other-worldly music.

Not as the plants and flowers of Earth, growing peacefully
.iahpoL tenalp eht fo smossolb eht erew ,nus elpmis a htaeneb
Coiling and uncoiling in double dawns; tossing tumultuously
;egnaro ybur-salab dna neerg edaj fo snus tsav rednu
swaying and weltering in rich twilights, in aurora-curtained
ecnad taht stnavres detoor fo sdleif delbmeser yeht ,sthgin
eternally to an other-worldly music.

Boustrophedon writing was once common and sometimes the left-right lines would also be mirror-reversed, like this:

You could also use the term “boustrophedon” to describe the way this table of numbers is filled:

The table begins with “1” in the top left-hand corner, then moves right for “2”, then down for “3”, then right-and-up for “4”, “5” and “6”, then right for “7”, then left-and-down for “8”, “9” and “10”, and so on. You could also say that the numbers snake through the table. I’ve marked the primes among them, because I was interested in the patterns made by the primes when the numbers were represented as blocks on a grid, like this:

Primes are in solid white (compare the Ulam spiral). Here’s the boustrophedon prime-grid on a finer scale:

(click for full image)

And what about other number-tests? Here are the even numbers marked on the grid (i.e. n mod 2 = 0):

n mod 2 = 0

And here are some more examples of a modulus test:

n mod 3 = 0

n mod 5 = 0

n mod 9 = 0

n mod 15 = 0

n mod various = 0 (animated gif)

Next I looked at reciprocals (numbers divided into 1) marked on the grid, with the digits of a reciprocal marking the number of blank squares before a square is filled in (if the digit is “0”, the square is filled immediately). For example, in base ten 1/7 = 0.142857142857142857…, where the block “142857” repeats for ever. When represented on the grid, 1/7 has 1 blank square, then a filled square, then 4 blank squares, then a filled square, then 2 blank squares, then a filled square, and so on:

1/7 in base 10

And here are some more reciprocals (click for full images):

1/9 in base 2

1/13 in base 10

1/27 in base 10

1/41 in base 10

1/63 in base 10

1/82 in base 10

1/101 in base 10

1/104 in base 10

1/124 in base 10

1/143 in base 10

1/175 in base 10

1/604 in base 8

1/n in various bases (animated gif)

Radical Sheet

Thursday, 26th May, 2016 by Krilling for Company in √2, Fractals, Mathematics, Rep-Tiles and tagged animated gif, animated gifs, √2, cross, dividing and discarding, fractal, fractal cross, fractal geometry, fractals, geometry, math, mathematics, maths, paper, paper sizes, radical, radical sheet, recreational math, recreational mathematics, recreational maths, rectangle, rectangles, sheet of paper, square root of two, tessellation, tessellations | Leave a comment

If you take a sheet of standard-sized paper and fold it in half from top to bottom, the folded sheet has the same proportions as the original, namely √2 : 1. In other words, if x = √2 / 2, then 1 / x = √2:

√2 = 1.414213562373…, √2 / 2 = 0.707106781186…, 1 / 0.707106781186… = 1.414213562373…

So you could say that paper has radical sheet (the square or other root of a number is also called its radix and √ is known as the radical sign). When a rectangle has the proportions √2 : 1, it can be tiled with an infinite number of copies of itself, the first copy having ½ the area of the original, the second ¼, the third ⅛, and so on. The radical sheet below is tiled with ten diminishing copies of itself, the final two having the same area:

You can also tile a radical sheet with six copies of itself, two copies having ¼ the area of the original and four having ⅛:

This tiling is when you might say the radical turns crucial, because you can create a fractal cross from it by repeatedly dividing and discarding. Suppose you divide a radical sheet into six copies as above, then discard two of the ⅛-sized rectangles, like this:

Stage 1

Then repeat with the smaller rectangles:

Stage 2

Stage 3

Stage 4

Stage 5

Animated version

Fractile cross

The cross is slanted, but it’s easy to rotate the original rectangle and produce an upright cross:

Performativizing the Polygonic

Tuesday, 17th May, 2016 by Krilling for Company in Fractals, Geometry, Mathematics and tagged animated gif, animated gifs, digits, fractal, fractal geometry, fractals, geometry, heptagons, hexagaon, Hexagons, math, mathematics, maths, Pentagons, performativizing the polygonic, Polygons, recreational math, recreational mathematics, recreational maths, Squares, triangle, Triangles | 4 Comments

Maths is a mountain: you can start climbing in different places and reach the same destination. There are many ways of proving the irrationality of √2 or the infinitude of the primes, for example. But you can also arrive at the same destination by accident. I’ve found that when I use different methods of creating fractals. The same fractals appear, because apparently different algorithms are actually the same underneath.

But different methods can create unique fractals too. I’ve found some new ones by using what might be called point-to-point recursion. For example, there are ten ways to select three vertices from the five vertices of a pentagon: (1, 2, 3), (1, 2, 4), (1, 2, 5), (1, 3, 4), (1, 3, 5), (1, 4, 5), (2, 3, 4), (2, 3, 5), (2, 4, 5), (3, 4, 5). Find the midpoint of the first three-point set, (1, 2, 3). Then select two vertices to go with this midpoint, creating a new three-point set, and find the midpoint again. And so on. The process looks like this, with the midpoints shown for all the three-point sets found at each stage:

vertices = 5, choose sets of 3 points, find mid-point of each

At stage 5, the fractal looks like this:

v = 5, p = 3

Note that when pixels are used again, the colour changes. That’s another interesting thing about maths: limits can sometimes produce deeper results. If these fractals were drawn at very high resolution, pixels would only be used once and the colour would never change. As it is, low resolution means that pixels are used again and again. But some are used more than others, which is why interesting colour effects appear.

If the formation of the fractal is animated, it looks like this (with close-ups of even deeper stages):

Here are some more examples:

v = 4 + central point, p = 2 (cf. Fingering the Frigit)

v = 4c, p = 2 (animated)

v = 4, p = 3

v = 5, p = 4

v = 5 + central point, p = 3

v = 5c, p = 4

v = 5c, p = 5

v = 6 + 1 point between each pair of vertices, p = 6

v = 6, p = 2

v = 6, p = 3

v = 6, p = 4

v = 6c, p = 2 (cf. Fingering the Frigit)

v = 6c, p = 3

v = 6c, p = 4

v = 7, p = 3

v = 7, p = 4

v = ,7 p = 5

v = 7c, p = 4

v = 3+1, p = 2

v = 3+1, p = 3

v = 3+1, p = 4

v = 3+2, p = 5

v = 3c+1, p = 2

v = 3c+1, p = 4

v = 3c, p = 2

v = 3c, p = 3

v = 4+1, p = 3

v = 4+1, p = 4

v = 4+1, p = 6

v = 4+1, p = 2

v = 4c+1, p = 4

v = 4c, p = 3

v = 5+1, p = 4 (and more)

v = 5, p = 2

Polymorphous Perverticity

Thursday, 28th Apr, 2016 by Krilling for Company in Fractals, Geometry, Mathematics and tagged animated gif, animated gifs, fractal, fractal geometry, fractals, geometry, Hexagons, math, mathematics, maths, Pentagons, polygon fractals, polygonal fractals, polygonic performativity, Polygons, premier purveyor, recreational math, recreational mathematics, recreational maths, Sierpiński pentagon, Sierpiński triangle, Squares, triangle, Triangles, vertex, vertices | Leave a comment

As I’ve explained before on Overlord of the Über-Feral, the planet’s premier purveyor of polygonic performativity (probably (possibly (perspectivistically))), it works with triangles and pentagons, but not with squares. And what is “it”? A simple procedure in which you create a polygon, choose a point inside it, then repeatedly move half-way towards a vertex chosen at random, marking each new position as you go.

When the polygon has three vertices, you get a Sierpiński triangle. When it has five, you get what might be called a Sierpiński pentagon. When it has four, you get nothing. Or rather: you get everything, because the whole interior of the square gradually fills with points. But, as I’ve also explained before, there’s a simple way to change this. You can adapt the procedure so that a vertex can’t be chosen twice in a row, and so on.

When the rule is “No vertex twice in a row”, you get this fractal (colours change as a pixel is selected again):

But you can also use what might be a vertex increment, or vi, whereby you disallow vertices that are next to the previously chosen vertex, or two positions away, and so on. When the rule is “No vertex twice in a row”, the disallowed vertex is (v + 0), that is, vi = 0. If vi = 2 and the rule is disallow(v + 2), this fractal appears (when vi = 1, there’s no fractal):

v = 4, vi = 2

You can extend these rules to apply not just to the previously chosen vertex, but also to the vertex chosen before that. Here are some fractals produced by the rule disallow(v[1] + vi[1], v[2] + vi[2]), where v[1] is the vertex previously chosen and v[2] is the vertex chosen before that:

v = 4, vi[1] = 1, vi[2] = 2

v = 4, vi[1] = 2, vi[2] = 0

v = 4, vi[1] = 2, vi[2] = 1

v = 4, vi[1] = 2, vi[2] = 2

And here are some fractals produced by the rule disallow(v[1] + vi[1], v[2] + vi[2], v[3] + vi[3]):

v = 4, vi[1] = 1, vi[2] = 1, vi[3] = 0

v = 4, vi[1] = 1, vi[2] = 1, vi[3] = 2

Applying these rules to pentagons rather than squares doesn’t produce such a dramatic difference, because the original procedure – choose any vertex at random, taking no account of previous choices – produces a fractal when v = 5, as noted above, but not when v = 4. Nevertheless, here are some fractals for v > 4:

v = 5, vi = 0

v = 5, vi = 1

v = 5, vi = 2

v = 5, vi[1] = 0, vi[2] = 0

v = 5, vi[1] = 1, vi[2] = 0

v = 5, vi[1] = 2, vi[2] = 0

v = 5, vi[1] = 1, vi[2] = 1

v = 5, vi[1] = 1, vi[2] = 1, vi[3] = 1

v = 5, vi = various

v = 6, vi = 1

Fingering the Frigit

Thursday, 24th Mar, 2016 by Krilling for Company in Biology, Fractals, Geometry, Mathematics and tagged anatomy, animated gif, animated gifs, base 5, base 6, digits, fingers, fractal, fractal anatomy, fractal biology, fractal geometry, fractals, frigit, frigits, geometry, heptagons, Hexagons, human anatomy, integers, math, mathematics, maths, nonagons, numbers as fractals, octagons, Pentagons, Polygons, recreational math, recreational mathematics, recreational maths, Squares, triangle, Triangles | Leave a comment

Fingers are fractal. Where a tree has a trunk, branches and twigs, a human being has a torso, arms and fingers. And human beings move in fractal ways. We use our legs to move large distances, then reach out with our arms over smaller distances, then move our fingers over smaller distances still. We’re fractal beings, inside and out, brains and blood-vessels, fingers and toes.

But fingers are fractal are in another way. A digit – digitus in Latin – is literally a finger, because we once counted on our fingers. And digits behave like fractals. If you look at numbers, you’ll see that they contain patterns that echo each other and, in a sense, recur on smaller and smaller scales. The simplest pattern in base 10 is (0, 1, 2, 3, 4, 5, 6, 7, 8, 9). It occurs again and again at almost very point of a number, like a ten-hour clock that starts at zero-hour:

0, 1, 2, 3, 4, 5, 6, 7, 8, 9…
10, 11, 12, 13, 14, 15, 16, 17, 18, 19…
200… 210… 220… 230… 240… 250… 260… 270… 280… 290…

These fractal patterns become visible if you turn numbers into images. Suppose you set up a square with four fixed points on its corners and a fixed point at its centre. Let the five points correspond to the digits (1, 2, 3, 4, 5) of numbers in base 6 (not using 0, to simplify matters):

1, 2, 3, 4, 5, 11, 12, 13, 14, 15, 21, 22, 23, 24, 25, 31, 32, 33, 34, 35, 41, 42, 43, 44, 45, 51, 52, 53, 54, 55, 61, 62, 63, 64, 65… 2431, 2432, 2433, 2434, 2435, 2441, 2442, 2443, 2444, 2445, 2451, 2452…

Move between the five points of the square by stepping through the individual digits of the numbers in the sequence. For example, if the number is 2451, the first set of successive digits is (2, 4), so you move to a point half-way between point 2 and point 4. Next come the successive digits (4, 5), so you move to a point half-way between point 4 and point 5. Then come (5, 1), so you move to a point half-way between point 5 and point 1.

When you’ve exhausted the digits (or frigits) of a number, mark the final point you moved to (changing the colour of the pixel if the point has been occupied before). If you follow this procedure using a five-point square, you will create a fractal something like this:
$fractal4_1single$

$fractal4_1$
A pentagon without a central point using numbers in a zero-less base 7 looks like this:
$fractal5_0single$

$fractal5_0$
A pentagon with a central point looks like this:
$fractal5_1single$

$fractal5_1$
Hexagons using a zero-less base 8 look like this:
$fractal6_1single$

$fractal6_1$

$fractal6_0single$

$fractal6_0$
But the images above are just the beginning. If you use a fixed base while varying the polygon and so on, you can create images like these (here is the program I used):
$fractal4$

$fractal5$

$fractal6789$

The Choice of the Circle

Saturday, 26th Sep, 2015 by Krilling for Company in Geometry, Mathematics and tagged animated gif, animated gifs, circle, Circles, combinations, factorial, factorial n, factorials, graphics, math, mathematics, maths, n!, partitions, points around a circle, Polygons, recreational math, recreational mathematics, recreational maths | Leave a comment

Here’s an elementary mathematical problem: how many ways are there to choose three numbers from a set of six numbers? If the set is (1, 2, 3, 4, 5, 6), these are the possible choices (or combinations):

(1, 2, 3), (1, 2, 4), (1, 2, 5), (1, 2, 6), (1, 3, 4), (1, 3, 5), (1, 3, 6), (1, 4, 5), (1, 4, 6), (1, 5, 6), (2, 3, 4), (2, 3, 5), (2, 3, 6), (2, 4, 5), (2, 4, 6), (2, 5, 6), (3, 4, 5), (3, 4, 6), (3, 5, 6), (4, 5, 6) (c = 20)

So 6C3 = 20 (C stands for “combination”). The general formula is nCr = (n! / (n-r)!) / r!, where n is the number to choose from, r is the number of choices and n! is factorial n, or n multiplied by all numbers less than itself. For example, 6! = 6 * 5 * 4 * 3 * 2 * 1 = 720. When n = 6 and c = 3, 6C3 = (6! / (6-3)!) / 3! = (720 / 6) / 6 = 20.

There isn’t much visual appeal in the choices above, but there’s a simple way to change that. Take the ways of choosing two numbers from a set of ten. They start like this:

(1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (1, 9), (1, 10), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (2, 9), (2, 10), (3, 4), (3, 5), (3, 6)…

Suppose each choice represents the midpoint of two points chosen from a set of ten points around a pentagon, so that (1, 2) is half-way between points 1 and 2, (3, 5) is half-way between points 3 and 5, and so on:

Now take the ways of choosing three numbers from a set of ten:

(1, 2, 3), (1, 2, 4), (1, 2, 5), (1, 2, 6), (1, 2, 7), (1, 2, 8), (1, 2, 9), (1, 2, 10), (1, 3, 4), (1, 3, 5), (1, 3, 6), (1, 3, 7), (1, 3, 8), (1, 3, 9), (1, 3, 10)…

Now the pentagon looks like this, with (1, 2, 3) representing the point midway between 1, 2 and 3, (1, 3, 9) representing the point midway between 1, 3 and 9, and so on:

Now here are 10C4, 10C5 and 10C6 for the pentagon:

You can also generate the points 5C4 = 5, then add them to the original five points and generate 10C4:

5C4

10C4

And here are 5C5, 6C5 and 12C5:

Here are 7C7 and 8C8, adding points as for 5C4:

And here is 12C6 using a dodecagon:

And various nCr for dodecagons and other polygons:

This method can also be used to represent the partitions of n, or the number of sets whose members sum to n. The partitions of 5 are these:

(5), (4, 1), (3, 2), (3, 1, 1), (2, 2, 1), (2, 1, 1, 1), (1, 1, 1, 1, 1)

There are seven partitions, so p(5) = 7. Partitions start small and get very large, starting with p(1), p(2), p(3) and so on:

1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490, 627, 792, 1002, 1255, 1575, 1958, 2436, 3010, 3718, 4565, 5604, 6842, 8349, 10143, 12310, 14883, 17977, 21637, 26015, 31185, 37338, 44583, 53174, 63261, 75175, 89134, 105558, 124754, 147273, 173525, 204226, 239943, 281589, 329931, 386155, 451276, 526823, 614154, 715220, 831820, 966467, 1121505, 1300156…

Suppose the partitions of n are treated as sets of points around a polygon with n vertices. Each set is then used to generate the point midway between its members. For example, (5, 4, 4, 2) is one partition of 15 and would represent the point midway between 5, 4, 4 and 2 of a pentadecagon. Here is a graphical representation of p(30):

Here are graphical representations for the partitions 5 to 15, then 15 to 60 in increments of 5 (15, 20, 25, etc):

And here are some close-ups for the partitions of 35 and 40:

Lette’s Roll

Thursday, 7th May, 2015 by Krilling for Company in Geometry, π, Mathematics, Pi and tagged animated gif, animated gifs, cardioid, Circles, curves, family of curves, geometry, math, mathematics, maths, nephroid, paths traced by rolling circles, point on a rolling circle, recreational math, recreational mathematics, recreational maths, rolling circles, roulette, roulettes, wheels | Leave a comment

A roulette is a little wheel or little roller, but it’s much more than a game in a casino. It can also be one of a family of curves created by tracing the path of a point on a rotating circle. Suppose a circle rolls around another circle of the same size. This is the resultant roulette:

The shape is called a cardioid, because it looks like a heart (kardia in Greek). Now here’s a circle with radius r rolling around a circle with radius 2r:

That shape is a nephroid, because it looks like a kidney (nephros in Greek).

This is a circle with radius r rolling around a circle with radius 3r:

And this is r and 4r:

The shapes above might be called outer roulettes. But what if a circle rolls inside another circle? Here’s an inner roulette whose radius is three-fifths (0.6) x the radius of its rollee:

The same roulette appears inverted when the inner circle has a radius two-fifths (0.4) x the radius of the rollee:

But what happens when the circle rolling “inside” is larger than the rollee? That is, when the rolling circle is effectively swinging around the rollee, like a bunch of keys being twirled on an index finger? If the rolling radius is 1.5 times larger, the roulette looks like this:

If the rolling radius is 2 times larger, the roulette looks like this:

Here are more outer, inner and over-sized roulettes:

And you can have circles rolling inside circles inside circles:

And here’s another circle-in-a-circle in a circle:

M.i.P. Trip

Thursday, 8th Jan, 2015 by Krilling for Company in Fractals, Geometry, Mathematics and tagged animated gif, animated gifs, divide-and-discard, fractal, fractals, fractals based on squares, geometry, hexagon, hexagonal fractal, math, mathematics, maths, much in little, multum in parvo, recreational math, recreational mathematics, recreational maths, square, Squares | Leave a comment

The Latin phrase multum in parvo means “much in little”. It’s a good way of describing the construction of fractals, where the application of very simple rules can produce great complexity and beauty. For example, what could be simpler than dividing a square into smaller squares and discarding some of the smaller squares?

Yet repeated applications of divide-and-discard can produce complexity out of even a 2×2 square. Divide a square into four squares, discard one of the squares, then repeat with the smaller squares, like this:

Increase the sides of the square by a little and you increase the number of fractals by a lot. A 3×3 square yields these fractals:

And the 4×4 and 5×5 fractals yield more:

The Hex Fractor

Monday, 1st Dec, 2014 by Krilling for Company in Fractals, Geometry, Mathematics and tagged animated gif, animated gifs, equilateral triangle, fractal, fractals, geometry, hex-ring, hex-rings, hexagon, hexagonal fractal, math, mathematics, maths, polygon, Polygons, recreational math, recreational mathematics, recreational maths, regular polygons, triangle | Leave a comment

A regular hexagon can be divided into six equilateral triangles. An equilateral triangle can be divided into three more equilateral triangles and a regular hexagon. If you discard the three triangles and repeat, you create a fractal, like this:

Adjusting the sides of the internal hexagon creates new fractals:

Discarding a hexagon after each subdivision creates new shapes:

And you can start with another regular polygon, divide it into triangles, then proceed with the hexagons:

Overlord In Terms of Core Issues Around Maximal Engagement with Key Notions of the Über-Feral

მეფე (2) • მსოფლიოს (3) • მათემატიკა (5) •

Tag Archives: animated gif