From: Paolo Capriotti <p.capriotti@...>
Date: 2006-07-11T09:06:20+09:00
Subject: Re: [QUIZ] Panagrams (#86)

> well, I'm not sure if it is possible for every start of a sentence,
> perhaps try another. (any thoughts from the mathematicians out there?)

Not all sentences can be completed to a pangram. Try a sentence
containing 999998 a's and a less than, say, 500 of all other letters.
Yes, I agree that such an example cannot be realized by en english
sentence, but a greater number of other letters could be allowed by
appropriately lowering the number of a's (it could be difficult to
prove, though).

In italian one can construct a counterexample with 'only' 1998 l's
(this is based on the fact that 1999 contains two l's, while 2000
containes 2, and no number less than 1000 contains l's).

Paolo Capriotti