Path: csiph.com!usenet.pasdenom.info!news.etla.org!news.stack.nl!newsfeed.xs4all.nl!newsfeed4.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.130 X-Spam-Level: * X-Spam-Evidence: '*H*': 0.76; '*S*': 0.02; 'claimed': 0.09; 'subset': 0.09; 'cc:addr:python-list': 0.11; '*any*': 0.16; 'cc:name:python list': 0.16; 'prevent': 0.16; 'cc:addr:python.org': 0.22; 'cc:2**0': 0.24; 'header:In-Reply-To:1': 0.27; 'idea': 0.28; 'message-id:@mail.gmail.com': 0.30; 'subject:that': 0.31; 'could': 0.34; 'received:google.com': 0.35; 'sure': 0.39; 'how': 0.40; 'number,': 0.60; 'most': 0.60; 'numbers': 0.61; "you've": 0.63; 'to:addr:gmail.com': 0.65; 'prime': 0.74; 'technique.': 0.84; 'washington': 0.93 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :cc:content-type; bh=oI5j7BRr3RCtVmRo7izvqAGf+JHLfzD79v8save+cxs=; b=06rv5xcJ88O2q8Kb7Sl/ZI3QBPOq5pvx+qfZt6YfLPm/NF6XF81KKUh7TWmXU8XPtC gm98loSv2y5tOACdI+AD2iJDxWdg1sq8TY+8TbCKsKPrgpjCxXf1Dx+penqLfi3GMr+A jdKmYUGhwGDjIOnK/i5coILPOx9LeG7V7puBKk1mlfmHnYuJ3WFaNPrysBnSQmaO5m7R l/mm9xRDXm15AgoX1BV8GEEqa/yrrOCltZJP+eCSOMknsrEszuCH5rLT3cy0QfEB06OD JfGbiq27f89DXgDUmHStFZ4AjkLtRdnznVfMRwah/QPSRPM7COmNIPTg9OarwFiWQI+r 2yJQ== MIME-Version: 1.0 X-Received: by 10.180.102.97 with SMTP id fn1mr479943wib.32.1383878597293; Thu, 07 Nov 2013 18:43:17 -0800 (PST) In-Reply-To: References: <205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> <9d998707-a6e9-4911-a585-c2310e4a2b31@googlegroups.com> <9b62770c-7ca1-4a4d-81a5-bf7251bac957@googlegroups.com> <13c04f06-f1f2-4f67-b975-3cff28714641@googlegroups.com> Date: Thu, 7 Nov 2013 18:43:17 -0800 Subject: Re: Algorithm that makes maximum compression of completly diffused data. From: Mark Janssen To: Chris Angelico Content-Type: text/plain; charset=ISO-8859-1 Cc: Python List X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 14 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1383878604 news.xs4all.nl 15931 [2001:888:2000:d::a6]:40399 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:58739 >> 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