Skip to content

Permutations & Combinations S1 Intro | Factorials, Restrictions, Arrangements

Introduction to Permutations and Combinations (S1 Series)

This video kicks off a new series on permutations and combinations for A-Level Math (Statistics 1). The presenter has categorized past paper questions into distinct types to make learning systematic. This first video is an introductory lesson covering the fundamental concepts.

Key Difference: Permutation vs. Combination

  • Permutation: Used when selecting AND arranging. Order is important.
    • Example: Ranking contestants (1st, 2nd, 3rd place) is different from just selecting them. The sequence "ABC" (A=1st, B=2nd, C=3rd) is different from "CBA".
    • Example: A 4-digit password (2357) is different from 5327 because the order of digits matters.
  • Combination: Used when selecting only. Order is not important.
    • Example: Choosing a team of 2 players from A, B, and C. The selection {A, B} is the same as {B, A}.
    • Note: If roles (e.g., Captain/Vice-Captain) are assigned within the team, it becomes a permutation problem because order matters.

The Foundation: Factorial Notation (!)

Factorial notation is a prerequisite for permutations. n! (n factorial) is the product of all positive integers less than or equal to n.

  • Definition: n! = n × (n-1) × (n-2) × ... × 3 × 2 × 1
  • Calculator Key: Shift + (the button next to 'sin') for the '!' function.

Core Principle: The Basic Counting Principle

If task A can be done in m ways and task B can be done in n ways, then both tasks together can be done in m × n ways. This is the foundation for all permutation calculations. For a deeper understanding of how this principle applies to broader mathematical contexts, you can explore the Mathematics for Data Science: Natural Numbers, Integers, and Primes summary.


Applying Permutations

1. Arrangements with No Restrictions (All Objects Different)

  • Problem: How many ways can 5 people be arranged in a straight line?
  • Method 1: For the 1st position, 5 choices; 2nd position, 4 choices; ... This gives 5 × 4 × 3 × 2 × 1 = 5! = 120 ways.
  • Method 2 (Calculator): P(5,5) = 5P5 = 5! = 120 ways.

2. Arrangements with Identical Objects (Repeated Letters)

  • Key Rule: When objects or letters are repeated, you must divide by the factorial of the number of times they are repeated.
  • General Formula: For n objects where P are identical, Q are identical of another type, and R of a third type, the number of distinct arrangements is: n! / (P! × Q! × R!)
  • Example (Word "BOB"): There are 3 letters total, with two 'B's repeated. The number of distinct arrangements is 3! / 2! = 6 / 2 = 3 ways (BOB, BBO, OBB).
  • Example (Word "TRIGONOMETRY"): This has 12 letters, with T repeated 2 times, O repeated 2 times, and R repeated 2 times. The calculation is 12! / (2! × 2! × 2!) = 59,875,1200 ways.

3. Arrangements with Restrictions

A. Items Together

  • Method: Treat the items that must be together as a single "block" or unit.
  • Calculation: (Number of arrangements inside the block) × (Number of arrangements of the blocks + other items).
  • Example (Word "GREAT"): Find arrangements where 'A' and 'E' are next to each other.
    • Treat "AE" as one block. We now have 4 units to arrange: the block 'AE', 'G', 'R', 'T'.
    • Inside the block, 'A' and 'E' can swap: 2! = 2 ways.
    • Arrangements of the 4 units: 4! = 24 ways.
    • Total = 2! × 4! = 2 × 24 = 48 ways.

B. Items Apart

  • Method: Calculate the total number of arrangements with no restrictions, then subtract the number of arrangements where the items ARE together.
  • Formula: Arrangements with items apart = Total arrangements - Arrangements with items together.
  • Example (Word "ACHIEVE"): Find arrangements where 'C' and 'H' are apart.
    • Total arrangements (no restrictions): 7! / 2! (for the two 'E's) = 2520 ways.
    • Arrangements with 'C' and 'H' together (treating them as a block): 2! (inside block) × 6! / 2! (arranging 6 units with two 'E's) = 720 ways.
    • Arrangements with 'C' and 'H' apart = 2520 - 720 = 1800 ways.

C. Fixed Positions

  • Method: If the position of a particular item is fixed, first place that item (often only 1 way), then arrange the remaining items. Always satisfy the restriction first.
  • Example (Word "ACHIEVE"): Find arrangements where the first letter is 'A'.
    • Place 'A' in the first position (1 way).
    • Now arrange the remaining 6 letters (including the two 'E's): 6! / 2! = 360 ways.
    • Total = 360 ways.

Advanced Examples from the Video

