Suppose you want to make a password using exactly 4 out of the 6 letters: e, t, a, b, p, k. You do not want to repeat any letter. Only lower-case letters are used. Provide the code that you would use in R to answer how many different passwords can be created.

15 different passwords.

Step-by-step explanation:

Since I need to make a password of 4 letters from 6 given letters without repeating any letters, this can be done using combination.

Combination has to do with selection of some object from a pool of many objects.

Generally, if r objects are to be selected from a pool of n objects, this can be done in nCr number of ways where:

nCr = n!/(n-r)!r!

Applying the formula, if 4 letters are to be selected from 6 letters, this can be done in 6C4 ways

6C4 = 6!/(6-4)!4!

= 6!/2!4!

= 6×5×4!/2×4!

= 6×5/2

= 15ways

This shows that I can use 15 different passwords without repeating any letter

yes because there is exactly one y value for every x value

for function there can't be more than one value for every x value

7 ft 6 in means 7 1/2, because 6 in is 1/2 of a foot. 7 ft 8 in means 7 2/3 because 8 in is 2/3 of a foot. 23/3 = 7 2/3. 15/2 = 7 1/2.

23/3   *   15/2   = 57 1/2

step-by-step explanation: