Write a series of programs in the same language that print “Hello, world!” using n distinct source characters, where n is in [1..10] inclusive (“distinct” meaning that duplicate characters are ignored from character count). The winner is the solution with the most programs, each with distinct n. I suggest making one solution per language, which is treated like a wiki.
- Case-sensitive ('H' and 'h' are distinct characters)
- In case-insensitive languages, all non-string-literal characters are assumed to be uppercase.
- EDIT: No characters ignored by the compiler (comments)
- Output must be exactly “Hello, world!” (without quotes) - no variations in punctuation or case, and no newline.
- “Output” can mean either value of the expression or output to stdout.
- Esoteric programming languages are very much allowed.
- EDIT: The language must already exist (as of this question being asked).
- If anyone gets all of [1..10], they are the accepted winner.
Here's a polyglot example:
It scores 11 (and thus is not part of a solution) because it includes distinct characters: