Consider a 3-digit molecule where A, B, and C can take on the values 0 and 1. There are eight such sequences ([000, [010, [100, [110, and Let's say that the [000 molecule is the most fit; upon each replication it produces an average of formula_1 copies, where formula_2. This molecule is called the "master sequence". The other seven sequences are less fit; they each produce only 1 copy per replication. The replication of each of the three digits is done with a mutation rate of μ. In other words, at every replication of a digit of a sequence, there is a probability formula_3 that it will be erroneous; 0 will be replaced by 1 or vice versa. Let's ignore double mutations and the death of molecules (the population will grow infinitely), and divide the eight molecules into three classes depending on their Hamming distance from the master sequence: