Despite their name, locker "combination locks" are technically based on permutations, not combinations. This distinction is important in mathematics and impacts how we calculate the total possible outcomes for a lock.
Locker combination locks rely on permutations because the order of the numbers matters. For example, 1-2-3 is not the same as 3-2-1.
Is It Permutation or Combination for Password?
Passwords and locker combinations fall into the category of permutations when the order of inputs matters. If you input the numbers in the wrong order, the password or lock will not work.
Passwords are permutations when the order of characters matters, which is almost always the case in security contexts.
Key Differences:
-
Permutation:
The arrangement of items where order is significant. For example, the sequence 1-2-3 is different from 3-2-1. -
Combination:
The selection of items where order does not matter. For instance, selecting 1-2-3 is the same as selecting 3-2-1.
In the context of passwords and locks, the specific order of digits or characters is critical, making them permutations.
How Can You Tell If It’s a Permutation or Combination?
Determining whether a situation involves permutations or combinations depends on whether the order of items matters. In most security applications, like locks and passwords, the order is crucial.
It’s a permutation if the order of the elements affects the outcome. It’s a combination if the order does not matter.
Examples to Differentiate:
-
Permutations (Order Matters):
- A locker combination: 1-2-3 ≠ 3-2-1.
- A password: "ABC123" is not the same as "321CBA."
-
Combinations (Order Doesn’t Matter):
- Selecting 3 toppings for a pizza: Pepperoni, Mushrooms, and Onions = Onions, Mushrooms, and Pepperoni.
- Choosing 2 team members from a group: Alice and Bob = Bob and Alice.
In locks, permutations apply because the order of numbers is essential for unlocking.
How Many Combinations Does a Combination Lock Have?
The number of possible combinations for a lock depends on the total digits available and the number of positions on the lock. However, since order matters, these are permutations1, not combinations.
A typical combination lock with 3 digits (0-9) has 1,000 permutations, while a 4-digit lock2 has 10,000 permutations.
How to Calculate Permutations:
-
3-Digit Lock:
Each digit has 10 possibilities (0–9). With 3 positions:
( 10 \times 10 \times 10 = 1,000 ). -
4-Digit Lock:
Each digit still has 10 possibilities. With 4 positions:
( 10 \times 10 \times 10 \times 10 = 10,000 ).
Practical Implications:
- Security: More digits increase the number of possible permutations, making the lock harder to crack.
- Time to Brute Force: Testing every permutation of a 4-digit lock would take significantly longer than testing a 3-digit lock.
Locks with more digits or additional security features are better for protecting valuable items.
Conclusion
Locker combination locks are based on permutations because the order of the numbers matters when unlocking them. This principle distinguishes permutations from combinations, where order does not matter. Understanding this concept helps explain why locks with more digits offer better security, as they increase the total number of possible permutations. Whether calculating password complexity or the security of a lock, recognizing the role of permutations is essential.
