Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site fisher.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!princeton!astrovax!fisher!david
From: david@fisher.UUCP (David Rubin)
Newsgroups: net.jokes
Subject: Re: e: reatnsl log
Message-ID: <318@fisher.UUCP>
Date: Mon, 24-Sep-84 07:52:27 EDT
Article-I.D.: fisher.318
Posted: Mon Sep 24 07:52:27 1984
Date-Received: Wed, 26-Sep-84 05:30:04 EDT
References: <3679@decwrl.UUCP>
Organization: Princeton Univ. Statistics
Lines: 17

Proof that all horses are black:

Done by induction on the number of horses.

If n=0, the statement is vacuously true.
Assume that it is true for n=k, and show that the k+1 horse is also
black.

Take the k+1 horse and switch it with one of the other k horses. Since
it is now one of the first k horses, it is black by the induction
hypothesis, and the horse now numbered k+1 is also black, as it was
drawn from the first group of k. Therefore, it is true for k+1.

Thus all horses are black.

					David Rubin
			{allegra|astrovax|princeton}!fisher!david