论文标题
寻找主要差距的上限的重要性，以解决双子素的猜想和戈德巴赫的猜想
The importance of finding the upper bounds for prime gaps in order to solve the twin primes conjecture and the Goldbach conjecture
论文作者
论文摘要
抽象的。在本文中，我们提出了一种观点，该观点突出了为素数寻找上限的重要性，以解决双素素的猜想和戈德巴赫的猜想。为此，我们提出了一个程序，以确定与最著名和已知方法不同的主要差距的上限。所提出的方法使用一组相对数量分析了质数的分布。同样使用负数也是直观的，了解2p+1连续数的排列是-p到p，是唯一可以最大程度地减少具有基本d的绝对值相同的两个幂之间的距离，| d | <= p。这种安排被认为很重要，因为通过增加连续数字范围内质量数的幂数，可以假定它可以减少所考虑的素数之间的重叠。因此，通过减少这些重叠，我们假设获得一个排列，其中质数小于和等于p，它们的倍数占据了最大数量的位置，范围内2p+1个连续数字。如果能够证明这一结果，不仅意味着Legendre猜想的解决方案，而且还意味着双胞胎素数猜想和Goldbach猜想的迈出了一步。
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 arrangement that minimizes the distance between two powers having the same absolute value of the base D, with |D|<=P. This arrangement is considered important because by increasing the number of powers of the prime numbers within a range of consecutive numbers, it is presumed to decrease the overlap between the prime numbers considered. Consequently, by reducing these overlaps, we suppose to obtain an arrangement, in which the prime numbers less than and equal to P and their multiples occupy the greatest possible number of positions within a range of 2P+1 consecutive numbers. If this result could be demonstrated, would imply not only the resolution of the Legendre conjecture, but also a step forward in the resolution of the twin primes conjecture and the Goldbach conjecture.
