Question

In: Advanced Math

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 quiz that has six
questions, each with four possible responses: a, b, c, d. What is the minimum number of students that
must be in the professor’s class in order to guarantee that at least three answer sheets must be identical?
(Assume that no answers are left blank.)

Solutions

Expert Solution

Question 1:

a) Number of words = 26^6 [since each letter can be selected from one of the 26 characters a-z]

b) Number of words being with vowel = 5 * 26^5 [ since the first place must be filled with a vowel, which are 5 (a,e,i,o,u), rest 5 places can be filled by any alphabet]

c) Number of words being with vowel and end with vowel = 5^2 * 26^4 [since the first and last place must be filled with vowel]

d) Number of words with no vowel = 21^6 [we are left with only (26-5) = 21 possibilities for each spot after removing the 5 vowels from the queue]

e) Number of words having exactly one vowel = There are 6 possible places to place the vowel, which can be done in 6C1 ways, then the vowel can be selected in 5 ways and remaining 5 positions can be filled in 21^5 ways

Total ways = 6C1 * 5 * 21^5

Question 2:

Since the test contains 6 questions, hence we can answer the first problem in 4-ways, second problem in 4-ways and so on for 3rd, 4th, 5th and 6th ways

Number of ways to answer the quiz = 4^6 = 4096 ways

This is the problem of pigeonhole principle, now we have 4096 holes, which are the particular set of answers to the quiz.

Now for getting same three answer sheets, we need to fill all the holes first twice, which is 4096 * 2 = 8192

Now, the next student must belong to any of the hole, so one hole must contain 3 similar answer sheets.

Hence the minimum number of students must be in professor class will be equal to 8193

Note - Post any doubts/queries in comments section. Rate the answer positive if found helpful


Related Solutions

A random rearrangement doe not separate out between repeated letters. Consider word CHRISTMASTIME. a) What's the...
A random rearrangement doe not separate out between repeated letters. Consider word CHRISTMASTIME. a) What's the expected # vowels in first three letters of random rearrangement of CHRISTMASTIME? b) What's probability that all the S's happen before all the I's in random rearrangement of CHRISTMASTIME? c) What's probability that word CHRIST happens in consecutive letters of uniform rearrangement of CHRISTMASTIME?
Q‒1. [2×10 marks] In the questions below suppose that a “word” is any string of seven...
Q‒1. [2×10 marks] In the questions below suppose that a “word” is any string of seven letters of the alphabet, with repeated letters allowed. a) How many words begin with R and end with T? b) How many words begin with A or B? c) How many words begin with A or end with B? d) How many words begin with A or B and end with A or B? e) How many words begin with A or B or...
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.
Let’s start by assigning letters for our alleles for the two traits: *****These are the letters...
Let’s start by assigning letters for our alleles for the two traits: *****These are the letters that I assigned***** Colony color: Red: RR            Cream: rr .Tryptophan Dependence: Growth: TT        No Growth: tt Now, let’s do our first parental cross of the yeast dihybrid, homozygous parents! Fill in the Punnett Square where the grey is the area to list the gametes generated from each parent (P1) and the white boxes are the F1 offspring ***first row and colum are grey***** ---------->grey...
A secret pass code is made of 6 letters none of which are repeated. What is...
A secret pass code is made of 6 letters none of which are repeated. What is the probability that the code starts with B?
public int getIndexOfWord(String[] arr, String word){ // if found, return the index of word, otherwise return...
public int getIndexOfWord(String[] arr, String word){ // if found, return the index of word, otherwise return -1 } public boolean areArrays(int[] arr1, int[] arr2){ // 1. initial check: both arrays need to have the same length, return false if not the same // 2. return true if both given arrats are equals(same values in the same indices), false otherwise } public boolean areArraysEqual(String[] arr1, String[] arr2){ // 1. initial check: both arrays need to have the same length, return false...
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...
Write a program that will prompt for a word with at least five letters in it...
Write a program that will prompt for a word with at least five letters in it (if not, keep asking for input). Then evaluate the word to produce a count of all the vowels in the word. Sample output appears below. Enter a word at least 5 characters long:<SPC>cat<ENTER> Enter a word at least 5 characters long:<SPC>dog<ENTER> Enter a word at least 5 characters long:<SPC>concatenate<ENTER> Letter Counts ========= a: 2 e: 2 i: 0 o: 1 u: 0
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT