A 7-digit security passcode is to be formed using the digits and . How many distinct 7-digit passcodes can be formed such that neither the two s nor the two s are adjacent to each other?
- A540
- 660Cevap
- C780
- D900
- E1,020
Cevap
660 distinct passcodes can be formed.
To find the number of arrangements where neither identical pair is adjacent, we use complementary counting. First, compute total unrestricted arrangements of the digits , which is . Next, by treating as a single block, there are arrangements with adjacent s. Similarly, treating as a single block yields arrangements with adjacent s. Arrangements where both pairs are adjacent treat and as two single blocks alongside , giving arrangements. Applying Inclusion-Exclusion gives forbidden arrangements. Subtracting from the total gives .
Adım Adım Çözüm
Anahtar Kavram
Complementary Counting with Inclusion-Exclusion Principle on Permutations of Repeated Elements
Tahmini Süre:2m 0s