Permutation with replacement
A permutation with replacement is an ordered selection in which each item remains available for subsequent selection.
Statistics Every Programmer Needs
A permutation with replacement is an ordered selection in which each selected item is returned and may be selected again.
- How it is used
- Counts ordered passwords, lock settings, or other sequences where selected items may recur.
- How deep it goes
- Defines replacement, derives n^r, and demonstrates equivalent Python implementations.
- Examples
- Uses briefcase lock digits, repeated sequences such as 3-3-4, and a Python calculation producing 125 arrangements.
- What you can do after
- Apply it via Python by calculating n ** r or pow(n, r) for ordered selections with replacement.
Read how Statistics Every Programmer Needs explains permutation with replacement →
Statistics Slam Dunk
A permutation with replacement is an ordered selection in which an element may be selected again after it is used.
- How it is used
- Frames ordered, repeatable selections as the foundation for grouping NBA home and away teams by prior days off.
- How deep it goes
- Defines order and replacement, derives n^r, and demonstrates enumeration in R without developing formal proofs.
- Examples
- Uses NBA rest-day pairs, coaching play options, an NBA lottery contrast, and R-generated lists of 25 pairs.
- What you can do after
- Apply the n^r formula and use R or gtools to count and enumerate repeatable ordered selections.
Read how Statistics Slam Dunk explains permutation with replacement →
Related concepts
- permutationkind of · A permutation is a bijective rearrangement of the elements of a finite set, equivalently an ordering in which each element appears exactly once.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.