What is the smallest amount of bits you can write twin-prime calculation?
- by HH
A succinct example in Python, its source. Explanation about the syntactic sugar here.
s=p=1;exec"if s%p*s%~-~p:print`p`+','+`p+2`\ns*=p*p;p+=2\n"*999
The smallest amount of bits is defined by the smallest amount of 4pcs of things you can see with hexdump, it is not that precise measure but well-enough until an ambiguity.
$ echo 's=p=1;exec"if s%p*s%~-~p:print`p`+','+`p+2`\ns*=p*p;p+=2\n"*999' > .test
$ hexdump .test | wc
5 36 200
$ hexdump .test
0000000 3d73 3d70 3b31 7865 6365 6922 2066 2573
0000010 2a70 2573 2d7e 707e 703a 6972 746e 7060
0000020 2b60 2b2c 7060 322b 5c60 736e 3d2a 2a70
0000030 3b70 2b70 323d 6e5c 2a22 3939 0a39
000003e
so in this case it is 31 because the initial parts are removed.
