The algorithm for the 2d2d different primes and Hardy-Littlewood conjecture

preprint2014arXivOpen access

Abstract

We give an estimation of the existence density for the 2d2d different primes by using a new and simple algorithm for getting the 2d2d different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers between the 2d2d different primes. We may conclude that there exist infinitely many 2d2d different primes including the twin primes in case of d=1d=1 because we can give the lower bounds of the existence density for the 2d2d different primes in this algorithm. We also discuss the Hardy-Littlewood conjecture and the Sophie Germain primes.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.