Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 5: Problem 396

The number of ways in which the letter of the word "ARRANGE" can be arranged such that both \(\mathrm{R}\) do not come together is (a) 360 (b) 900 (c) 1260 (d) 1620

Short Answer

Expert verified
The number of ways in which the letters of the word "ARRANGE" can be arranged such that both R's do not come together is 600. However, this doesn't correspond to any of the given options, indicating an error in the options provided.

Step by step solution

01

Find the total number of arrangements without any restriction

ARRANGE has 7 letters, but the letters A and R are both repeated twice. The total number of ways to arrange this word without any restriction is \( \frac{7!}{2! \cdot 2!} \)
02

Find the number of arrangements where both R's are together

First, consider both R's as a single entity RR. Now, we have 6 entities - A, A, N, G, E, and RR. These 6 entities can be arranged in \( \frac{6!}{2!} \) ways. But within RR, there are 2! ways to arrange the Rs. Therefore, the number of ways to arrange the word with both R's together is \( \frac{6!}{2!} \cdot 2! \)
03

Find the number of ways where both R's are not together

Subtract the number of arrangements where both R's are together from the total number of arrangements without any restriction. \( \frac{7!}{2! \cdot 2!} - \frac{6!}{2!} \cdot 2! \) = \( (7 \cdot 6! - 6! \cdot 2) / (2 \cdot 2) \) = \( (6!)(7 - 2) / 4 \) = \( 5! \cdot 5 \) = 120 * 5 = 600 So, 600 ways to arrange the letters of the word "ARRANGE" such that no two R's are together. This doesn't correspond to any of the given options, which indicates that there's an error in the options provided.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Start your free trial

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

There are three piles of identical yellow, black, and green balls and each pile contains at least 20 balls. The number of ways of selecting 20 balls if the number of black balls to be selected is twice the number of yellow balls is (a) 6 (b) 7 (c) 8 (d)

The vertices of a regular polygon of 12 sides are joined to form triangles. The number of triangles which do not have their sides as the sides of the polygon is (a) 96 (b) 108 (c) 112 (d) 220

The straight lines \(\mathrm{I}_{1}, \mathrm{I}_{2}, \mathrm{I}_{3}\) are parallel and lie in the same plane. A total number of \(m\) points are taken on \(I_{1}, n\) points on \(\mathrm{I}_{2}, \mathrm{k}\) points on \(\mathrm{I}_{3}\). The maximum number of triangles formed with vertices at these points are (a) \(^{\mathrm{m}+\mathrm{n}+\mathrm{k}} \mathrm{C}_{3}\) (b) \({ }^{\mathrm{m}+\mathrm{n}+\overline{\mathrm{k}} \mathrm{C}_{3}-{ }^{\mathrm{m}}} \mathrm{C}_{3}-{ }^{\mathrm{n}} \mathrm{C}_{3}-{ }^{\mathrm{k}} \mathrm{C}_{3}\) (c) \({ }^{\mathrm{m}} \mathrm{C}_{3}+{ }^{\mathrm{n}} \mathrm{C}_{3}+{ }^{\mathrm{k}} \mathrm{C}_{3}\) (d) \(m+n+k-{ }^{m+n+k} C_{3}\)

Nine hundred distinct n digit numbers are to be formed using only the 3 digits \(2,5,7 .\) The smallest value of \(\mathrm{n}\) for which this is possible is (a) 6 (b) 7 (c) 8 (d) 9

The number of five digit number that can be formed by using \(1,2,3\) only, such that exactly three digit of the formed numbers are same is (a) 30 (b) 60 (c) 90 (d) 120
See all solutions

Recommended explanations on English Textbooks

Pragmatics

Read Explanation

Creative Story

Read Explanation

International English

Read Explanation

Graphology

Read Explanation

Key Concepts in Language and Linguistics

Read Explanation

Multiple Choice Questions

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free