Warning: Parameter 1 to wp_default_styles() expected to be a reference, value given in /home/anubhav1994/public_html/mpstudy.com/wp-includes/plugin.php on line 601

Warning: Parameter 1 to wp_default_scripts() expected to be a reference, value given in /home/anubhav1994/public_html/mpstudy.com/wp-includes/plugin.php on line 601
[Aptitude] PnC: arrange such that two people Always sitting together? - MP Study
Warning: Cannot assign an empty string to a string offset in /home/anubhav1994/public_html/mpstudy.com/wp-includes/class.wp-scripts.php on line 447

# [Aptitude] PnC: arrange such that two people Always sitting together?

## [Aptitude] PnC: arrange such that two people Always sitting together?

Q. How many ways can four children be made to stand in a line such that two of them A and B are always together? (-asked in UPSC Prelims 2010)

Confused? You won’t be, after reading this.
DONOT Proceed further, without reading The First article on basic concept of Permutation and Combination

1. Always Sit together
2. Never Sit together
3. Demo Questions: Permutation sitting together
4. Always Select
5. Never Select
6. Demo Question: Selection

CASE: ALWAYS SIT TOGETHER

Three couples are standing in the compound of Gokuldham society

• Jethalala + Dayaben
• Mehta saab + Anjali
• Aiyyer + Babita-ji

How many ways can you arrange them in such a way that Jethalal and Dayaben are always sitting together?
First, ask yourself, is it a permutation problem or a combination problem?
Since sitting= order matters, this is a permutation problem.
Now let us consider Jethalal and Daya as “ONE Person”. And they’ll sit in “one chair”.

Now you’ve the case of 5 Persons and 5 Chairs.
How many ways can use arrange them?
As we saw in the previous article
= 5 x 4 x 3 x 2 x 1
=5! Factorial Ways.
=120
But here ‘order’ matters, this is a permutation problem so
In the sitting order Daya-Jetha (DJ) and Jetha-Daya (JD) are two different arrangements.
So now time to split that “One person” Apart.
How many ways can use sit 2 persons (DJ) in 2 chairs?
2 x 1
=2 ways.
So, here we’ve
5 people sit in 5! Ways (=120)
2 people (Daya-Jetha) can sit in 2 ways.
According to fundamental counting
120 x 2 = 240 ways you can arrange this.

(Formula: 2P2 x 5P5); but we don’t need to use it.

CASE: DON’T SIT TOGETHER

Que. Same 3 couples (=6 persons), 6 chairs. How many ways you can arrange them so that Dayaben and Jethalal (DJ) never sit together.
Ans.
First how many ways can 6 people sit in 6 chairs?
=6! Factorial Ways. (=720) ; Solved in the first article.

How many ways can 6 people sit such that Dayaben and Jethalal (DJ) always sit together
=240 ways ; solved in previous case.

So
Total ways = Cases where DJ together + Cases where DJ not together
720=240 + DJ not together
DJ not together = 720-240=480 ways.
Answer: in 480 ways you can arrange the given 6 people such that Dayaben and Jethalal don’t sit together.
Formula: 6P6 minus [2P2 x 5P5]; but we don’t need to use it.

Demo Question:Sitting together

In CSAT Paper II (Aptitude), this can appear under different situations

• How many ways can four children be made to stand in a line such that two of them A and B are always together? (-already asked in UPSC Prelims 2010)
• How many ways can you arrange the word “Trial” where letters T and L are always together?
• How many ways can you arrange the word “Trial” where letters R and A are never together?

COMBINATION PROBLEM: ALWAYS SELECT, NEVER SELECT

CASE: ALWAYS SELECT

Director Asit Modi wants to shoot an episode in Kutch. Out of the 6 characters, how many ways can he select 4 character such that Dayaben and Jethalal (DJ) are always in the crew?

Here ‘order’ doesn’t matter, only selection matters. After all this is just another ‘Committee’
DJ and JD are one and same.
Now deconstruct the problem
6 people
Select 4.
2 must be selected (DJ)

How many ways can you select Dayaben and Jethalal? : One way.
Matter finish.
Now worry about the remaining 2 vacancies.
we’ve 4 characters left (Mehta-Anjali, Aiyyar-Babita)
And we’ve to select two of them.
Classical combination problem. Solve it according to previous article.