Kuinka laskea Permutations with Replacement
Mikä on Permutations with Replacement?
Permutations with replacement count ordered arrangements where items can be repeated. Formula: n^k (n choices, k selections). Used in PIN codes, passwords, combination locks, and license plates.
Vaiheittainen opas
- 1Order matters AND repetition allowed
- 2Total = n^k (n choices for each of k positions)
- 3Example: 4-digit PIN with digits 0-9: 10^4 = 10,000 possible PINs
- 4Contrast: permutations without replacement = n!/(n-k)!
Ratkaistut esimerkit
Syöte
3-letter code from 26 letters, repeats allowed
Tulos
26³ = 17,576 codes
Syöte
4-digit PIN (0–9)
Tulos
10⁴ = 10,000 PINs
Without replacement: 10×9×8×7 = 5,040
Oletko valmis laskemaan? Kokeile ilmaista Permutations with Replacement-laskuria
Kokeile itse →