| Byte | 0 | 1 | ||||||||||||||
| Bit | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| Value | 21 | 23 | 27 | 29 | 31 | 33 | 37 | 39 | 41 | 43 | 47 | 49 | 51 | 53 | 57 | 59 |
| Prime | F | T | F | T | T | F | T | F | T | T | T | F | F | T | F | T |
| Hex | 5A | E5 | ||||||||||||||
As primes become larger, the density of primes becomes smaller as 1/ln(n). Thus the density of true bits also falls off. The number of digits (binary or decimal) to represent the primes grows as ln(n). Thus, a sequence of primes represented as primec is always competitive in size with the corresponding sequence in ASCI text or binary, besides providing fast direct access by value:
bool isPrime(value).
The results for the sequence of the largest 64 bit primes (18446744073707000000 to 18446744073709551558) is:
| Format | Size (KB) |
| 64 Bit Binary | 445 |
| Txt | 1150 |
| Zip Txt | 114 |
| PrimeC | 125 |
Programs
Among the programs in the "program.zip" package are:
| BuildTxtPrime | Create file of primes, txt format |
| TxtToPrimeC | Convert txt to primec format. |
| Goldbach | Verify Goldbach's conjecture for zero to 1E12 |
Among the more than 15 classes and utilities are: