9. How many strings can be formed by ordering the letters SCHOOL using some or all of the letters?
1 answer:
The number of strings that can be formed by ordering the letters SCHOOL using some or all of the letters is 1440 strings
<h3>What is Permutation in Mathematics ?</h3>Permutation can be defined as number of ways in which things can arranged.
We were given to find how many strings that can be formed by ordering the letters SCHOOL using some or all of the letters.
First of all, How many distinct letters are in the word SCHOOL ?
The distinct letters are 5 in numbers.
What is the total number of letters in the word SCHOOL ?
The total number of letters is 6.
Then
6! + 5
That is, 6 factorial + 6 permutation 5
( 6 x 5 x 4 x 3 x 2 x 1 ) + 6!/( 6 - 5)!
720 + 720
1440 strings
Therefore, the number of strings that can be formed by ordering the letters SCHOOL using some or all of the letters is 1440 strings
Learn more about Permutation here: brainly.com/question/4658834
#SPJ1
You might be interested in
Answer:
Step-by-step explanation:
y = -3x - 3
m = -3_______
b = -3________
y = 2x + 2
m = 2_______
b = _2_______
SOLVE NOW : -3x - 3 = 2x + 2
- 5x = 5
x = -1
subst in y : y = 2(-1)+2 = 0
the solution is : ( - 1 , 0 )
y = -3x- 3 an equation for the line 'red'
y = 2x+2 an equation for the line 'bleus'
Answer:
Step-by-step explanation:
By definition, we can write ln instead of log. WHEN??
Whenever the base of the logarithm is the number "e".
Hence, when we have:
We can write it in shortcut as:
Hence, ln x can also be written as
Fourth answer choice is right.