How many different three letter passwords can be formed from the letters a, b,c, d,e, f, and g if no repetition of letters is allowed? someone i’m stuck on this problem

210 passwords

Step-by-step explanation:

We are asked how many different 3 letter passwords can be formed from the letters A, B, C, D, E, F, and G.

If there is no repetition of letters is allowed, then we can choose the arrangement in the form of .

Now,  

So there can be 210 passwords be formed from the above condition. (Answer)

step-by-step explanation:

given that there are two triangles j'k'l' and jkl>

the former is got by dilating the second one.

when drawn on a grid, (graph paper) coordinates of vertices of first triangle is

(6,12)j, (9,6)k and (12,9)l

side jk has length = distance between j and k

=

side j'k'=distance between j' and k'

=

ie j'k'l' has sides 1/3 of that of corresponding sides of jkl.

hence scale factor of 1/3 is used to get j'k'l'from jkl