Solve the P6 Counting Problem: Unlock 10*365 Password Combinations

Click For Summary

Homework Help Overview

The discussion revolves around calculating the total number of valid password combinations for a 6-character password that must include at least one digit and can consist of digits and uppercase letters. The original poster attempts to derive the total combinations based on different configurations of where the digit can appear within the password.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • The original poster outlines a method for counting combinations by defining subcategories based on the position of digits within the password. Some participants question the potential for overcounting certain combinations, particularly those that may fit into multiple subcategories.

Discussion Status

The discussion is ongoing, with participants exploring different interpretations of the counting method and raising questions about the accuracy of the original poster's approach. There is a recognition of the complexity involved in ensuring that all valid combinations are counted without duplication.

Contextual Notes

Participants are considering the constraints of the problem, including the requirement for at least one digit and the total character options available for each position in the password. There is a focus on understanding how these constraints impact the counting process.

Miike012
Messages
1,009
Reaction score
0
Im trying to find all combinations of P6. Book solution in paint doc.

My solution: Please tell me where I am going wrong.

P6: Password of 6 characters
1. Each password must contain at least one digit,
2. Each character of password can be a digit or uppercase letter.

Let P61 be defined as follows. Ci is the ith character of P61, i = 1,...,6

Let C1 be a digit then the following characters can be a digit or uppercase letter.
C1 has 10 choices and Ci has 36 choices for i = 2,..,6.

Therefore the password defined by P61, which was defined by restricting C1 to be a digit, has a total of 10*365 choices.

I will do the same for P6i, i = 2,...6, where the ith character is a digit.

All passwords P6i i = 1,2,3,4,5,6 will look like the following:
Let D represent the character that is a digit and DL represent the character that is a digit or uppercase letter.

P61 P62 ... P66
1.D 1.DL 1.DL
2.DL 2.D 2.DL
3.DL 3.DL 3.DL
4.DL 4.DL 4.DL
5.DL 5.DL 5.DL
6.DL 6.DL 6.D


Hence you can see that there are 6 total different "sub catagories" of P6 and there must be 10*365 choices per sub catagoy.
Therefore total choices for P6
Ʃ(Number of choices for P6i) i = 1,...,6
= Ʃ(10*365) i = 1,...,6
= 6*10*365



What am I counting extra of?
 

Attachments

  • Count.jpg
    Count.jpg
    20.5 KB · Views: 474
Last edited:
Physics news on Phys.org
deleted
 
A password like 11XXXX will appear in group 1 and group 2.
 
How many passwords satisfy (2). How many of those do not satisfy (1)?
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 36 ·
2
Replies
36
Views
8K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 9 ·
Replies
9
Views
3K
Replies
6
Views
10K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K