Quote:
Originally Posted by grobie
question, I keep reading taking n's to full range. What is the full range

qrobie, the full range for n means that you calculate all dodecaproths for a given n. Because we are interested only for positive primes in this search, it means that the largest k value for every n is 2^n, because for this k it will be the first case that one of the form of the eight: 2^nk=0.
So to complete the full range for n means that the [0,2^n] interval is examined for n. For example Kosmaj has completed 0T,200000T for n=60, but I hope I can complete the full range it means that I will do only [200000T,1152922T] interval for n=60, because 2^60=1152921504606846976>1152921T, so I've to choose 1152922T for upper bound.
Note that for every n you can choose also much larger values for kmax>2^n, because there is no error checking for this in the program, but the program is completely wrong for negative numbers because in the prp checking part I use prm, and not abs(prm), it means that this isn't a 3prp checking routine for negative numbers!