Handshake Problems with Constraints

Handshake problems count the number of handshakes that occur in a group where each pair of people shakes hands exactly once. The classic formula is C(n,2) = n(n-1)/2. Variations include constraints such as certain people not shaking hands, people shaking only within groups, or specific handshake patterns.

10Worksheets
200+Practice Questions
Beginner to IntermediateDifficulty
1-2 hoursHours to Master

Introduction to Handshake Problems with Constraints

Handshake problems count the number of handshakes that occur in a group where each pair of people shakes hands exactly once. The classic formula is C(n,2) = n(n-1)/2. Variations include constraints such as certain people not shaking hands, people shaking only within groups, or specific handshake patterns.

Prerequisites

Combination formula Basic arithmetic Understanding of pairs
Why This Matters: Handshake problems appear in 1-2 questions in SSC CGL and Banking exams. They test application of combinations to real-world scenarios.

How to Solve Handshake Problems with Constraints Problems

1

Step 1: Count total number of people (n)

2

Step 2: Classic handshake count = C(n,2) = n(n-1)/2

3

Step 3: For constraints, subtract handshakes that don't occur or add cases

4

Step 4: For 'each person shakes with k others' problems: total = (n × k)/2

5

Step 5: For group constraints, calculate handshakes within each group and add

6

Step 6: For 'some don't shake' problems, count only among participants

7

Step 7: Verify that each handshake is counted exactly once

Pro Strategy: Each handshake involves 2 people, so counting pairs is the key. Use combinations to avoid double counting. For constraints, use complementary counting or break into groups.

Example Problem

Example: At a party of 10 people, if each person shakes hands with every other person exactly once, how many handshakes occur? Solution: Step 1: n = 10 Step 2: Handshakes = C(10,2) = 10 × 9 / 2 = 45 Answer: 45 handshakes

Pro Tips & Tricks

  • Handshake formula: C(n,2) = n(n-1)/2
  • If each person shakes with k others: total = (n × k)/2 (only works if graph is regular)
  • For handshakes within a group of m people: C(m,2)
  • For handshakes between two groups of sizes a and b: a × b
  • If some pairs don't shake, subtract from total
  • Handshake count must be an integer

Shortcut Methods to Solve Faster

n(n-1)/2 for complete handshake
If each person shakes with 5 others in a group of 10: (10 × 5)/2 = 25
Between groups A and B: |A| × |B|
For 'no handshakes within groups': only between-group handshakes

Common Mistakes to Avoid

Forgetting to divide by 2 (counting each handshake twice)
Using n × (n-1) instead of n(n-1)/2
Not accounting for constraints correctly
Counting handshakes with oneself

Exam Importance

Handshake Problems with Constraints is an important topic for various competitive exams. Here's how frequently it appears:

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

Ready to Master Handshake Problems 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