Problem
1. Write a program to generate random four-letter words (collections of letters). Estimate how many words your program will generate before it repeats a word.
2. How would you simulate generating random numbers by throwing two dice and taking their sum, with the added complication that the dice are nonstandard (say, painted with the numbers 1,2,3,5,8, and 13)?
3. Show the sequence of patterns produced by a linear feedback shift register like that in Figure 35.1, but with the tap positions at the first and last bits. Assume the initial pattern is 1111.
