Permutation & Combination - Detailed Explanation
Permutation and Combination are fundamental counting techniques in mathematics that help us determine the number of ways to arrange or select objects. These concepts are essential for solving probability problems, organizing data, and making decisions in various real-world scenarios. In Philippine entrance examinations like UPCAT, NMAT, and Civil Service Exams, these topics frequently appear as word problems that test your ability to identify when order matters (permutation) versus when it doesn't (combination). Understanding these concepts will also help you in statistics, probability theory, and logical reasoning sections of standardized tests.
Factorial
Examples
Calculate 6!
Solution
6! = 6 × 5 × 4 × 3 × 2 × 1 = 720
We multiply all positive integers from 6 down to 1.
Simplify 8!/5!
Solution
8!/5! = (8 × 7 × 6 × 5!)/(5!) = 8 × 7 × 6 = 336
The 5! cancels out, leaving only 8 × 7 × 6.
A factorial, denoted by n!, is the product of all positive integers from 1 to n. It serves as the foundation for both permutation and combination formulas. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. By definition, 0! = 1, which is important for calculations involving permutations and combinations. Factorials grow very rapidly - 10! = 3,628,800, which shows why these calculations can involve large numbers.
Applications
- Foundation for permutation and combination calculations
- Used in probability calculations
- Applied in statistics and data analysis
- Essential for understanding arrangements and selections
Common misconceptions
- Thinking that 0! = 0 (it's actually 1)
- Forgetting to multiply all integers in sequence
- Not simplifying factorial expressions before calculating
Related concepts
- Permutation
- Combination
- Probability
Common exam questions
Example
Find 7! - Answer: 5,040
Approach
Calculate factorial values step by step
Example
Simplify 10!/7! - Answer: 720
Approach
Cancel common factorial terms
Key points to remember
- n! = n × (n-1) × (n-2) × ... × 3 × 2 × 1
- 0! = 1 by definition
- Factorials are used in both permutation and combination formulas
- For large numbers, use calculator or simplify expressions before calculating
Permutation
Examples
In how many ways can 5 students be arranged in a row?
Solution
5P5 = 5!/(5-5)! = 5!/0! = 120/1 = 120
Since all 5 students are being arranged, we use 5P5. The answer is 120 different arrangements.
How many 3-letter codes can be formed using the letters A, B, C, D, E without repetition?
Solution
5P3 = 5!/(5-3)! = 5!/2! = 120/2 = 60
We're selecting and arranging 3 letters from 5 available letters where order matters.
Permutation refers to the arrangement of objects where order matters. When we say 'ABC' and 'BAC' are different arrangements, we're dealing with permutations. The formula for permutation is nPr = n!/(n-r)!, where n is the total number of objects and r is the number of objects being arranged. This concept is crucial when solving problems about seating arrangements, password creation, or any situation where the sequence of selection is important.
Applications
- Seating arrangements in theaters or classrooms
- Creating passwords or codes
- Organizing race positions
- Scheduling tasks or events
Common misconceptions
- Using permutation when order doesn't matter
- Confusing permutation with combination formulas
- Not recognizing keywords that indicate permutation problems
Related concepts
- Factorial
- Combination
- Probability
- Arrangements
Common exam questions
Example
Arrange 4 books on a shelf - Use 4P4 = 24
Approach
Identify if order matters, then use nPr formula
Example
Choose 3 officers from 8 people for President, VP, Secretary - Use 8P3 = 336
Approach
Use nPr when selecting r objects from n objects to arrange
Key points to remember
- Order matters in permutations
- Formula: nPr = n!/(n-r)!
- Used when arranging objects in specific positions
- Keywords: arrange, order, sequence, position
Combination
Examples
A director chooses 3 actors from 10 talented artists for an art class. How many ways can this be done?
Solution
10C3 = 10!/(3!(10-3)!) = 10!/(3!×7!) = (10×9×8)/(3×2×1) = 720/6 = 120
Since the order of selection doesn't matter (all 3 will participate equally), we use combination.
A voter must select 12 senators from 15 candidates. How many ways can this be done?
Solution
15C12 = 15!/(12!(15-12)!) = 15!/(12!×3!) = (15×14×13)/(3×2×1) = 2730/6 = 455
The order of selecting senators doesn't matter - only which 12 are chosen.
Combination refers to the selection of objects where order does not matter. When choosing a team of 3 people from 10 candidates, it doesn't matter which person you pick first, second, or third - the team composition is what counts. The formula for combination is nCr = n!/(r!(n-r)!). This concept is essential for problems involving team selection, choosing committee members, or any scenario where we only care about which objects are selected, not their arrangement.
Applications
- Selecting team members or committee members
- Choosing menu items or courses
- Selecting lottery numbers
- Forming study groups
- Choosing senators or representatives in elections
Common misconceptions
- Using combination when order matters (like ranking positions)
- Confusing combination with permutation formulas
- Not recognizing when selection problems don't care about order
Related concepts
- Factorial
- Permutation
- Probability
- Sets
Common exam questions
Example
Select 5 players from 12 for a basketball team - Use 12C5 = 792
Approach
Use nCr when forming groups where order doesn't matter
Example
Form a 4-person committee from 20 members - Use 20C4 = 4845
Approach
Identify that positions are equal, use combination
Key points to remember
- Order does not matter in combinations
- Formula: nCr = n!/(r!(n-r)!)
- Used when selecting objects without regard to position
- Keywords: choose, select, pick, group, committee
Distinguishing Permutation from Combination
Examples
Compare: (A) Choosing 3 students for class president, vice president, and secretary vs (B) Choosing 3 students for a study group
Solution
(A) Uses permutation: 3P3 = 6 ways (order matters - different positions) (B) Uses combination: nC3 = 1 way (order doesn't matter - all equal members)
In (A), the roles are different, so ABC as Pres-VP-Sec differs from BCA. In (B), the group {A,B,C} is the same regardless of order.
The key to solving counting problems is determining whether order matters. Ask yourself: 'If I rearrange the selected objects, do I get a different outcome?' If yes, use permutation. If no, use combination. For example, selecting a President, Vice President, and Secretary (order matters) versus selecting 3 committee members (order doesn't matter). This distinction is crucial for solving word problems correctly in Philippine entrance exams.
Applications
- Analyzing problem contexts in exams
- Making decisions about which formula to use
- Understanding real-world counting scenarios
- Solving complex probability problems
Common misconceptions
- Always using permutation because it gives larger numbers
- Not reading the problem context carefully
- Mixing up the formulas
Related concepts
- Problem-solving strategies
- Critical thinking
- Word problems
Common exam questions
Example
Are we assigning specific roles or just forming a group?
Approach
Read carefully and determine if order/position matters
Key points to remember
- Order matters = Permutation (nPr)
- Order doesn't matter = Combination (nCr)
- Look for keywords that indicate arrangement vs selection
- Consider the context of the problem
Practice problems
A company needs to select 4 employees from 12 candidates to form a project team. How many different teams can be formed?
Solution
12C4 = 12!/(4!(12-4)!) = 12!/(4!×8!) = (12×11×10×9)/(4×3×2×1) = 11,880/24 = 495
This is a combination problem because the order of selection doesn't matter - all team members have equal roles. We use 12C4 to find there are 495 possible teams.
In how many ways can the letters of the word 'MANILA' be arranged?
Solution
6P6 = 6! = 6×5×4×3×2×1 = 720
We're arranging all 6 letters of MANILA in different orders, so this is a permutation problem. Since all letters are distinct, we use 6! = 720 arrangements.
A restaurant offers 8 different appetizers. A customer wants to order 3 different appetizers to share. How many combinations are possible?
Solution
8C3 = 8!/(3!(8-3)!) = 8!/(3!×5!) = (8×7×6)/(3×2×1) = 336/6 = 56
Since the customer just wants 3 different appetizers to share (order doesn't matter), we use combination: 8C3 = 56 possible selections.
A school wants to arrange 5 students in a row for a photo. Two specific students must sit next to each other. How many arrangements are possible?
Solution
Treat the 2 students as one unit: 4 units to arrange = 4! = 24 ways. The 2 students within their unit can be arranged in 2! = 2 ways. Total = 24 × 2 = 48 arrangements
This is a constrained permutation problem. We treat the pair as a single unit, arrange the 4 units (including the pair), then multiply by the internal arrangements of the pair.
Exam preparation tips
- Always identify whether order matters before choosing permutation or combination
- Look for keywords: 'arrange', 'order', 'sequence' suggest permutation; 'choose', 'select', 'pick' suggest combination
- Practice simplifying factorial expressions before calculating to avoid large number operations
- In Civil Service and entrance exams, word problems often disguise counting principles - read carefully
- For UPCAT and NMAT, expect combination problems involving committee selection and permutation problems with arrangements
- Remember that nCr = nC(n-r), which can simplify calculations (choose 12 from 15 = choose 3 from 15)
- When dealing with restrictions or constraints, break the problem into steps and use the multiplication principle
- Double-check your formula choice by asking: 'Does rearranging my selection give a different result?'
Diagrams
Permutation and Combination Concept Overview
This mind map shows the hierarchical relationship between counting concepts, highlighting the key distinction between permutation and combination.
Decision Process for Permutation vs Combination
This flowchart guides students through the decision-making process to determine whether to use permutation or combination formulas.
Problem-Solving Sequence for Counting Problems
This sequence diagram illustrates the systematic approach students should follow when solving permutation and combination problems.
Common Types of Counting Problems in Philippine Exams
This pie chart shows the distribution of different types of counting problems commonly found in Philippine entrance examinations and civil service tests.
In summary
Mastering permutation and combination is essential for success in Philippine entrance examinations and mathematical problem-solving. The key insight is recognizing when order matters (permutation) versus when it doesn't (combination). Remember that permutation is about arrangements and positions, while combination is about selections and groups. Practice identifying the problem type through keywords and context, then apply the appropriate formula systematically. These counting principles form the foundation for probability theory and appear frequently in UPCAT, NMAT, Civil Service Exams, and other standardized tests. Regular practice with varied problem types will build your confidence and speed in solving these problems during actual examinations.