danceswithnumb...@gmail.com wrote:
I did that quite a while ago. 352,954 kb.
Are you sure? Does that include the size of all the code, lookup tables, etc. needed to decompress it? But even if you have, you haven't disproved the theorem about compressing random data. All you have is a program that compresses *that particular* sequence of a million digits. To disprove the theorem, you would need to exhibit an algorithm that can compress *any* sequence of a million digits to less than 415,241 bytes. -- Greg -- https://mail.python.org/mailman/listinfo/python-list
