 Rejewski studied these related pairs of letters. For example, if there were four messages that had the following indicators on the same day: BJGTDN, LIFBAB, ETULZR, TFREII, then by looking at the first and fourth letters of each set, he knew that certain pairs of letters were related. B was related to T, L was related to B, E was related to L, and T was related to E: (B, T), (L, B), (E, L), and (T, E). If he had enough different messages to work with, he could build entire sequences of relationships: the letter B was related to T, which was related to E, which was related to L, which was related to B (see diagram). This was a "cycle of 4", since it took four jumps until it got back to the start letter. Another cycle on the same day might be A <formula> F <formula> W <formula> A, or a "cycle of 3". If there were enough messages on a given day, all the letters of the alphabet might be covered by a number of different cycles of various sizes. The cycles would be consistent for one day, and then would change to a different set of cycles the next day. Similar analysis could be done on the 2nd and 5th letters, and the 3rd and 6th, identifying the cycles in each case and the number of steps in each cycle.
