Question 443316
Consider these sets:

0-9  has 10 digits
a-z has 26 letters
A-Z has 26 letters
{!,@,#,$,%,&,*,+} has 8 characters:
We have 70 characters in all:

If the number of characters is a fixed length {n characters}, there are {{{70^(n-1) * 8}}} possible characters.

Let's say you are given some maximum amount of characters.

Then the number of passwords is represented as {{{sum(70^(i-1)*8, i=1, n)}}}
===========
Now I'm thinking this might be too advanced for the level of problem.

Is is possible that you have left out information? Is there a maximum length or fixed length of the password?