KthProg wrote:yeah but better than the results foshizzle got he was probably assuming between 1-16.
KthProg wrote:
what im talking about is that the formula you two used to calculate the permutations doesnt account for the fact that at minimum the characters are being taken "8 at a time". using a^b doesnt apply in that situation.
!1 -2
@2 -4
#3 -6
$4 -8
%5 -10
^6 -12
&7 -14
*8 -16
(9 -18
)0 -20
_- -22
+= -24
Qq -26
Ww -28
Er -30
Rr -32
Tt -34
Yy -36
Uu -38
Ii -40
Oo -42
Pp -44
{[ -46
}] -48
|\ -50
Aa -52
Ss -54
Dd -56
Ff -58
Gg -60
Hh -62
Jj -64
Kk -66
Ll -68
:; -70
"' -72
Zz -74
Xx -76
Cc -78
Vv -80
Bb -82
Nn -84
Mm -86
<, -88
>. -90
?/ -92
~` -94
1 length
---------- 2x Combinations
a b
2 length
---------- 4x Combinations
aa bb
ab ba
3 length
---------- 8x Combinations
aaa bbb
aab bba
aba bab
abb baa
4 length
---------- 16x Combinations
aaaa bbbb
aaab bbba
aabb bbaa
abbb baaa
aaba bbab
abaa babb
abab baba
abba baab
5 length
----------- 32x Combinations
aaaaa bbbbb
aaaab bbbba
aaabb bbbaa
aabbb bbaaa
abbbb baaaa
abaaa babbb
aabaa bbabb
aaaba bbbab
abbaa baabb
aabba bbaab
abbab baaba
ababb babaa
abbba baaab
ababa babab
abaab babba
aabab bbaba
KthProg wrote:I dont know where you are getting this formula but the formula for permutations involves factorials not powers
KthProg wrote:Now if you could somehow get ahold of a supercomputers processing power, you could in a reasonable amount of time save all combinations to a hard drive or if you're nuts find a way to store them on memory then iterate through the premade combinations with a regular pc or tower which might be practical, other than the pretense of getting ahold of a supercomputer lol
Users browsing this forum: No registered users and 0 guests