caused
01-25-2010, 05:54 PM
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
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