SRL Archive - Mathematics

I'm heading forward with my ADFGVX decrypter.

Just a short question, since I'm not the greatest math genius.

I just need a formula that can calculate the amount of possible combinations of chars where no char appears twice:

For Example:

ab = 2
(ab,ba)
abc = 6
(abc,acb,cab,cba,bca,bac)

Anyone ? : D

~caused

Factorial(Length(Text))?

Edit: http://en.wikipedia.org/wiki/Factorial

From: Naum
Factorial(Length(Text))?

Edit: http://en.wikipedia.org/wiki/Factorial

Yup. That's the formula he's looking for.

Exactly! :) thanks.