Skip to content
Quantoros

Using the five distinct letters of magic at most once each, how many nonempty strings of any length can be formed?

Quant ResearchLevel: IntermediateVariable-length permutations

Using the five distinct letters of magic at most once each, how many nonempty strings of any length can be formed?

Hints
  • Separate by string length.
  • For length k use ordered selection without replacement.

Answer

Sum ordered selections for lengths 1 through 5: 5+20+60+120+120=325. A subset count 2^5-1 would ignore order, while 5! would count only full-length strings.

Source and licence: Oscar Levin — Discrete Mathematics: An Open Introduction, 3rd edition · CC-BY-SA-4.0 · answer: Quantoros editorial

Related questions