Procedure
Counting pairs from with a given difference
Probability • Classical Probability
Statement
For and , the number of ordered pairs with is (namely ), and the same number have . So has ordered pairs.
How to use it
- 1Fix the difference . The smaller number can start at and go up until reaches : that is to , which is values.
- 2A bigger difference leaves fewer pairs, so the counts for
go down by one each time. - 3For a condition like , add the counts for each allowed , then double for the two orders.
Worked example
Two numbers are chosen with replacement from . In how many ordered pairs is ?
Step-by-step
- 1: pairs; : pair
Why: Each difference gives pairs, here with .
- 2pairs with
Why: Add over the allowed differences.
- 3ordered pairs
Why: The same number have .
Answer
Watch out
Count ordered pairs when the draws are with replacement, and do not forget to double for the order. Read the inequality carefully: starts at , not .
Builds on
Also known as
pairs with fixed difference, number of pairs with |x - y| = k, difference of two chosen numbers