STA 112

PERMUTATIONS AND COMBINATIONS

Learn about PERMUTATIONS AND COMBINATIONS in STA 112. Comprehensive study materials and practice questions.

Study notes included Document available CBT practice ready

Study Document

This document can't be previewed directly.

Open document

Study Notes

STA 112

Permutations and Combinations Study Summary

This document provides a comprehensive overview of Permutations and Combinations, including fundamental principles, definitions, formulas, important identities, and a set of practice questions with answers.

Key Concepts

Fundamental Principles of Counting

  • Multiplication Principle: If an event can occur in 'm' different ways, followed by another event that can occur in 'n' different ways, then the total number of different ways of occurrence of the two events in order is m × n.
  • Addition Principle: If there are two events such that they can occur independently in 'm' and 'n' different ways respectively, then either of the two events can occur in (m + n) ways.

Factorial

  • Definition: The factorial of a natural number 'n', denoted by n! or n, is the continued product of the first 'n' natural numbers.

    n! = n × (n - 1) × (n - 2) × ......... × 3 × 2 × 1

  • Properties:
    • n! = n × ((n - 1)!)
    • n! = n × (n - 1) × ((n - 2)!)

Permutations

  • Definition: A permutation is an arrangement of a number of objects in a definite order, taken some or all at a time.
  • Number of Permutations of 'n' different objects taken 'r' at a time (without repetition):

    nPr = P(n, r) = n! / (n-r)!

    (where 0 ≤ r ≤ n)

  • Number of Permutations of 'n' objects when repetition is allowed:

    nr

  • Number of Permutations of 'n' objects where p1 are of one kind, p2 are of second kind, ..., pk are of kth kind and the rest are different:

    n! / (p1! p2! ... pk!)

Combinations

  • Definition: A combination is a selection made by choosing some or all of a number of objects, without considering their order.
  • Number of Combinations of 'n' objects taken 'r' at a time:

    nCr = C(n, r) = n! / (r! (n-r)!)

    (where 0 ≤ r ≤ n)

Important Identities and Results

  • 0! = 1
  • nC0 = nCn = 1
  • nCr = nCn-r (where 0 ≤ r ≤ n, and r are positive integers)
  • nPr = r! × nCr (where 0 ≤ r ≤ n, r and n are positive integers)
  • nCr + nCr+1 = n+1Cr+1 (where 0 ≤ r ≤ n and r and N are positive integers)
  • If nCa = nCb, then either a = b or a + b = n

Practice Questions

The document includes a variety of practice questions categorized by marks and type:

  • Section A: Very Short Answer Type Questions (1 Mark)
  • Section B: Short Answer Type Questions (2 Marks)
  • Section C: Short Answer Type Questions (4 Marks)
  • Section D: Long Answer Type Questions (6 Marks)

Answers

Detailed answers are provided for all the practice questions at the end of the document.

Test Your Knowledge

Challenge yourself with targeted practice questions and accelerate your mastery of PERMUTATIONS AND COMBINATIONS.

Practice CBT Study Flashcards