The algorithm for the $2d$ different primes and Hardy-Littlewood conjecture
Number Theory
2014-02-27 v1
Abstract
We give an estimation of the existence density for the different primes by using a new and simple algorithm for getting the different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers between the different primes. We may conclude that there exist infinitely many different primes including the twin primes in case of because we can give the lower bounds of the existence density for the different primes in this algorithm. We also discuss the Hardy-Littlewood conjecture and the Sophie Germain primes.
Cite
@article{arxiv.1402.6679,
title = {The algorithm for the $2d$ different primes and Hardy-Littlewood conjecture},
author = {Minoru Fujimoto and Kunihiko Uehara},
journal= {arXiv preprint arXiv:1402.6679},
year = {2014}
}
Comments
8 Pages