Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Give that a password can be 8-12 characters long and each character in the password can be ether composed of upper case letters, lower case letters, numeric digits, or one of the six special characters * < > ! + =

How many different password are available for this computer system? there are 5 cases for length of 8,9,10,11,and 12.

What I think: there are 68 different possibilities for each character slot there for for each length we aggregate up like below: Answer: 68^8 + 68^9 + 68^10 + 68^11 + 68^12

Is this correct?

Question 2: How many of these passwords contain at least one occurrence of at least one of the six special characters?

Dealing in cases again, I approached it by finding all the ways to construct the password (68^n. where n is for each case length 8,9,10,11,12) and subtracting all the ways to build a password without any special characters (62^n)

Add up all for each case to get answer.

so (68^8-62^8)+(68^9-62^9)+(68^10-62^10)+(68^11-62^11)+(68^12-62^12)

Is this correct?

share|cite|improve this question
Yes. Yes. ${}{}{}$ – dtldarek Dec 9 '12 at 23:05

To add a formal answer: I agree with @dtldarek, your argument is good for both questions.

share|cite|improve this answer
...this should be CW... – draks ... Sep 15 '13 at 21:01

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.