Exercise 3: sample answer (a) Three rotors, each with 26 starting positions: 26 x 26 x 26 = 17,576 starting positions. (b) Three rotors can be placed in the machine in 3 x 2 x 1 = 6 different orders. 17,576 x 6 = 105,456 combinations of rotor order and starting position. (c) Enigma never enciphers a letter as itself. So if a cipher letter is, say, K, the plain letter at that position cannot be K. A codebreaker can slide a guessed word (a "crib") along the ciphertext and rule out every position where any letter would match itself. That removes many impossible positions and saves a great deal of work.