Permutation and Combination- QA Formulae

By BYJU'S CAT|Updated : May 31st, 2023

Permutation and Combination are the ways to represent a group of objects by selecting them in a set and forming subsets. It defines the various ways of arranging a certain group of data. When we select the data or objects from a certain group, the process is known as permutation. The order in which they are represented is called combination. Both concepts are very important in mathematics.

Table of Content

byjusexamprep

Arrangement:

n items can be arranged in n! ways.

Arrangement with repetitions: 

If x items out of n items are repeated, then the number of ways of arranging these n items is byjusexamprep ways. 

If a items, b items, and c items are repeated within n items, then they can be arranged in byjusexamprep  ways.

Circular arrangement: 

The number of ways of arranging n items around a circle is 1 for n = 1, 2, and (n − 1)! for n ≥ 3. 

If it’s a necklace or bracelet that can be flipped over, then the possibilities are (n − 1)!/2

Permutation:

It is a way of selecting and arranging r objects out of a set of n objects.

 byjusexamprep

Combination:

It is a way of selecting r objects out of n (arrangement does not matter).

 byjusexamprep

  • Selecting r objects out of n is the same as selecting (n − r) objects out of n, byjusexamprep
  • The total selections that can be made from ‘n’ distinct items is given by byjusexamprep

Partitioning: 

  • The number of ways to partition n identical things in r distinct slots is given by byjusexamprep
  • The number of ways to partition n identical things in r distinct slots so that each slot gets at least 1 is given by byjusexamprep
  • The number of ways to partition n distinct things in r distinct slots is given by rn
  • Number of ways to partition n distinct things in r distinct slots where arrangement matters is given by byjusexamprep

Integral solutions: 

  • The number of positive integral solutions to x1 + x2 + x3 +...+ xn = k where k ≥ 0 is byjusexamprep
  • The number of non-negative integral solutions to x1 + x2 + x3+...+ xn = k where k ≥ 0 is byjusexamprep

Derangements:

If n distinct items are arranged, then the number of ways in which they can be arranged so that they do not occupy their intended spot is

byjusexamprep

===========================

Download the BYJU’S Exam Prep App NOW

The most comprehensive exam prep app.

If you are aiming to crack CAT and other MBA Exam, join BYJU'S Exam Prep Online Classroom Program where you get : 

  • Live Courses by Top Faculty
  • Daily Study Plan 
  • Comprehensive Study Material 
  • Latest Pattern Test Series 
  • Complete Doubt Resolution 
  • Regular Assessments with Report Card

#DreamStriveSucceed

Comments

write a comment

Follow us for latest updates