> 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