Basic Linear Permutation

Linear Permutation deals with arranging distinct objects in a straight line (order matters). The number of ways to arrange 'n' distinct objects in a line is n! (n factorial). This fundamental concept extends to arranging only 'r' objects out of 'n' (ⁿPᵣ = n!/(n-r)!).

10Worksheets
200+Practice Questions
BeginnerDifficulty
2-3 hoursHours to Master

Introduction to Basic Linear Permutation

Linear Permutation deals with arranging distinct objects in a straight line (order matters). The number of ways to arrange 'n' distinct objects in a line is n! (n factorial). This fundamental concept extends to arranging only 'r' objects out of 'n' (ⁿPᵣ = n!/(n-r)!).

Prerequisites

Factorial concept Fundamental Counting Principle Multiplication of consecutive numbers
Why This Matters: Linear Permutation is a core concept in counting. You can expect 2-3 questions in SSC CGL, 2-3 in Banking PO, and 2-3 in Railways RRB exams.

How to Solve Basic Linear Permutation Problems

1

Step 1: Identify if order matters (arrangement vs selection)

2

Step 2: Count the total number of distinct objects (n)

3

Step 3: If arranging all n objects, use n!

4

Step 4: If arranging r objects out of n, use ⁿPᵣ = n!/(n-r)!

5

Step 5: Calculate step by step: n × (n-1) × (n-2) × ... until you have r factors

6

Step 6: For arrangements with identical objects, divide by factorials of identical counts

7

Step 7: Verify the answer is reasonable

Pro Strategy: Always check if order matters. For arrangements (permutations), order matters. For selections (combinations), order doesn't matter. Use the multiplication principle: first position has n choices, second has n-1, and so on.

Example Problem

Example: In how many ways can 5 books be arranged on a shelf? Solution: Step 1: Order matters (different arrangements of books are different) Step 2: n = 5 distinct books Step 3: Number of arrangements = 5! = 5 × 4 × 3 × 2 × 1 = 120 Answer: 120 ways

Pro Tips & Tricks

  • n! = n × (n-1) × (n-2) × ... × 2 × 1
  • 0! = 1 (by definition)
  • For arranging r objects from n: multiply r consecutive numbers starting from n downward
  • ⁿPᵣ = n!/(n-r)! = n × (n-1) × ... × (n-r+1)
  • For word arrangements, treat each letter as a distinct object initially
  • When objects are not all distinct, use permutations with repetition formula

Shortcut Methods to Solve Faster

ⁿPₙ = n!
ⁿP₁ = n
ⁿP₀ = 1
For consecutive integers: n! can be computed by multiplying step by step

Common Mistakes to Avoid

Confusing permutation (order matters) with combination (order doesn't matter)
Forgetting that 0! = 1
Using n! when arranging only r objects (should use ⁿPᵣ)
Not checking for identical objects that reduce arrangements

Exam Importance

Basic Linear Permutation is an important topic for various competitive exams. Here's how frequently it appears:

SSC CGL
2-3 questions
BANKING PO
2-3 questions
RAILWAYS RRB
2-3 questions
CAT
1-2 questions
INSURANCE
2-3 questions

Ready to Master Basic Linear Permutation?

Start with Worksheet 1 and work your way up to expert level! Each worksheet includes:

20 practice questions
Detailed solutions
Step-by-step explanations
Start Practicing Now