@MikeMiller Not linking, the definition of free (more precisely fixed point free) actions of groups on sets in Stöcker/Zieschang (Algebraische Topologie). Which is $\bigl(\forall g\in G\setminus\{1\}\bigr) \bigl(\forall x\in X\bigr)\bigl(gx \neq x\bigr)$.
Quick opinion: someone's (relatively easy) limit question led me to a separate question about convergence of a sequence that I don't know the answer to or even a reasonable approach to; my interest is purely curiosity, but I think it might be a curiosity to others too. Should I go ahead and ask the Q, or (since it's not related to an 'actual problem I currently face') should I just leave it in the back of my brain for now?
So, @Mike, "free = fixed point free". At least by that definition. And "fixed point free" is the more precise (genauer) term according to Stöcker and Zieschang.
(The question, for the record: what is the limiting and/or distribution behavior of the sequence $s_n=\dfrac{n^n}{n!}\bmod 1$? A quick dip into Alpha suggests that it's all over the place but might have some bias toward the endpoints of the interval)
Okay, did I do this correctly? An 8 character password contains 3 of one letter, 3 of another, 1 or another, and 1 of another letter (8 total, 4 unique). So it would be $26{8 \choose 3} + 25{8 \choose 3} + 24{8 \choose 1} + 23{8 \choose 1} = 3232$ ?
I was thinking to begin I had 3 of 8 positions that needed to be filled, and there are 26 letters to try. Then I have another 3 positions to fill, but now I only have 25 letters let, then 1 position to fill, but only 24 letters left, and so on.
So I get there are $26 \choose 4$ ways to pick four letters. And I understand that two are special because there are three of two of them, but I'm not understanding how $4 \choose 2$ encapsulates that part.
So there are $26 \choose 4$ ways to pick four letters, of those four, $4 \choose 2$ are special, and then you multiply that all by how many possibilities there are once you know what you have?