Question

In: Statistics and Probability

3. An experiment consists of randomly rearranging the 10 letters of the word QUARANTINE into a...

3. An experiment consists of randomly rearranging the 10 letters of the word
QUARANTINE
into a sequence of 10 letters, where all possible orders of these 10 letters are equally likely. Find the probability of each of the following events:
(1) 2 the first three letters include no A’s;
(2) 3 the first three letters or the last three letters (or both) include no A’s;
(3) 2 the fourth letter is the first A;
(4) 3 the first letter and the last letter are the same;
(5) 2 the word ‘QUARANTINE’ is obtained;
(6)3 the sequence contains the word ‘RAN’

Solutions

Expert Solution

Given that:

An experiment consists of randomly rearranging the 10 letters of the word QUARANTINE into a sequence of 10 letters, where all possible orders of these 10 letters are equally likely.

The word is QUARANTINEE

Q=1,U=1,A=2,R=1,N=2,T=1,I=1,E=1

(1) the first three letters include no A’s;

Let Event A = The first three letters include no A's

Favourable outcome: Two A's can fill column 4 to 10.And rest letter can occupy any remaining column

Note: Number of arrangements of n letter words in which one letter repeat r1 times another letter repeat r2 times and ......nth letter repeat rn times is

(2)  the first three letters or the last three letters (or both) include no A’s;

Let event B =last three letters don't include A's

We have to find

Now,outcome favorable to Event B -Two A's can occupy any column from 1 to 7 and the rest letter are occupied remaining space

Outcome variable to event

i.e No A's occupy either the first 3 letters or last 3 letter it means both A,s have to occupy the column 4 to 7.And rest letter occupy the remaing partition

(3) the fourth letter is the first A;

Let Event C= The fourth letter is the first A

Favourable outcome: Second A's can occupy any position from 5 to 10 column and rest letter occupy any remaining columns

(4) the first letter and the last letter are the same;

Let Event D ; First letter and last letters are same

Favourable outcome:Remaing letters can occupy any position from 2nd tp 9th column

(5) the word ‘QUARANTINE’ is obtained;

Word 'QUARANTINE' is obtained

(6) the sequence contains the word ‘RAN’.

Let Event E = sequance contains the word RAN

Favorable outcomes: The sequences 'RAN' can occupy positions (1,2,3),(2,3,4) (3,4,5) ,....(8,9,10)

Total 8 ways

And the remaining letters can occupy any remaining position


Related Solutions

An experiment consists of randomly rearranging the 10 letters of the word QUARANTINE into a sequence...
An experiment consists of randomly rearranging the 10 letters of the word QUARANTINE into a sequence of 10 letters, where all possible orders of these 10 letters are equally likely. Find the probability of each of the following events: (1) the first three letters include no A’s; (2)  the first three letters or the last three letters (or both) include no A’s; (3) the fourth letter is the first A; (4) the first letter and the last letter are the same;...
5. Of the 9-letter passwords formed by rearranging the letters AAAABBCCC (4 A’s, 2 B’s, and...
5. Of the 9-letter passwords formed by rearranging the letters AAAABBCCC (4 A’s, 2 B’s, and 3 C’s), I select one at random. Determine the following probabilities. (a) Prob (my word is a palindrome and has no two C’s next to each other). 4 points (b) Prob (my word has two C’s next to each other and the other C not next to them). (c) Prob (my word has the three C’s next to each other and the B’s apart...
5. Of the 9-letter passwords formed by rearranging the letters AAAABBCCC (4 A’s, 2 B’s, and...
5. Of the 9-letter passwords formed by rearranging the letters AAAABBCCC (4 A’s, 2 B’s, and 3 C’s), I select one at random. Determine the following probabilities. (a) Prob (my word is a palindrome and has no two C’s next to each other). (b) Prob (my word has two C’s next to each other and the other C not next to them). (c) Prob (my word has the three C’s next to each other and the B’s apart from each...
A machine prints a word and the number of letters in this word is a Poisson...
A machine prints a word and the number of letters in this word is a Poisson distributed random variable with parameter λ (so it could possibly have zero letters). However, each letter in the word is printed incorrectly with probability 2/3 independently of all other letters. Compute the expectation and the variance of the number of incorrect letters in the word that the machine prints.
A word is said to be “abecedarian” if the letters in the word appear in alphabetical...
A word is said to be “abecedarian” if the letters in the word appear in alphabetical order. For example, the following are all six-letter English abecedarian words: abdest, acknow, acorsy, adempt, adipsy, agnosy, befist, behint, beknow, bijoux, biopsy, cestuy, chintz, deflux, dehors, dehort, deinos, diluvy, dimpsy Write a method called isAbecedarian that takes a String and returns a boolean indicating whether the word is abecedarian.
Suppose a state's license plate consists of 3 numbers followed by 3 letters. However, NO two...
Suppose a state's license plate consists of 3 numbers followed by 3 letters. However, NO two letters or numbers can be the same. How many different license plates can be made? I don't understand how to solve this question because of the "NO"?
Suppose that a “word” is any string of six letters. Repeated letters are allowed. For our...
Suppose that a “word” is any string of six letters. Repeated letters are allowed. For our purposes, vowels are the letters a, e, i, o, and u. a) How many words are there? b) How many words begin with a vowel? c) How many words begin with a vowel and end with a vowel? d) How many words have no vowels? e) How many words have exactly one vowel? A professor teaching a Discrete Math course gives a multiple choice...
An automobile license plate consists of 3 letters followed by 4 digits. How many different plates...
An automobile license plate consists of 3 letters followed by 4 digits. How many different plates can be made: a. If repetitions are allowed? b. If repetitions are not allowed in the letters but are allowed in the digits? c. If repetitions are allowed in the letters but not in the digits?
If all permutations of the letters of the word "BEFORE" are arranged in the order as...
If all permutations of the letters of the word "BEFORE" are arranged in the order as in a dictionary. What is the 32 word?
In C Exercise 8.1 A word is said to be “abecedarian” if the letters in the...
In C Exercise 8.1 A word is said to be “abecedarian” if the letters in the word appear in alphabetical order. For example, the following are all 6-letter English abecedarian words. abdest, acknow, acorsy, adempt, adipsy, agnosy, be?st, behint, beknow, bijoux, biopsy, cestuy, chintz, de?ux, dehors, dehort, deinos, diluvy, dimpsy a. Describe an algorithm for checking whether a given word (String) is abecedarian, assuming that the word contains only lower-case letters. Your algorithm can be iterative or recursive. b. Implement...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT