answersLogoWhite

0


Best Answer

In a "language" containing just 10 letters, there are 10,000 four-letter permutations. It's easy to work out if you simply replace the letters with decimal digits 0-9. The first permutation is 0000, followed by 0001, 0002, 0003, ..., 9997, 9998 and 9999.

User Avatar

Wiki User

6y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: How many strings can be formed of length 4 from a language containing 10 letters?
Write your answer...
Submit
Still have questions?
magnify glass
imp