Related papers: Twin primes and the $3$-sphere
The twin primes conjecture is a very old problem. Tacitly it is supposed that the primes it deals with are finite. In the present paper we consider three problems that are not related to finite primes but deal with infinite integers. The…
We proved that there are infinitely many pairs of twin prime.
Twin prime number problem is mainly the structure of the twin prime numbers and whether there are infinitely many prime twins group. In this paper, by constructing a special cluster number set(see formula(2.3)in the paper), proves that the…
In this paper proof of the twin prime conjecture is going to be presented. Originally very difficult problem (in observational space) has been transformed into a simpler one (in generative space) that can be solved. It will be shown that…
In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins
By a sphere-packing argument, we show that there are infinitely many pairs of primes that are close to each other for some metrics on the integers. In particular, for any numeration basis $q$, we show that there are infinitely many pairs of…
While the twin prime conjecture is still famously open, it holds true in the setting of finite fields: There are infinitely many pairs of monic irreducible polynomials over $\mathbb{F}_q$ that differ by a fixed constant, for each $q \geq…
For earlier considered our sequence A166944 in [4] we prove three statements of its connection with twin primes. We also give a sufficient condition for the infinity of twin primes and pose several new conjectures; among them we propose a…
We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. ,…
This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…
The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…
This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…
Using the Rowland idea, we find two infinite sets of generators of primes. We also pose some conjectures concerning twin primes.
We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…
The Twin Prime conjecture states that there are infinitely many pairs of distinct primes which differ by $2$. Until recently this conjecture had seemed to be far out of reach with current techniques. However, in April 2013, Yitang Zhang…
We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…
Shiu proved that if a and q are arbitrary coprime integers, then there exist arbitrarily long strings of consecutive primes which are all congruent to a modulo q. We generalize Shiu's theorem to imaginary quadratic fields, where we prove…
In this paper, the estimation formula of the number of primes in a given interval is obtained by using the prime distribution property. For any prime pairs $p>5$ and $ q>5 $, construct a disjoint infinite set sequence $A_1, A_2, \ldots,…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…