Sieving for Large Cunningham Chains of Length 3 of the First Kind
نویسندگان
چکیده
In this paper we study the details of sieving for Cunningham chains of the first kind of length 3. To find such prime triplets larger than the ones already known, we have to investigate the primality of 2 numbers, each in the magnitude of 2 (more than 10 500 decimal digits). This would not be feasible if it weren’t for the sieving process which reduces the estimated time of completion to only a few weeks on a grid or a supercomputer with multiple cores.
منابع مشابه
The largest known Cunningham chain of length 3 of the first kind
Cunningham chains of length n of the first kind are n long sequences of prime numbers p1, p2, . . . , pn so that pi+1 = 2pi + 1 (for 1 ≤ i < n). In [3] we have devised a plan to find large Cunningham chains of the first kind of length 3 where the primes are of the form pi+1 = (h0 + cx) · 2 − 1 for some integer x with h0 = 5 775, c = 30 030 and e = 34 944. The project was executed on the non-uni...
متن کاملEvaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملInvestigation on the Capability of the Win Area Device in Automatic Granulation of Desert Pavement
Introduction: Pediments are vitally important geomorphological units. Desert pavement feature is used for their classification. The characteristics of desert pavements are a function of geomorphological conditions and have unique properties in terms of different granulation parameters. A variety of methods are employed to determine granulation. The most common method is the sieving test, in whi...
متن کاملOn Prime Chains
Let b be an odd integer such that b ≡ ±1 (mod 8) and let q be a prime with primitive root 2 such that q does not divide b. We show that if (pk) q−2 k=0 is a sequence of odd primes such that pk = 2pk−1 + b for all 1 ≤ k ≤ q − 2, then either (a) q divides p0 + b, (b) p0 = q or (c) p1 = q. For integers a, b with a ≥ 1, a sequence of primes (pk) λ−1 k=0 such that pk = apk−1+b for all 1 ≤ k ≤ λ − 1 ...
متن کاملPrime clusters and Cunningham chains
We discuss the methods and results of a search for certain types of prime clusters. In particular, we report specific examples of prime 16-tuplets and Cunningham chains of length 14.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013