CAVerse
Sign in
DashboardTake TestAI Tutor🔒Paper Check🔒LevelsConceptsNotesAmendments🔒Secrets 🔐🔒LibraryPlannerStudy DeskFree ResourcesAnalyticsResultsBankPricing
Notes/CA Foundation/Quantitative Aptitude (Maths, LR, Stats)

CA Foundation · Quantitative Aptitude (Maths, LR, Stats)

Permutations and Combinations

Chapter 2 · 5 formulas · 4 exam-critical pointers

Core concepts

  1. 01Permutation: arrangement (order matters).
  2. 02Combination: selection (order does not matter).
  3. 03Factorial: n! = n(n−1)(n−2)...1; 0! = 1.
  4. 04Circular permutation of n distinct objects = (n−1)!
  5. 05Restrictions handled by treating grouped items as one unit or fixing positions.

Flowchart summary

Selection problems | Order matters? -- Yes --> nPr | No | v nCr

Exam-critical pointers

  • ⭐When repetition allowed: arrangements of r items from n = nʳ.
  • ⭐Identical items in arrangement: divide by factorial of identicals (n!/p!q!).
  • ⭐Selection of at least 1: 2ⁿ − 1.
  • ⭐Distinguish 'word formation' MCQs — vowels together / never together patterns.

Make it click

Formula sheet

  • nPr = n! / (n−r)!
  • nCr = n! / [r!(n−r)!]
  • nCr = nC(n−r)
  • nC0 + nC1 + ... + nCn = 2ⁿ
  • Circular arrangement (clockwise = anticlockwise): (n−1)!/2

More from Quantitative Aptitude (Maths, LR, Stats)

  1. Ch 1Ratio, Proportion, Indices and Logarithms
  2. Ch 3Time Value of Money
  3. Ch 4Measures of Central Tendency & Dispersion
  4. Ch 5Correlation and Regression
All CA Foundation notes →
CAVerse·A product of TwoCoreX (OPC) Pvt Ltd
PricingCA LevelsAI TutorNotesPast PapersBlogFAQContactRefundPrivacyTerms
© 2026