>> |
Anonymous
the fun thing about the M set is that all that complexity is based off of the equation Z sub n+1 = (Z sub n)^2 +c. the idea is you start with z=0 and some complex number c then plug that into z (aka you get C^2) and add C again, then plug that into Z and end up with ((C^2+C)+C and repeat for ((C^2+C)+C)^2 +C and infinitely repeat
|