>> I am not sure if it is just stupidness or laziness that prevent you from >> seeing that 4^8=65536. > > I can see that 4^8 = 65536. Now how are you going to render 65537? You > claimed that you could render *any* number efficiently. What you've > proven is that a small subset of numbers can be rendered efficiently.
I think the idea would be to find the prime factorization for a given number, which has been proven to be available (and unique) for any and every number. Most numbers can compress given this technique. Prime numbers, of course, would not be compressed. -- MarkJ Tacoma, Washington -- https://mail.python.org/mailman/listinfo/python-list
