arXiv 2106.030712021-06-06math.GM

On the distribution of consecutive composite odd numbers and twin primes

Marc Wolf, FranÇOis Wolf, FranÇOis-Xavier Villemin

备注：: 16 pages
发表信息：: Fundamental Journal of Mathematics and Mathematical Sciences, Volume 11, Issue 1, 2019, Pages 1 to 24

英文摘要：

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which means there are few twin primes. Finally, we show how to find the possible congruences for these prime numbers.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

素数分布的线性性、合数的周期性、素数的混沌性、孪生素数的出现

Primes Distribution Linearity. Composite Numbers Cyclicity. Chaoticity of Primes. Twin Primes Occurrence

该研究提出素数分布的线性规律，证明所有素数位于96条半直线且满足对应线性关系，仅需1个线性方程和8个数即可判断合数，同时揭示自然数中合数出现的惊人周期性。

2024-10-09math.GM

An equivalent problem to the Twin Prime Conjecture

In this short paper we will show, via elementary arguments, the equivalence of the Twin Prime Conjecture to a problem which might be simpler to prove. Some conclusions are drawn, and it is shown that proving the Twin Prime Conjecture is equivalent to proving that there cannot be an infinite string of consecutive natural numbers satisfying some specified equations.

2011-05-21math.GM

The importance of finding the upper bounds for prime gaps in order to solve the twin primes conjecture and the Goldbach conjecture

ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a procedure for the determination of the upper bounds for prime gaps different from the most famous and known approaches. The proposed method analyzes the distribution of prime numbers using the set of relative numbers. Using negative numbers too, it becomes intuitive to understand that that the arrangement of 2P+1 consecutive numbers that goes -P to P, is the only a…

2020-02-17math.GM

On the Gaps between Two Consecutive Prime Numbers

In this article, a relation between a gap $d_{k}$ and divisors of composite numbers between $p_{k}$ and $p_{k+1}$ is established.

2011-09-11math.GM

The concrete theory of numbers : Problem of simplicity of Fermat number-twins

The problem of simplicity of Fermat number-twins $f_{n}^{\pm}=2^{2^n}\pm3$ is studied. The question for what $n$ numbers $f_{n}^{\pm}$ are composite is investigated. The factor-identities for numbers of a kind $x^2 \pm k $ are found.

2007-07-06math.GM

On Problems Related to Primes: Some Ideas

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their infinitude; establishment of a kind of similarity between natural numbers and numbers that appear in an arithmetic progression, similar formulae for primes and the so called generalized twin primes in an arithmetic progression and their infinitude; generalization of Bertrand postulate and a Bertrand like postulate for twin primes; some elementary implications of a si…

2015-11-23math.GM

更多相关论文收起更多论文

Matrix Online Characteristic Number and Its applications in Goldbach Conjecture,Polignac Conjecture,the Twin Prime Conjecture

This article consists of three chapters.In Chapter 1, it is determined by the consecutive odd numbers, and study to the intrinsic properties of a class of matrix sequence. Through the establishment of matrix online number concept, characteristics and the online number column use mathematical induction to prove the some properties of this kind of matrix on the number of online features (Theorem 1). Finally, it is given a trial to prove the Goldbach conjecture (Theorem 6). This is the author in the years to explore prime properties in the process of research and discovery, and believe that this …

2013-06-11math.GM

An Infinitude of Primes of the Form $b^2 + 1$

If b^2 + 1 is prime then b must be even, hence we examine the form 4u^2 + 1. Rather than study primes of this form we study composites where the main theorem of this paper establishes that if 4u^2 + 1 is composite, then u belongs to a set whose elements are those u such that u^2 + t^2 = n(n + 1), where t has a upper bound determined by the value of u. This connects the composites of the form 4u^2 + 1 with numbers expressible as the sum of two squares equal to the product of two consecutive integers. A result obtained by Gauss concerning the average number of representations of a number as the …

2010-07-26math.GM

Sifting Function Partition for the Goldbach Problem

All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the Goldbach problem can be solved under sifting out only some composite numbers. In fact, in order to prove the Goldbach conjecture, it is only necessary to show that there are prime numbers left in the residual integers after the initial sifting! This idea can be implemented by using one of the three methods called sifting function partition by integer sort, sif…

2008-01-05math.GM

On a Weakened Form of Polignac Conjecture

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$, there exist infinitely many primes $p$ and $q$ such that $p-q=2k$. Clearly, the weakened form of Polignac's conjecture implies that there exists an infinite sequence of positive integers $x_1,x_2,...,x_m,...$ such that $x_1 (2k+x_1),x_2 (2k+x_2),...,x_m (2k+x_m)...$ are pairwise relatively prime. In this note, we obtain a slightly stronger result than this nece…

2009-09-14math.GM