Pangrams


{Example Pangrams} {Student Contributions} [Useful Links] [Teaching @ PUCSD] [Home]

Pangrams are sentences that contain each letter of alphabet, such as the well-known sentence used to test typewriters -

The quick brown fox jumps over the lazy dog.
or even those that contain each letter a definite no. of times. The following example contains each consonant once and each vowel twice.
Why jog exquisite bulk, fond crazy vamp,
Daft buxom jonquil, zephyr's gawky vice?
Guy fed by work, quiz Jove's xanthic lamp-
Zow! Qualms by deja vu gyp fox-kin thrice.

These sentences are a short leap away from the most advanced pangrams of all, the self-documenting pangrams.

This first pangram has five a's, one b, one c, two d's, twenty-nine e's, six f's, four g's, eight h's, twelve i's, one j, one k, three l's, two m's, nineteen n's, twelve o's, two p's, one q, eight r's, twenty-six s's, twenty t's, three u's, five v's, nine w's, three x's, four y's and one z.
The change from previous pangram to advanced pangram is from a sentence X about which we can say "X has so many a's, so many b's, ... and so many z's", to a sentence X that has this very form - and that is also true. Logically this is a leap from other-reference to self-reference.

Examples of self-documenting pangrams

How about this Dutch pangram :

Here are a few involving Roman-numerals :

Hats off to this binary pangram (I as 1 and O as 0 in counts) --

Student contributions

Self-documenting pangrams generation was one of the course assignments that I had given during Introduction to Programming course at PUCSD in 1996. Listed below are some of the pangrams that course registrants produced via their programs.

Keeping the counts in Roman numerals :

Counting in binary (I and O represent 1 and 0 respectively, in counts) :


Created on May 01, 2006