How many 4-letter words with or without meaning, can be formed out of LOGARITHMS

Best Selling Hand Written Notes

We are selling best-handwritten notes at a cheap price in Study91 which are follows:

Video Class Tutorial

Study 91 provide video class tutorials for every aspirants for their exams by their experts.

How many 4-letter words with or without meaning, can be formed out of LOGARITHMS

We provide the Best Online Solution with Innovative Contents which is increase your Learning Skills.

quick links

contact us

How many 4-letter words with or without meaning, can be formed out of LOGARITHMS

11. 

In how many ways can a group of 5 men and 2 women be made out of a total of 7 men and 3 women?

Answer: Option A

Explanation:

Required number of ways = (7C5 x 3C2) = (7C2 x 3C1) =
How many 4-letter words with or without meaning, can be formed out of LOGARITHMS
7 x 6 x 3
How many 4-letter words with or without meaning, can be formed out of LOGARITHMS
= 63.
2 x 1


12. 

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?

Answer: Option C

Explanation:

'LOGARITHMS' contains 10 different letters.

Required number of words = Number of arrangements of 10 letters, taking 4 at a time.
= 10P4
= (10 x 9 x 8 x 7)
= 5040.


13. 

In how many different ways can the letters of the word 'MATHEMATICS' be arranged so that the vowels always come together?

A. 10080
B. 4989600
C. 120960
D. None of these

Answer: Option C

Explanation:

In the word 'MATHEMATICS', we treat the vowels AEAI as one letter.

Thus, we have MTHMTCS (AEAI).

Now, we have to arrange 8 letters, out of which M occurs twice, T occurs twice and the rest are different.

How many 4-letter words with or without meaning, can be formed out of LOGARITHMS
Number of ways of arranging these letters =
8! = 10080.
(2!)(2!)

Now, AEAI has 4 letters in which A occurs 2 times and the rest are different.

Number of ways of arranging these letters = 4! = 12.
2!

How many 4-letter words with or without meaning, can be formed out of LOGARITHMS
Required number of words = (10080 x 12) = 120960.

The correct option is A

720

Step 1: Use combination formula

In the word LOGARITHMS there are 10 unique letters which are, A,G,H,I,L,M,O,R,Sand T.

Now we must create a three-letter word with or without meaning, with the restriction that letter repetition is not permitted, i.e., we cannot use the same letter more than once to create three-letter words.

We know that number of combinations of r objects chosen from n objects when repetition is not allowed is given by

Crn=n!r!(n-r)!

where n! is

n!=n×(n–1)×(n–2)×(n–3)×……..×3×2×1

So, three letters out of 10 unique letters can be selected in C310ways.

By using the above formula we get

C 310=10!3!(10-3)!

=10!3!(7) !

Step 2: Calculate the number of 3-letter words

In general, n! can be used to arrange n distinct objects.

We chose three letters from a list of ten unique letters, and these letters can be put in three different ways.

Total number of 3 letter word =C310×3!

∴ C310×3!=10!3!(7)!×3!

=10 !7!

=10×9×8×7!7!

=10×9 ×8

=720

Hence, the word LOGARITHMS if repetition of letters is not allowed can form 720 number of 3-letter words.

A. 40

B. 400

C. 5040

D. 2520

E. None of these

Solution(By Examveda Team)

'LOGARITHMS' contains 10 different letters.
Required number of words
= Number of arrangements of 10 letters, taking 4 at a time.
= 10P4
= (10 x 9 x 8 x 7)
= 5040

How many 4

So, the total arrangement is given by, 10×9×8×7=5040 .

How many 4

Explanation: 'LOGARITHMS' contains 10 different letters. = Number of arrangements of 10 letters, taking 4 at a time. = 5040.

How many words can be formed from LOGARITHMS?

Hence, the no. of 3 letter words formed from the word LOGARITHMS without repetition is 720. Hence the correct option of this question is option (a).

How many 4 letters words with or without meaning can be formed out of the letters of the word signature if repetition of the letters is not allowed?

Hence, the answer is 5040. Was this answer helpful?