Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Compress storage space of primes?
Replies: 12   Last Post: Sep 14, 2013 11:58 PM

 Messages: [ Previous | Next ]
 Peter Percival Posts: 2,623 Registered: 10/25/10
Re: Compress storage space of primes?
Posted: Sep 13, 2013 12:34 PM

jonas.thornvall@gmail.com wrote:

> How could one easiest compress storage space of primes

Please sir, I know this one. Compress them down to this string:

The sequence of primes.

Since there are well-known algorithms for producing the primes one after
the other, you're done.

You can in fact compress the infinite sequence of all primes down to a
single letter, let's say X. Just keep in mind that X abbreviates the
string displayed above.

> If numbers ordered in digitspace we could find highest factor for
> each digit place, so Prime-1/GCD=pf and just store GCD
> pf1,pf2,pf3...
>
> That could save many digitplaces for big numbers?
>
> To recreate numbers GCD*pf1+1
>
>
>

--
Sorrow in all lands, and grievous omens.
Great anger in the dragon of the hills,
And silent now the earth's green oracles
That will not speak again of innocence.
David Sutton -- Geomancies

Date Subject Author
9/13/13 JT
9/13/13 JT
9/13/13 Peter Percival
9/13/13 JT
9/13/13 JT
9/14/13 Peter Percival
9/14/13 Victor Porton
9/14/13 JT
9/14/13 JT
9/14/13 JT
9/14/13 JT
9/14/13 JohnF
9/14/13 JT