Algorithm that makes maximum compression of completly diffused data.

rusi rustompmody at gmail.com
Fri Nov 8 16:57:53 CET 2013


On Friday, November 8, 2013 9:18:05 PM UTC+5:30, jonas.t... at gmail.com wrote:
> Den fredagen den 8:e november 2013 kl. 03:43:17 UTC+1 skrev zipher:
> > >> 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.


> 3^2-2^2=5

Oh my! What a profound insight!!



More information about the Python-list mailing list