0% found this document useful (0 votes)
88 views5 pages

IIT Maths 2025 Permutations & Combinations Solution

The document presents various problems related to permutations and combinations, specifically tailored for IIT Mains 2025. It includes detailed calculations for arrangements of letters and groups, as well as methods to determine the number of valid configurations under specific constraints. The document also explores combinations for group selections and calculations for numbers within certain ranges.

Uploaded by

Mangal Laguri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
88 views5 pages

IIT Maths 2025 Permutations & Combinations Solution

The document presents various problems related to permutations and combinations, specifically tailored for IIT Mains 2025. It includes detailed calculations for arrangements of letters and groups, as well as methods to determine the number of valid configurations under specific constraints. The document also explores combinations for group selections and calculations for numbers within certain ranges.

Uploaded by

Mangal Laguri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Solutions – Permutations-Combinations – IIT Mains – 2025 Problems

Let 𝐌 occupy the middile box (we have no other choice)

1 2 M 4 5

12
For 𝐛𝐨𝐱𝟏 , 𝐛𝐨𝐱𝟐 we have 𝐀, 𝐁, 𝐂, … , 𝐋 (12 letters) to choose from: 𝐶2 = 66 ways

For 𝐛𝐨𝐱𝟒 , 𝐛𝐨𝐱𝟒 we have 𝐌, 𝐍, 𝐎, … , 𝐙 (13 letters) to choose from: 13𝐶 ways = 78 way
2

(For the two chosen letters no different orders, the only order − alphabetical)

Required number of ways = 66 × 78 = 5148

The following two arrangements are possible: 𝐆 𝐆 𝐆 𝐁 𝐁 𝐁 𝐁 and 𝐁 𝐁 𝐁 𝐁 𝐆 𝐆 𝐆

For 1 st arrangement:
Number of ways girls can be arranged: 3! = 6

Number of ways boys can be arranged had there been no B1 , B2 restriction: 4! = 24


Following 12 permutations are not allowed:

𝐁𝟏 𝐁𝟐 𝐁𝟑 𝐁𝟒 𝐁𝟐 𝐁𝟏 𝐁𝟑 𝐁𝟒
𝐁𝟏 𝐁𝟐 𝐁𝟒 𝐁𝟑 𝐁𝟐 𝐁𝟏 𝐁𝟒 𝐁𝟑

𝐁𝟑 𝐁𝟏 𝐁𝟐 𝐁𝟒 𝐁𝟑 𝐁𝟐 𝐁𝟏 𝐁𝟒
𝐁𝟒 𝐁𝟏 𝐁𝟐 𝐁𝟑 𝐁𝟒 𝐁𝟐 𝐁𝟏 𝐁𝟑

𝐁𝟑 𝐁𝟒 𝐁𝟏 𝐁𝟐 𝐁𝟑 𝐁𝟒 𝐁𝟐 𝐁𝟏
𝐁𝟒 𝐁𝟑 𝐁𝟏 𝐁𝟐 𝐁𝟒 𝐁𝟑 𝐁𝟐 𝐁𝟏

Number of ways boys can be arranged: 24 − 12 = 12

Number of permutations: 6 × 12 = 72

For 2nd arrangement:


Number of permutations = 6 × 12 = 72 (same as 1st arrangement)

Required number of ways = 72 + 72 = 144

1
Number of words formed from 𝐃, 𝐀, 𝐔, 𝐆, 𝐇, 𝐓, 𝐄, 𝐑: 8!

We group the vowels 𝐀, 𝐔, 𝐄 together and treat the group as an element like any other individual letter.
Number of elements (after grouping): 6
Number of permutations: 6!

Number of permutations of 𝐀, 𝐔, 𝐄: 3!

Number of words formed from 𝐃, 𝐀, 𝐔, 𝐆, 𝐇, 𝐓, 𝐄, 𝐑 if 𝐀, 𝐔, 𝐄 occur together: 6! 3!

Therefore, number of words formed from 𝐃, 𝐀, 𝐔, 𝐆, 𝐇, 𝐓, 𝐄, 𝐑 if 𝐀, 𝐔, 𝐄 never occur together: 8! − 6! 3!


= 6! (7 ∙ 8 − 3!) = 720(56 − 6) = 36000

