Turkish Journal of Mathematics and Computer Science

Yazarlar: Recep BAŞTAN, Canan AKIN

Konular:-

Anahtar Kelimeler:Prime number,Sophie Germain primes,Safe Primes

Özet:      An elementary method for eliminating $2m$-prime pairs is given by Lampret  [S. Lampret, Sieving $2m$-prime pairs, Notes on Number Theory and Discrete Mathematics Vol. 20, 2014, No.3, 54-46.], where m is an arbitrary positive integer. 2m-prime pairs are related the twin prime pairs since a $2m$-prime pair is a twin prime pair if $m=1$. Lampret gave a characterization for 6n-prime pairs of the form $(6k - 1, 6k + 6n - 1)$. In section 2, the Sophie Germain prime and connected safe prime pairs are referred to as $SG$-$S$-prime pairs in short. By using Lampret's results, we focus on a characterization to obtain SG-S-prime pairs owing to an eliminating method. Thus it is formed instructions for a sieve as an elementary method to find the $SG$-$S$-prime pairs. Moreover we give an example in which we use our instructions to obtain the SG-S-prime pairs up to $250$. 

---