Page 193

		8-26 Prove: .

		Hint: First show how to obtain a 2c-noisy text from 3 texts, at least 2 of which are c-noisy.

		8-27 Prove: .

		8-28 Prove: .

		Hint: Consider the case in which 3 texts, at least 2 of which are c-noisy, do not suffice to give a 2c - 1 noisy text for f. Then use the fact that .

		8-29 Prove: .

		8-30 Prove: .

		8-31 Let b, . Prove the following:

		(a) ,

		(b) ,

		(c) ,

		8-32 Prove the following, which is an analog of Lemma 8.50 for incomplete texts.

		.

		8-33 Prove: .

		8-34 Let . Prove the following:

		(a) ,

		(b) ,

		(c) ,

		(d) ,

		(e) .

		8-35 Let . Prove the following:

		(a) .