𝐁 𝐁 𝐁 𝐁 𝐁 𝐆 𝐆 𝐆 𝐆 5! 4! permutations
𝐆 𝐁 𝐁 𝐁 𝐁 𝐁 𝐆 𝐆 𝐆 5! 4! permutations
Arrangements total number
: 𝐆 𝐆 𝐁 𝐁 𝐁 𝐁 𝐁 𝐆 𝐆 5! 4! permutations } : 5(5! 4!)
when all boys sit together of permutations
𝐆 𝐆 𝐆 𝐁 𝐁 𝐁 𝐁 𝐁 𝐆 5! 4! permutations
{ 𝐆 𝐆 𝐆 𝐆 𝐁 𝐁 𝐁 𝐁 𝐁 5! 4! permutations

(Alternatively, we can group the boys, ie we have: (𝟓𝐁), 𝐆, 𝐆, 𝐆, 𝐆 which means (5!)5! permutations)

The arrangement when no two boys sit together: 𝐁 𝐆 𝐁 𝐆 𝐁 𝐆 𝐁 𝐆 𝐁


for boys: 5!
Number of permutationss: { = 5! 4!
for girls: 4!

Required number of ways = 5(5! 4!) + 5! 4! = 5! 4! (5 + 1) = 5! 4! 6 = 120 × 24 × 6 = 17280

Possible combinations GroupA (4𝐁 + 1𝐆) + GroupA (3𝐆) ∶ ( 7𝐶4 3𝐶1 ) ∙ ( 5𝐶3 ) combinations
for picnic group of ∶ { GroupA (3𝐁 + 2𝐆) + GroupA (1𝐁 + 2𝐆) ∶ ( 7𝐶3 3𝐶2 ) ∙ ( 6𝐶1 5𝐶2 ) combinations
4𝐁 + 4𝐆 GroupA (2𝐁 + 3𝐆) + GroupA (2𝐁 + 1𝐆) ∶ ( 7𝐶2 3𝐶3 ) ∙ ( 6𝐶2 5𝐶1 ) combinations

Number of combinations: ( 7𝐶4 3𝐶1 ) ∙ ( 5𝐶3 ) + ( 7𝐶3 3𝐶2 ) ∙ ( 6𝐶1 5𝐶2 ) + ( 7𝐶2 3𝐶3 ) ∙ ( 6𝐶2 5𝐶1 )
= (35 ∙ 3) ∙ (10) + (35 ∙ 3) ∙ (6 ∙ 10) + (21 ∙ 1) ∙ (15 ∙ 5)
= 35 ∙ 3 ∙ 10 + 35 ∙ 3 ∙ 6 ∙ 10 + 21 ∙ 15 ∙ 5
= 7 ∙ 5 ∙ 5 ∙ 3 ∙ (2 + 12 + 3)
= 7 ∙ 5 ∙ 5 ∙ 3 ∙ 17
= 8925

We will first find out number of numbers greater than 𝐨𝐫 𝐞𝐪𝐮𝐚𝐥 𝐭𝐨 5000 (simpler to calculate).

Let the number be denoted by: 𝑥1 𝑥2 𝑥3 𝑥4 𝑥5

2
0
1
Choice1: 5 ,
2
3
For 𝑥1 , 𝑥5 , we have following choices: 0 = 4 + 3 + 2 = 9 choices.
Choice2: 6 , 1
2
0
Choice3 7 ,
{ 1

For reach of the above 9 choices, number of choices for 𝑥2 𝑥3 𝑥4 = 8 ∙ 8 ∙ 8 = 83

Number of choices (number of numbers more than 𝐨𝐫 𝐞𝐪𝐮𝐚𝐥 𝐭𝐨 5000) = 9 ∙ 83 = 4608

Numbers of numbers more than 𝐛𝐮𝐭 𝐧𝐨𝐭 𝐞𝐪𝐮𝐚𝐥 𝐭𝐨 5000 = 4607

We will first find out number of numbers between 200 and 999, both incusive (simpler to calculate).

Let the number be denoted by: 𝑥1 𝑥2 𝑥3


0 9
1 9 0 8
2 9 1 8 0 7
3 9 2 8 1 7 0 6
4 9 3 8 2 7 1 6
4 8 3 7 2 6 1 5
5 8 4 7 3 6 2 5
5 7 4 6 3 5 2 4
6 7 5 6 4 5 3 4
2 , 3 6 6 , 4 , 5 5 5 , 6 , 7 4 4 , 8 , 9 3 3
7 6 6 5 5 4 4 3
7 5 6 4 5 3 4 2
8 5 7 4 6 3 5 2
8 4 7 3 6 2 5 1
⏟ 9 4 8 3 7 2 6 1
first digit ⏟ 9 3 8 2 7 1 ⏟ 6 0
first digit ⏟ 9 2 8 1 ⏟ 7 0 first digit
chosen as 2
first digit ⏟ 9 1 ⏟ 8 0 first digit
chosen as 3
chosen as 4 first digit ⏟ 9 0 first digit chosen as 8
chosen as 9

chosen as 5 first digit chosen as 7


chosen as 6

Number of numbers (200 − 999) having sum of digits = 15: 6 + 7 + 8 + 9 + 10 + 9 + 8 + 7 = 64

Number of numbers (200 − 211) having sum of digits = 15: 0

Therefore, mumber of numbers (212 − 999) having sum of digits = 15: 64 − 0 = 64

Possible combination types:


11 3 11 2 1 22
1 + + + + 3 1 + +
{ 11 3 }, { 11 2 }, { 1 22 }
Comb1 Comb2 Comb3
7! 7! 7!
Number of permutations: { 5! 2! } + { 4! 2! } + { 3! 4! } = 21 + 105 + 35 = 141 (= number of elements 𝑃 has)
Comb1 Comb2 Comb3

3
First we find number of words containing one or more non‐ repeating letters.

𝑎 𝑥𝑥𝑥𝑥𝑥
5𝐶 4𝐶 number of pemutations: 5𝐶1 4𝐶1 (6!⁄5!)
1 1
Only one non‐ repeating letter:
𝑎 𝑥𝑥𝑥 𝑦𝑦
{ 5𝐶1 4𝐶
2 number of pemutations: 5𝐶1 4𝐶2 (6!⁄3! 2!)

𝑎𝑏 𝑥𝑥𝑥𝑥
5𝐶 3𝐶
2 1 number of pemutations: 5𝐶2 3𝐶1 (6!⁄4!)

Two non‐ repeating letters:
𝑎𝑏 𝑥𝑥 𝑦𝑦
5𝐶 3𝐶
{ 2 2 number of pemutations: 5𝐶2 3𝐶2 (6!⁄2! 2!)

𝑎𝑏𝑐 𝑥𝑥𝑥
Three non‐ repeating letters: { 5𝐶 2𝐶
3 1 number of pemutations: 5𝐶3 2𝐶1 (6!⁄3!)

𝑎𝑏𝑐𝑑 𝑥𝑥
Four non‐ repeating letters: { 5𝐶 1𝐶
4 1 number of pemutations: 5𝐶4 1𝐶1 (6!⁄2!)

Two letters have been decided to be non‐ repeating. There shall be 5𝐶2 such combinations
either any letter repeating 4 times
With the remaining 3 letters we can have {
or, two different letters repeating twice
⍟Explantion: Any (one) letter from 3: 3𝐶 combinations; any two letter from 3 given ones: 3𝐶 combinations
1 2
𝑛! (here 𝑛 = 6)
Number of permutations:
{ (no. of repeatitions)! ((no. of repeatitions)!)! (… )! …

5𝐶 4𝐶 (6!⁄5!)
5! 4! 6! 6!
1 1 = × × = = 120
1! 4! 1! 3! 5! 3!
5𝐶 4𝐶 (6!⁄3! 2!) =
5! 4! 6! 5! 6!
1 2 × × = = 1800
1! 4! 2! 2! 3! 2! 2!2 3!
5𝐶 3𝐶 (6!⁄4!) =
5! 3! 6! 5! 6!
2 1 × × = = 900
2! 3! 1! 2! 4! 2!2 4!
5𝐶 3𝐶 (6!⁄2! 2!) =
5! 3! 6! 5! 6!
2 2 × × = 4 = 5400
2! 3! 2! 1! 2! 2! 2!
5𝐶 2𝐶 (6!⁄3!) =
5! 2! 6! 5! 6!
3 1 × × = 2 = 2400
3! 2! 1! 1! 3! 3!
5𝐶 1𝐶 (6!⁄2!) =
5! 1! 6! 5! 6!
4 1 × × = = 3600
4! 1! 1! 0! 2! 2! 4!
Number of words having one or more non‐ repeating letters: 14220 (sum of above)

Number of all possible numbers (without any restriction): 56 = 15625

Number of numbers having appearing letter repeated at least twice: 15625 − 14220 = 1405

𝐀 𝐊 𝐍 𝐏 𝐑 𝐔 1st position
𝐀 𝐊 𝐍 𝐏 𝐔 𝐑 2nd position
⋯ number of words: 5! = 120

𝐀 𝐔 𝐑 𝐏 𝐍 𝐊 120th position }

4
𝐊 𝐀 𝐍 𝐏 𝐑 𝐔 121st position

} number of words: 5! = 120 (cumm: 240)

𝐊 𝐔 𝐑 𝐏 𝐍 𝐀 240th position

𝐍 𝐀 𝐊 𝐏 𝐑 𝐔 241st position

} number of words: 5! = 120 (cumm: 360)

𝐍 𝐔 𝐑 𝐏 𝐊 𝐀 360th position

𝐏 𝐀 𝐊 𝐍 𝐑 𝐔 361st position

} number of words: 4! = 24 (cumm: 384)

𝐏 𝐀 𝐔 𝐑 𝐍 𝐊 384th position

𝐏 𝐊 𝐀 𝐍 𝐑 𝐔 385th position

} number of words: 4! = 24 (cumm: 408)

𝐏 𝐊 𝐔 𝐑 𝐍 𝐀 408th position

𝐏 𝐍 𝐀 𝐊 𝐑 𝐔 409th Position

} number of words: 4! = 24 (cumm: 432)

𝐏 𝐍 𝐔 𝐑 𝐊 𝐀 432nd Position

𝐏 𝐑 𝐀 𝐊 𝐍 𝐔 433rd Position

} number of words: 3! = 6 (cumm: 438)

𝐏 𝐑 𝐀 𝐔 𝐍 𝐊 438rd Position

𝐏 𝐑 𝐊 𝐀 𝐍 𝐔 439th Position
𝐏𝐑𝐊𝐀𝐔𝐍 ⍟
⋯ ⍟ word at 𝟒𝟒𝟎th position: 𝐏𝐑𝐊𝐀𝐔𝐍

𝐏𝐑𝐊𝐔𝐍𝐀 }

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy