If the only concern is file compression (ignoring the interesting math question), then a single bit/row meaning "this row is compressed using the PrimePowerConjecture" or "this row is not compressed" would collect most of the savings. Rich ---------- Quoting Joerg Arndt <arndt@jjj.de>:
* Joerg Arndt <arndt@jjj.de> [Nov 16. 2016 16:02]:
About "file gets too big": Is it true that every entry V[n] for n>=2 is of the form V[n] = V[j-pp]*pp with pp a prime power? If so, we could just store pp, making the file much smaller.
Nope, at least assuming that pp must be a divisor of n (wrong for n = 29 and many larger n).
It seem possible to replace every entry with a reference to some entry before it and the ratio both have (the ratios do seem always prime). This way the file produced is significantly smaller.
The (slight) drawback is that one must pick a (small) selection of values in the table, multiplying the ratios. The selection is just by following the references.
This could also give an interesting graph (tree).
Best regards, jj
[...]
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun