Bissoy.com
Doctors Medicines MCQs Q&A

14 different letters of alphabet are given, words with 6 letters are formed from these given letters. How many number of words are there which have at least one letter repeated?

14 different letters of alphabet are given, words with 6 letters are formed from these given letters. How many number of words are there which have at least one letter repeated? Correct Answer 999988

Number of words which have at least one letter replaced = total number of words – total number of words in which no letter is repeated, => 106 – 12P6 => 1000000 − 924 = 999988.

Related Questions

Nine different letters of alphabet are given, words with 5 letters are formed from these given letters. Then, how many such words can be formed which have at least one letter repeated ?
Ten different letters of alphabet are given, words with 5 letters are formed from these given letters. Then, the number of words which have at least one letter repeated is:
Study the information carefully and answer the questions given below: If we arrange the alphabets in the word "RATE" in the English alphabetical order, word "AERT" is formed. Then the third alphabet from the left in this word is "R". similarly, from the word "OPEN" we get - "ENOP" and the third alphabet from the left is "O". From the word "CHEF" we get - "CEFH" the third alphabet from the left "F". From the word "TOY" we get - "OTY" and the third alphabet from the left is "Y". From the word "EAT" we get - "AET" and the third alphabet from the left is "T" If we use all these letters, then a meaningful English word "FORTY" can be formed. Now find which of the following word set DOES NOT give a meaningful word in a similar way.
How many three letter meaningful English words can be formed, first letter of “GOAT”, second letter of “DRAG”, fifth letter of “GREAT” and fourth letter of TRAY? (letters should not be repeated)
How many such pairs of letters are there in a word which formed by replacing each vowel of the word ‘LIQUIDITY’ with the next letter and each consonant is replaced by immediate previous letter as per English alphabet, each of which has as many letters between them in the word, as they have in the English alphabet?
How many such pairs of letters are there in a word which formed by replacing each vowel of the word ‘SUPERVISION’ with the next letter and each consonant is replaced by immediate previous letter as per English alphabet, each of which has as many letters between them in the word, as they have in the English alphabet?
ABCDEFGHIJKLMNOPQ RSTUVWXYZ. Which letter in this alphabet is the eighth letter to the right of the letter and which is tenth letter to the left of the last but one letter of the alphabet?
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z . Which letter in this alphabet is the eighth letter to the right of the letter and which is tenth letter to the left of the last but one letter of the alphabet?
A particular BNF definition for a “word” is given by the following rules. ∷ = | | ∷ = |  ∷ = |  ∷ = a | b | c | ….. |y| z  ∷ = 0 |1|2| …… | 9 Which of the following lexical entries can be derived from < word > ? l. pick II. picks lll. c44
User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads. Which of the following statements is/are true ? (a) (i) The Many - to - one model maps many user threads to one kernel thread (ii) The one - to - one model maps one user thread to one kernel thread (iii) The many - to - many model maps many user threads to smaller or equal kernel threads (b) (i) Many - to - one model maps many kernel threads to one user thread (ii) One - to - one model maps one kernel thread to one user thread (iii) Many - to- many model maps many kernel threads to smaller or equal user threads