Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!newsfeed.xs4all.nl!newsfeed3.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail
Return-Path: <rosuav@gmail.com>
X-Original-To: python-list@python.org
Delivered-To: python-list@mail.python.org
X-Spam-Status: OK 0.094
X-Spam-Evidence: '*H*': 0.81; '*S*': 0.00; 'claimed': 0.09; 'subset': 0.09; '*any*': 0.16; 'from:addr:rosuav': 0.16; 'from:name:chris angelico': 0.16; 'janssen': 0.16; 'prevent': 0.16; 'wrote:': 0.18; '>>>': 0.22; 'header:In-Reply-To:1': 0.27; 'idea': 0.28; "doesn't": 0.30; 'message-id:@mail.gmail.com': 0.30; 'factor': 0.31; 'subject:that': 0.31; 'know.': 0.32; 'fri,': 0.33; 'could': 0.34; 'one,': 0.35; 'received:google.com': 0.35; 'there': 0.35; 'possible': 0.36; 'represent': 0.38; 'nov': 0.38; 'to:addr:python- list': 0.38; 'pm,': 0.38; 'sure': 0.39; 'to:addr:python.org': 0.39; 'how': 0.40; 'number,': 0.60; 'most': 0.60; 'numbers': 0.61; "you've": 0.63; 'prime': 0.74; 'technique.': 0.84; '2013': 0.98
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 :content-type; bh=28CjTDMwAUtYSi8gamGuJ/Blx2gzRQPc2BQk8HCm4qk=; b=Lc9dLBxoiYI9Ec3Hy7QCW5+6s82QIOz9gukDy7n5NuAD9W8oaSlyuWoUbrXl8ZvMp/ RBWh6LRS/WAZy908qr/eezzYj138Svc8uNsBhJ0JFvKlt8V8BDK8dk7SIM1q54DvV2oK xSub/vWE9QaAzPLQM0PwWFj+XF2w/Env3R3cgbX7dtMyJgJL8pjTaosO2LD83d/gn2CC jiAE/YFKLS3Rif55NE1wERQ1Byrs+YK0mKFuh7HIoKDptkLl3iGr3p4wsqsmL8itvfdy YWXGC7A41A+JSN8dwz7nutDkqVdq7tp74sogV/tfHSmMTagSgP7nK9hkDcK67d237nJF zrZA==
MIME-Version: 1.0
X-Received: by 10.66.2.234 with SMTP id 10mr13284246pax.39.1383879955430; Thu, 07 Nov 2013 19:05:55 -0800 (PST)
In-Reply-To: <CAMjeLr-YRCuUa5iQp175TMhAiaVxTcY6FAg7k3YqWGg9kky43g@mail.gmail.com>
References: <205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> <mailman.1835.1383162420.18130.python-list@python.org> <c73c8aa6-cac4-4f02-ae83-31cea167c172@googlegroups.com> <s9ra79dvvnd01rpuqg9hfh6bija8u2q49h@4ax.com> <9d998707-a6e9-4911-a585-c2310e4a2b31@googlegroups.com> <q7im799jqj9ap3jb94lnqka1m0hnn9bnpv@4ax.com> <CAMjeLr8jao50FSqM9pT=77in0nPNCOA8SQwHC_Jm50eiQYTs+g@mail.gmail.com> <mailman.2161.1383863216.18130.python-list@python.org> <9b62770c-7ca1-4a4d-81a5-bf7251bac957@googlegroups.com> <mailman.2171.1383877064.18130.python-list@python.org> <13c04f06-f1f2-4f67-b975-3cff28714641@googlegroups.com> <CAPTjJmpkHUQEXH8E0c8athUs8RNCEFuNVj8jDoi-zYm8+qKcnQ@mail.gmail.com> <CAMjeLr-YRCuUa5iQp175TMhAiaVxTcY6FAg7k3YqWGg9kky43g@mail.gmail.com>
Date: Fri, 8 Nov 2013 14:05:55 +1100
Subject: Re: Algorithm that makes maximum compression of completly diffused data.
From: Chris Angelico <rosuav@gmail.com>
To: python-list@python.org
Content-Type: text/plain; charset=ISO-8859-1
X-BeenThere: python-list@python.org
X-Mailman-Version: 2.1.15
Precedence: list
List-Id: General discussion list for the Python programming language <python-list.python.org>
List-Unsubscribe: <https://mail.python.org/mailman/options/python-list>, <mailto:python-list-request@python.org?subject=unsubscribe>
List-Archive: <http://mail.python.org/pipermail/python-list/>
List-Post: <mailto:python-list@python.org>
List-Help: <mailto:python-list-request@python.org?subject=help>
List-Subscribe: <https://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe>
Newsgroups: comp.lang.python
Message-ID: <mailman.2179.1383879958.18130.python-list@python.org>
Lines: 21
NNTP-Posting-Host: 2001:888:2000:d::a6
X-Trace: 1383879958 news.xs4all.nl 15875 [2001:888:2000:d::a6]:46304
X-Complaints-To: abuse@xs4all.nl
Xref: csiph.com comp.lang.python:58741

On Fri, Nov 8, 2013 at 1:43 PM, Mark Janssen <dreamingforward@gmail.com> wrote:
>>> 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.

Also an interesting theory.

1) How do you represent the prime factors?
2) How do you factor large numbers efficiently? Trust me, if you've
solved this one, there are a *LOT* of people who want to know. People
with money, like Visa.
3) Still doesn't deal with all possible numbers.

ChrisA