Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site watdaisy.UUCP
Path: utzoo!watmath!watdaisy!gjerawlins
From: gjerawlins@watdaisy.UUCP (Gregory J.E. Rawlins)
Newsgroups: net.puzzle
Subject: Re: abcde
Message-ID: <7194@watdaisy.UUCP>
Date: Wed, 17-Apr-85 12:11:42 EST
Article-I.D.: watdaisy.7194
Posted: Wed Apr 17 12:11:42 1985
Date-Received: Thu, 18-Apr-85 01:47:38 EST
References: <372@ho95b.UUCP>
Reply-To: gjerawlins@watdaisy.UUCP (Gregory J.E. Rawlins)
Organization: U of Waterloo, Ontario
Lines: 15

In article <372@ho95b.UUCP> ran@ho95b.UUCP (RANeinast) writes:
>What is the fewest number of regular English
>words are needed to contain all the letters of the
>alphabet in order?
>Example:
>aback deafening hijack lime nope quark stun vow foxy zed.
>^^ ^  ^  ^    ^ ^^^  ^ ^ ^  ^^^  ^  ^  ^^^  ^ ^   ^^ ^
>does it in 10.

	Here's one in 9.
cambric deafening hijack limned opaque rest purview waxy zoo
 ^ ^  ^ ^^ ^    ^ ^^^  ^ ^ ^^   ^^ ^   ^ ^^  ^ ^    ^ ^^ ^
-- 
Gregory J.E. Rawlins, Department of Computer Science, U. Waterloo
{allegra|clyde|linus|inhp4|decvax}!watmath!watdaisy!gjerawlins