मराठी
तामिळनाडू बोर्ड ऑफ सेकेंडरी एज्युकेशनएचएससी वाणिज्य इयत्ता ११

Find the number of arrangements that can be made out of the letters of the word “ASSASSINATION”.

Advertisements
Advertisements

प्रश्न

Find the number of arrangements that can be made out of the letters of the word “ASSASSINATION”.

संख्यात्मक
Advertisements

उत्तर

The number of letters of the word “ASSASSINATION” is 13.

The letter A occurs 3 times

The letter S occurs 4 times

The letter I occur 2 times

The letter N occurs 2 times

The letter T occurs 1 time

The letter O occurs 1 time

∴ Number of arrangements = `(13!)/(3!4!2!2!1!1!) = (13!)/(3!4!2!2!)`

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 2: Algebra - Exercise 2.3 [पृष्ठ ३६]

APPEARS IN

संबंधित प्रश्‍न

In how many ways can the letters of the word PERMUTATIONS be arranged if the there are always 4 letters between P and S?


How many numbers of six digits can be formed from the digits 0, 1, 3, 5, 7 and 9 when no digit is repeated? How many of them are divisible by 10 ?


Write the number of ways in which 6 men and 5 women can dine at a round table if no two women sit together ?


The number of ways to arrange the letters of the word CHEESE are


The number of ways in which the letters of the word ARTICLE can be arranged so that even places are always occupied by consonants is


How many numbers lesser than 1000 can be formed using the digits 5, 6, 7, 8, and 9 if no digit is repeated?


In how many ways 3 mathematics books, 4 history books, 3 chemistry books and 2 biology books can be arranged on a shelf so that all books of the same subjects are together.


The number of permutations of n different objects, taken r at a line, when repetitions are allowed, is ______.


Five boys and five girls form a line. Find the number of ways of making the seating arrangement under the following condition:

C1 C2
(a) Boys and girls alternate: (i) 5! × 6!
(b) No two girls sit together : (ii) 10! – 5! 6!
(c) All the girls sit together (iii) (5!)2 + (5!)2
(d) All the girls are never together : (iv) 2! 5! 5!

Let b1, b2, b3, b4 be a 4-element permutation with bi ∈ {1, 2, 3, .......,100} for 1 ≤ i ≤ 4 and bi ≠ bj for i ≠ j, such that either b1, b2, b3 are consecutive integers or b2, b3, b4 are consecutive integers. Then the number of such permutations b1, b2, b3, b4 is equal to ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×