> No, You've got a typo. But, be careful fixing it,
> it may eat up all your memory.
A typo from copying. The problem is that first the memory error occurs
and on second call it returns an empty error.
julia> genprimes(1841378967856, 1850000000000)
ERROR: MemoryError()
in primescopy at
/home/hwb/.julia/v0.3/PrimeSieve/src/primesieve_c.jl:40
in genprimes at /home/hwb/.julia/v0.3/PrimeSieve/src/primesieve_c.jl:60
julia> genprimes(1841378967856, 1850000000000)
0-element Array{Int64,1}
Well, I now see that you mention this in the "Bugs" section of the README
file.
>> > Also, I don't believe this result:
> I'm always for freedom of conscience!
Of course, it depends on the definition, for me [7, 11, 13, 17, 19, 23] is
the
prototype, and then the next 6-er tuples are:
[97,101,103,107,109,113]
[16057,16061,16063,16067,16069,16073]
[19417,19421,19423,19427,19429,19433]
[43777,43781,43783,43787,43789,43793]
[1091257,1091261,1091263,1091267,1091269,1091273]
[1615837,1615841,1615843,1615847,1615849,1615853]
[1954357,1954361,1954363,1954367,1954369,1954373]
and indeed there are none in the interval [100000, 200000].
I wonder what the library means with tuplets. Is that documented somewhere?
>> Octetts of prime numbers are very interesting, even in theory,
>> but function 'countprimes' does not allow to search for them:
> I didn't write the library, I just wrapped it.
> I suspect its a bit of work to go to 8.
Don't worry. I took an old script of mine that computed only the first
10-20
prime octetts (in R or Python) and converted it to Julia (utilizing Julia's
'isprime'). During this night it computed *all* prime octetts up to 10^12 ,
and there are hundreds of them, the last one being
[99452940701, 99452940703, 99452940707, 99452940709,
99452940731, 99452940733, 99452940737, 99452940739]
As you said, the 'isprime' function in Julia is really fast.
