Solve the PigeonHole Password Problem

  • Thread starter Thread starter snaidu228
  • Start date Start date
Click For Summary
SUMMARY

The PigeonHole Password Problem involves calculating the total number of valid passwords formed from 4, 5, or 6 characters, using lowercase and uppercase vowels (a, e, i, o, u, y, A, E, I, O, U, Y) and specific digits (0, 3, 4, 7, 9). Each password must contain at least one digit. The solution requires counting combinations for different character lengths and digit placements, leading to a systematic approach of calculating total possibilities and subtracting those without digits. The correct methodology includes using the product and sum rules for combinatorial counting.

PREREQUISITES
  • Understanding of combinatorial principles, specifically product and sum rules
  • Familiarity with character sets and case sensitivity in password creation
  • Basic knowledge of counting techniques for distinct arrangements
  • Ability to perform calculations involving permutations and combinations
NEXT STEPS
  • Learn detailed combinatorial counting techniques for password generation
  • Study the application of the product and sum rules in complex scenarios
  • Explore methods for calculating permutations with restrictions
  • Investigate the impact of character set variations on password strength
USEFUL FOR

Students studying combinatorial mathematics, computer science professionals working on security algorithms, and anyone interested in understanding password complexity and generation techniques.

snaidu228
Messages
9
Reaction score
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


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.
 


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.
 

Similar threads

  • · Replies 37 ·
2
Replies
37
Views
5K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
13K
Replies
6
Views
10K
Replies
2
Views
2K
Replies
3
Views
3K