1. Definition
Choosing m ordered items from n types with replacement gives n^m (n choices per position).
3. Properties & Laws
- Repeats allowed;
- Ordered;
- n·n·…·n=n^m;
- Typical: codes and passwords.
4. Steps
- Enter n,m;
- Click "Calculate";
- Or click "Load Example".
5. Worked Examples
Example: three digits, 10 each: 10³=1000.
6. Common Pitfalls
Repeats;
Ordered;
n is the number of types.