Ariens

6 ms·

1. 1.▲
   by Ariens 17y ago

   That only gives 1023 possibilities
2. 2.▲
   by Ariens 17y ago

   I knew the principle but I read the article as if set 1024 and set 512 where specific instances of the sets ence I was unable to derive the conclusion.
3. 3.▲
   by Ariens 17y ago

   Isn't it the opposite? there are more strings of length n than the number of string with length m < n. There are b^n strings of length n, but only (b^n - 1)/(b - 1) strings of length m < n, where b is the number of possible characte
4. 4.▲
   by Ariens 17y ago

   I did not understand how this proves that no single algorithm can compress all files. Why does he assume that the compression generates less files?