[go: up one dir, main page]

0% found this document useful (0 votes)
42 views1 page

Permutation and Combination

The document discusses the principles of counting and distribution of objects, focusing on events A and B with total ways of m and n respectively. It explains the use of fake coins as partitions in distributing identical objects among individuals, and introduces concepts like combinations and permutations. Additionally, it covers factorial notation, de-arrangements, and circular permutations in the context of distinct and identical objects.

Uploaded by

Tarak Shah
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)
42 views1 page

Permutation and Combination

The document discusses the principles of counting and distribution of objects, focusing on events A and B with total ways of m and n respectively. It explains the use of fake coins as partitions in distributing identical objects among individuals, and introduces concepts like combinations and permutations. Additionally, it covers factorial notation, de-arrangements, and circular permutations in the context of distinct and identical objects.

Uploaded by

Tarak Shah
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/ 1

अगर event A होने के total “m” ways है और

Fundamental principle
event B के “n” ways, तो दोनो event एक साथ
मान लो हमने एक fake coin introduce of counting
में होने के िलए total ways “m×n” है
िकया ,जो एक कम है from the number
of beggars C(n, r) = n!/ r!(n-r)!

अब arrange करो ये fake coins को इसका मतलब है के मैंने उन ‘n’


along with real coins to get the objects में से “r” object
number of ways in which हम ⁿCᵣ select िकया है
distribution कर सकते है
ⁿCᵣ+ⁿCᵣ₋₁=ⁿ⁺¹Cᵣ
Each arrangement of these fake
coins+real coins correspond to
one distribution pattern Basic terminology Properties
Distribution of
Logic Beggar method
The fake coins एक partition की तरह identical objects
act करता है between the number of
coins जो हर एक beggar को िमला
P(n, r) = n!/(n-r)! (r≤n)
Number of ways to distribute “n” ⁿPᵣ इसका मतलब है के मैंने उन “n” distinct objects में से
identical objects among “r”
person so that each may get any “r” object select िकया है और में उन “r” objects को
number of things is arrange भी कर िदया है without repetition

Number of ways to distributor “n”


Relations between ⁿPᵣ
identical objects of among “r” and ⁿCᵣ
person so that each gets at least 1
thing is
Factorial notation n!=n(n-1)(n-2)...(3)(2)(1)
After formation of groups अगर हमें
ये groups को distribute करना है तो
Permutation If all the objects are
अगर सारे objects distinct नहीं है तो िजतने भी
िजतने लोगों में distribute करना है उतने objects एक type के repeat हो रहे है उतने factorial
factorial से divide कर दो and not all distinct
Distribution से divide कर दो
Group is used to
Combination
A de-arrangement of
distribute distinct 1,2..,n is a permutation
objects of the number such that
number of occupies its
िजतने equal group उतने Dearrangement/ natural position
factorial से divide करना है Formation of groups mismatch
For distinct objects
अगर हमारे पास n objects है
और उनको x,y,z size के Ex
group में divide करना है तो
The total number of
Groups is used to
Circular permutation circular arrangement of
distribute distinct objects distinct object is (n-1)!

Non-Negative integral
Exponent of a prime
solution
p in n!
Question Rank

Divisibility rule

You might also like