What is the probability of these events when we randomly select a permutation of the 26 lowercase letters of the english alphabet?

a. the first 13 letters of the permutation are in alphabetical order.

b. a is the first letter of the permutation and z is the last letter.

c. a and z are next to each other in the permutation.

d. a and b are not next to each other in the permutation.

e. a and z are separated by at least 23 letters in the permutation. f ) z precedes both a and b in the permutation?

There are 26! (about 403*10^24) possible permutations of the 26 letters.

a. We're allowing permutations matching the pattern

and so on.

Quick note: If the permutations starts with "o", then we could allow cyclic permutations, such as

to be in alphabetical order, but not

The first letter determines the next 12, and we have 26 choices for the first letter. The remaining 13 positions can take any of the remaining 13 letters. So there are 26*13! such permutations, and the probability is

On the other hand, if we want to be stricter about what alphabetical order entails and prohibit permutations starting with "o" or any other letter of the alphabet following "o", then the first position has 14 possible choices ("a" through "n"). Then there are 14*13! = 14! such permutations, and the probability of this occurring is

b. We're fixing the first and last positions, leaving 24 positions to be filled by any of the remaining 24 letters. There are 24! such permutations, so the probability of this happening is

c. I'll assume here that permutations like

are okay, but not

The number of permutations containing "a z" is the same as the number of permutations containing "z a". There are 25 valid positions for "a" to take and precede "z". The remaining 24 positions can take on any other letter. So the number of such permutations is 25*24! = 25!. We double this to count the same permutations with "a" and "z" swapped. So the probability is

d. Use the same strategy as in part (c). There are 2*25! permutations containing "a b" or "b a". We want the permutations that don't have this subsequence, so we subtract this number from the total number of permutations. So the probability is

e. We first need to count how many ways we can have a distance of 23 between "a" and "z". Luckily there are only two cases:

all 3 of which involve 24! ways of permuting the remaining 24 letters, so we multiply by 2. We have to multiply by 2 again to account for swapping "a" and "z". So the probability is

f. "z" has 24 possible positions because at least 2 of the positions after the occurrence of "z" must include "a" and "b". There's a simple pattern to the number of permutations here:

and so on, so that there are

such permutations, and the probability is

step-by-step explanation:

853.3

step-by-step explanation: