Register

Which rule must be used to find the number of strings of eight uppercase English letters that are there if the letters can be repeated?

Which rule must be used to find the number of strings of eight uppercase English letters that are there if the letters can be repeated?
170k views
3 votes
Which rule must be used to find the number of strings of eight uppercase English letters that are there if the letters can be repeated?

User Ruzin
by
7.7k points

1 Answer

6 votes
The rule that must be used to find the number of strings of eight uppercase English letters that are there if the letters can be repeated is 26^8
User Brian Le
by
8.2k points
← Prev Question Next Question →

Related questions

User Ddieppa
asked Nov 27, 2017 84.2k views
How many strings of eight uppercase English letters are there if no letter can be repeated?
Ddieppa asked Nov 27, 2017
by Ddieppa
7.1k points
1 answer
0 votes
84.2k views
User Kode
asked Nov 27, 2017 60.0k views
How many strings of eight uppercase English letters are there that start with X, if no letter can be repeated?
Kode asked Nov 27, 2017
by Kode
7.8k points
1 answer
1 vote
60.0k views
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories

Other Questions

How do you can you solve this problem 37 + y = 87; y =
What is .725 as a fraction
How do you estimate of 4 5/8 X 1/3
Link Copied!