Home » Aptitude » Permutation and Combination

If the letters of the word VERMA are arranged in all possible ways and these words are written out as in a dictionary, then the rank of the word VERMA is :

Correct Answer: 108

Explanation:

The number of words beign with A is 4!

The number of words beign with E is 4!

The number of words beign with M is 4!

The number of words beign with R is 4!

Number of words beign with VA is 3!

Words beign with VE are VEAMR

VEARM

VEMAR

VEMRA

VERAM

VERMA

Therefore, The Rank of the word VERMA = 4 x 4! + 3! + 6 = 96 + 6 + 6 =108

← Previous Question Next Question→

More Questions from Permutation and Combination

How many 4-letter words with or without meaning, can be formed out of the letters of the word, 'LOGARITHMS', if repetition of letters is not allowed ?
In how many ways can the letters of the word 'LEADER' be arranged ?
In how many ways the letters of the word 'CIRCUMSTANCES' can be arranged such that all vowels came at odd places and N always comes at end?
A box contains 5 green, 4 yellow and 3 white marbles. Threemarbles are drawn at random. What is the probability thatthey are not of the same colour ?
In how many ways can an animal trainer arrange 5 lions and 4 tigers in a row so that no two lions are together?
From a group of 7 men and 6 women, five persons are to be selected to form a committee so that at least 3 men are there on the committee. In how many ways can it be done?
A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls be drawn from the box, if at least one black ball is to be included in the draw?
A standard deck of playing cards has 13 spades. How many ways can these 13 spades be arranged?
A tea expert claims that he can easily find out whether milk or tea leaves were added first to water just by tasting the cup of tea. In order to check this claims 10 cups of tea are prepared, 5 in one way and 5 in other. Find the different possible ways of presenting these 10 cups to the expert.
There are five cards lying on the table in one row. Five numbers from among 1 to 100 have to be written on them, one number per card, such that the difference between the numbers on any two adjacent cards is not divisible by 4. The remainder when each of the 5 numbers is divided by 4 is written down on another card (the 6th card) in order. How many sequences can be written down on the 6th card ?

Discussion & Comments

No comments yet. Be the first to comment!

Join Discussion