Quote:
|
Originally Posted by Kosmaj
This is I think the place to look for HexadecaProths, around our exponent n=65 or 70.
|
Sieving for Hexadecaproth would be faster than my new Dodeca program.
Because it is also possible to sieve 16 forms at once!!!
I've calculated that the smallest n value for that there exist a Hexadecaproth is probably n=71 But in this case the smallest k value is also very large, say about 2^70, and it is much larger than 2^60=k max limit. So by this program you won't able to find a Hexadecaproth.