Number Formation with Constraints

Number Formation problems involve forming numbers (usually with a given number of digits) from a set of digits, often with restrictions such as: first digit cannot be zero, digits can/cannot repeat, or numbers must be divisible by certain values (even, odd, divisible by 5, etc.).

10Worksheets
200+Practice Questions
HardDifficulty
3-4 hoursHours to Master

Introduction to Number Formation with Constraints

Number Formation problems involve forming numbers (usually with a given number of digits) from a set of digits, often with restrictions such as: first digit cannot be zero, digits can/cannot repeat, or numbers must be divisible by certain values (even, odd, divisible by 5, etc.).

Prerequisites

Fundamental Counting Principle Permutation with repetition Divisibility rules Handling positional restrictions
Why This Matters: Number Formation problems appear in 2-3 questions in SSC CGL and Banking exams. They test application of counting principles to digit constraints.

How to Solve Number Formation with Constraints Problems

1

Step 1: Identify the number of digits in the number

2

Step 2: Determine if repetition of digits is allowed

3

Step 3: Handle the first digit restriction (cannot be 0)

4

Step 4: Handle last digit restrictions for divisibility (even, odd, divisible by 5)

5

Step 5: Apply multiplication principle for independent digit choices

6

Step 6: For 'no repetition' cases, use permutations

7

Step 7: For multiple constraints, break into cases

Pro Strategy: Always handle the most restrictive position first. For numbers, the first digit cannot be 0. For divisibility constraints, the last digit determines even/odd/divisible by 5. Use the multiplication principle, adjusting for repetition rules.

Example Problem

Example: How many 3-digit numbers can be formed using digits 0-9 with repetition allowed? Solution: Step 1: 3-digit number: hundreds, tens, units Step 2: Hundreds digit cannot be 0: 9 choices (1-9) Step 3: Tens digit: 10 choices (0-9) Step 4: Units digit: 10 choices (0-9) Step 5: Total = 9 × 10 × 10 = 900 Answer: 900 numbers

Pro Tips & Tricks

  • First digit (leftmost) cannot be 0 in an n-digit number
  • For even numbers: last digit must be 0, 2, 4, 6, or 8
  • For odd numbers: last digit must be 1, 3, 5, 7, or 9
  • For divisible by 5: last digit must be 0 or 5
  • For divisible by 4: last two digits must form a number divisible by 4
  • When digits cannot repeat, use permutations: P(available, positions)

Shortcut Methods to Solve Faster

n-digit numbers with repetition allowed (no zero-first restriction): 10ⁿ
n-digit numbers with repetition allowed (with zero-first restriction): 9 × 10ⁿ⁻¹
n-digit numbers with distinct digits: 9 × P(9, n-1)
Even numbers: handle last digit case (0 vs non-zero) separately

Common Mistakes to Avoid

Forgetting that first digit cannot be 0
Not handling the 'last digit' constraint separately for divisibility
Using permutation formula incorrectly when repetition is allowed
For 'greater than' problems, not considering all cases

Exam Importance

Number Formation with Constraints 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 Number Formation with Constraints?

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