Discovered much later than Julia sets, it is generated by taking the set of all functions f(Z)=Z^2+C, looking at all of the possible C points and their Julia sets, and assigning colors to the
points based on whether the Julia set is connected or dust (cf Prisoners and Escapees -- Julia Sets Discussion).

"Middle value" of a list. The smallest number such that at least half the numbers in
the list are no greater than it. If the list has an odd number of entries, the median
is the middle entry in the list after sorting the list into increasing order. If the
list has an even number of entries, the median is equal to the sum of the two middle
(after sorting) numbers divided by two. The median can be estimated from a histogram
by finding the smallest number such that the area under the histogram to the left of
that number is 50%
(cf Mean, Median and Mode Discussion).

A method for finding remainders where all the possible numbers (the numbers less than the divisor) are put in a circle, and then by counting around the circle the number of times of the number being divided, the remainder will be the final number landed on (cf What are Remainders Discussion).

The probability that events A and B both occur (i.e., that event A&B occurs), is equal
to the conditional probability that A occurs given that B occurs, times the
unconditional probability that B occurs: P(A & B)=P(A/B)*P(B).