brute forcing - numbers of passwords possible?

A software allows a user password of up to 62 characters, selected from a
set of 95 characters.

Is the total number of different passwords given by:

62^95

or by:

62^95 + 61^95 + 60^95 . . . + 3^95 + 2^95 + 1^92

And if it's the latter, is there an easier way to do it than the way I've
shown?

When talking about brute forcing such a password is it best to say "there
are X number of passwords possible", or "there are X possible passwords,
but you'd expect to break a password with brute force after Y tests"?

And what would Y be, about X/2?

Thanks in advance for help.
.

Relevant Pages

  • RE: AOL passwords / crypt() and online brute forcing
    ... The sad truth is that most of the passwords are less than 8 characters ... If the AOL users at least get to 8, ... AOL passwords / cryptand online brute forcing ... Take the tcp lag and application lag into account, and say you can pop 10 ...
    (Vuln-Dev)
  • password policies
    ... I am trying to implement several password policies on SuSe Linux ... - A user password must have a length of 8 characters ... All user passwords may not repeat more than 2 characters ... I also tried to specify passwd to use pam_cracklib.so (in ...
    (comp.os.linux.setup)
  • Re: runas.exe not accept non-ascii passwords
    ... > Some user password have non standard ascii characters. ... Open notepad and type some text containing the non-ASCII characters. ...
    (microsoft.public.win2000.cmdprompt.admin)
  • Re: runas.exe not accept non-ascii passwords
    ... > Some user password have non standard ascii characters. ... Open notepad and type some text containing the non-ASCII characters. ...
    (microsoft.public.windowsxp.security_admin)