Example 1: Girls and Boys in a Row

  • Problem: Three girls and two boys sit in a row.
    • Condition A: Sit alternately.
      • Only possible arrangement: Girl, Boy, Girl, Boy, Girl.
      • Calculation: 3! (ways to arrange the 3 girls) × 2! (ways to arrange the 2 boys) = 6 × 2 = 12 ways.
    • Condition B: A girl sits at each end.
      • Fix a girl in the 1st position (3 choices) and a different girl in the last position (2 choices).
      • Arrange the remaining 3 people (1 girl + 2 boys) in the middle 3 positions: 3! = 6 ways.
      • Total = 3 × 2 × 6 = 36 ways.
    • Condition C: All girls sit together and all boys sit together.
      • Treat the 3 girls as one block (3! ways internally) and the 2 boys as another block (2! ways internally).
      • These two blocks can be arranged as (Girls, Boys) or (Boys, Girls): 2! ways.
      • Total = 3! × 2! × 2! = 6 × 2 × 2 = 24 ways.

For readers looking to see how these permutation and combination concepts apply in solving complex arrangement problems in competitive exams, the Puzzles & Seating Arrangement: 251 Rules for Bank Exams (SBI, IBPS, RRB) guide offers a practical extension. Additionally, if you need a refresher on the foundational number systems that underpin these calculations, the Number System Complete Revision: Classification, Divisibility, BODMAS for Competitive Exams resource is excellent. For those interested in related probability topics, the Calculating Conditional Probabilities Using Tree Diagrams and Dice Rolls summary provides valuable context. Finally, a comprehensive Hindi-language guide, क्रमचय और संचय: बेसिक से एडवांस तक पूरी गाइड, is available for further study of permutations and combinations.

Keep this summary

Save it to LunaNotes and it becomes a real note in your library — editable, searchable, and ready to turn into flashcards or a diagram. Free to start.

Save to LunaNotes

Or summarise for another video.

32K+ people have turned 65K+ videos into notes

“Very useful tool. I'm using it for the last couple weeks and I'm loving it so far. Makes learning on YouTube a great experience.”
Bhai Chrome Web Store review

This summary and transcript were automatically generated using AI with the Free YouTube transcript summary tool by LunaNotes.

Related summaries

A Level Math S1: Permutations and Combinations Full Introduction Guide

A Level Math S1: Permutations and Combinations Full Introduction Guide

This introductory video launches a complete series on permutations and combinations for A Level Math S1. It explains the core difference between permutations (order matters) and combinations (order doesn't), covers factorial notation, and works through foundational examples including arranging people, letters, and handling restrictions like items together or apart.

Puzzles & Seating Arrangement: 251 Rules for Bank Exams (SBI, IBPS, RRB)

Puzzles & Seating Arrangement: 251 Rules for Bank Exams (SBI, IBPS, RRB)

Master every type of seating arrangement and puzzle for bank exams (SBI PO, IBPS Clerk, RRB PO). This comprehensive guide covers linear, circular, square, rectangular, floor, and scheduling puzzles with 251 crucial rules for Prelims and Mains.

Profit & Loss: Solve Aptitude Problems Fast with Formulas & Tricks

Profit & Loss: Solve Aptitude Problems Fast with Formulas & Tricks

Master profit and loss for competitive exams with this comprehensive tutorial. It covers fundamental formulas like profit/loss percentage and selling price calculation, and solves 16 detailed example problems. Learn quick tips, tricks, and common-sense logic to solve even complex puzzles in under a minute, including special cases like equal selling prices and dishonest weights.

Calculating Conditional Probabilities Using Tree Diagrams and Dice Rolls

Calculating Conditional Probabilities Using Tree Diagrams and Dice Rolls

This summary explains how to calculate probabilities and conditional probabilities using tree diagrams, including examples with bus arrival times, ball selections without replacement, and dice rolls. Key concepts such as intersections, complements, and conditional probability formulas are demonstrated with step-by-step calculations.

क्रमचय और संचय: बेसिक से एडवांस तक पूरी गाइड

क्रमचय और संचय: बेसिक से एडवांस तक पूरी गाइड

यह वीडियो क्रमचय (Permutation) और संचय (Combination) की पूरी अवधारणा को बेसिक से एडवांस लेवल तक समझाता है। गणना के मूल सिद्धांत (Fundamental Principle of Counting) से शुरू करके, फैक्टोरियल, nPr और nCr के फॉर्मूले, और JEE Main & Advanced में पूछे गए विभिन्न प्रकार के सवालों को हल करना सीखें।

Found this summary useful?

Take it with you. One click puts it in your own LunaNotes library.

Save to LunaNotes

Start taking better notes today with LunaNotes