One method to test if a particular point P is in the set is as follows:
Set z0 to 0, c to P, and iterate the recurrence for M, a specified maximum number of iterations. If the magnitude of z remains finite even after M iterations are performed, consider P to be in the set. If the magnitude of z "escapes to infinity" (practically, |z|>2) before M iterations are reached, consider P not to be in the set, and call the iteration where z escaped E.
Images can be colored many different ways, and different aspects of the image are shown by different coloring schemes. Four types of coloring are shown here:
| Black & White | If P is in the set, color it white. If P is not in the set, color it black. This coloration shows exactly what is in the set and what isn't. |
| Gray | If P is in the set, color it white. If P is not in the set, color it on a scale from white to black relative to E: E=[1..M-1] → color=[white..black]. This coloration accentuates the set by outlining it in black, surrounded by gray. |
| Fire | If P is in the set, color it white. If P is not in the set, color it on a scale from red to yellow relative to E: E=[1..M-1] → color[red..yellow]. This coloration makes it appear that the set is glowing white hot, with a cooler "temperature" as the distance from the set increases. |
| Rainbow | If P is in the set, color it white. If P is not in the set, select a color from a rainbow palette based on E. This coloration uses a color of maximum intensity for every pixel, so all detail is made visible. |