👤
Johndalerepaso04go
Answered

Using the Fundamental Counting Principle and the formula for permutation, show how to find the number of ways of choosing three initials from the alphabet if tge letters should not be repeated.






pls. someone answer this, rush kasi toh ​

Using The Fundamental Counting Principle And The Formula For Permutation Show How To Find The Number Of Ways Of Choosing Three Initials From The Alphabet If Tge class=

Sagot :

Ralfjuztingo

(a,b,c...z)

(abc) (def) (ghi) (jkl) (mno) (pqr) (stu) (vwx)

8 ways

or

(bcd) (efg) (hij) (klm) (nop) (qrs) (tuv) (wxy)

8 ways

or

(cde) (fgh) (ijk) (lmn) (opq) (rst) (uvw) (xyz)

8 ways

Sajemni28go

Answer:

There are 26 letters for the first initial then 25 other options for the second and 24 for the third.Thus,the answer is 26 x 25 x 24 =15600

Step-by-step explanation:

P(n,r) =P(26,3)

=26! / (26-3)!

=15,600

Go Training: Other Questions