Solve the PigeonHole Password Problem

  • Thread starter snaidu228
  • Start date
Alternatively, apply the "inclusion-exclusion principle" to count the number of passwords that contain at least one digit.
  • #1
snaidu228
9
0
PigeonHole Help!

Homework Statement



A computer password is formed from 4, 5 or 6 characters. A character is either a lowercase or uppercase vowel: (a, e, i, o, u, y) or (A, E, I, O, U, Y) (passwords are case sensitive) or else it is a digit from the set {0, 3, 4, 7, 9}. Each password must contain at least one digit. How many passwords are possible?

Homework Equations



Product or sum rules

The Attempt at a Solution



12 letters, 5 digits

if 4: 3 letters and 1 digit.
So 3*12= 36 letters possibilities
1*5= 5 digit possibilities

36+5= 41 passwords




I'm not sure if this is how?
 
Physics news on Phys.org
  • #2


snaidu228 said:

Homework Statement



A computer password is formed from 4, 5 or 6 characters. A character is either a lowercase or uppercase vowel: (a, e, i, o, u, y) or (A, E, I, O, U, Y) (passwords are case sensitive) or else it is a digit from the set {0, 3, 4, 7, 9}. Each password must contain at least one digit. How many passwords are possible?

Homework Equations



Product or sum rules

The Attempt at a Solution



12 letters, 5 digits

if 4: 3 letters and 1 digit.
So 3*12= 36 letters possibilities
1*5= 5 digit possibilities

36+5= 41 passwords




I'm not sure if this is how?
This is definitely not how.

Count the numbers of 4-character, 5-character, and 6-character passwords separately. For 4-char passwords, look at separate cases for 1 digit, 2 digits, 3 digits, and 4 digits.
4-character pwds
1 digit + 3 characters: 5 * 12 * 12 * 12 = 8640 possible choices.
2 digits + 2 chars ...
3 digits + 1 char...
4 digits + 0 chars ...

5-character pwds
1 digit + 4 characters:
2 digits + 3 chars ...
3 digits + 2 chars ...
4 digits + 1 char ...
5 digits + 0 char ...

Do the same for 6-character passwords. Add up all the possibilities.
 
  • #3


Suggestion:
(1) Count all the passwords, ignoring the constraint that they must contain at least one digit.
(2) Then count all the passwords that do not contain any digits.
(3) Subtract (2) from (1) to find the number of passwords that contain at least one digit.
 

FAQ: Solve the PigeonHole Password Problem

1. What is the PigeonHole Password Problem?

The PigeonHole Password Problem is a mathematical problem that involves finding a password from a set of possible passwords. It is based on the principle that if there are more pigeons than pigeonholes, at least one pigeonhole will contain more than one pigeon.

2. How does the PigeonHole Password Problem relate to computer security?

The PigeonHole Password Problem is often used as a way to explain the concept of brute force attacks in computer security. It shows that if there are a limited number of possible passwords, it is possible for an attacker to guess the correct password by trying all possible combinations.

3. Can the PigeonHole Password Problem be solved?

The PigeonHole Password Problem can be solved using mathematical methods such as the pigeonhole principle or combinatorics. However, the time and resources required to solve it may not be feasible in practical situations.

4. How can the PigeonHole Password Problem be applied in real life?

The PigeonHole Password Problem can be applied in various fields such as computer security, cryptography, and data compression. It can also be used to explain and solve problems in other areas, such as scheduling and resource allocation.

5. Are there any limitations to the PigeonHole Password Problem?

One limitation of the PigeonHole Password Problem is that it assumes all possible passwords are equally likely to be chosen. In reality, people tend to choose passwords that are easier to remember, making some passwords more common than others. This can make the problem more complex and difficult to solve.

Back
Top