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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Hisanobu Shinya
In this article, a relation between a gap $d_{k}$ and divisors of composite numbers between $p_{k}$ and $p_{k+1}$ is established.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
In this paper, we prove certain theorems about three consecutive primes.
Legendre's Conjecture is one of the most elegant open problems in Number Theory, which states that there is a prime between consecutive two perfect squares. In this note, we prove the conjecture holds true and also discuss the related results.
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.
An Elementary Approach For Sums Of Consecutive Cubes Being Prime Power Squares
本文提出一种初等方法,证明可表为连续整数立方和的完全平方数若为素数幂则无非平凡解,其解法主要依赖 $v_{p}(x)$ 和毕达哥拉斯三元数的一般形式。
The paper considers the asymptotic of the ratio of the number of primes not exceeding the primorial and the number of residues in the reduced system of residues for the given primorial. We study the relationship between asymptotic lower bounds for the values of the Jacobstal function and the maximum distance between successive primes. One algorithm for computing the Jacobstal function is given. The substantiation of the conjectures about the upper estimate of the maximum distance between successive prime numbers is given.
In a paper published by this author in www.academia.edu(see reference[3]), it was established that there exist no three positive integers which are consecutive terms of an arithmetic progression; and whose sum of squares is a perfect or integer square. In that paper, we made use of the 3-parameter formulas which describe the entire set of positive integer solutions of the 4-variable equation, $x^2+y^2+z^2= t^2$ (See reference [1]) In this work, we offer an alternative proof to the above result; a proof that uses only powers of 3 divisibility arguments. This is done in Theorem1, Section2. After…
The article focuses on the problems of prime gaps and zero spacings. Possible solutions of several related problems such as the greatest lower bound, the least upper bound of the zero spacings, and the least upper bound of the prime gaps are considered.
Least Consecutive Pair of Primitive Roots
研究了大素数p中最小连续原根对u和v^2及u+1的上界性质,采用数学分析方法证明其与x的大小关系。
We examine the prime gaps using a statistical approach. It is first shown that the Andrica's conjecture is true for half or more cases. Using the arguments of averages, it is further shown that Andrica's conjecture is true. We further obtain a precise bound for the Andrica's expression.
The Shannon entropy is used as a basis for applying different lemmas and conjectures concerning the set of gaps between prime numbers G_p , thus estimating several measures of it. The same procedures are applied to artificially created number sets, to compare the size of their entropy against G_p .
Expected biases in the distribution of consecutive primes
本文基于埃拉托斯特尼筛法各阶段的间隔种群演化,解释了Lemke Oliver和Soundararajan观察到的素数间隔模10分布偏差,指出该偏差源于小间隔的快速起步和剩余类分配不均,且最终是暂时的。
Let $p_{k}$ denote the $k$-th prime and $d(p_{k}) = p_{k} - p_{k - 1}$, the difference between consecutive primes. We denote by $N_ε(x)$ the number of primes $\leq x$ which satisfy the inequality $d(p_{k}) \leq (\log p_{k})^{2 + ε}$, where $ε> 0$ is arbitrary and fixed, and by $π(x)$ the number of primes less than or equal to $x$. In this paper, we first prove a theorem that $\lim_{x \to \infty} N_ε(x)/π(x) = 1$. A corollary to the proof of the theorem concerning gaps between consecutive squarefree numbers is stated.
Conjectures on Sums of Consecutive Primes
研究连续素数和的素数性,提出存在性和无限性猜想,并通过概率和模数分析支持这些猜想。
On the Maximal Gap between Primes
本文证明了对于足够大的素数,其与相邻素数的间距不超过$2\log^2{p_n}$,并由此推导出特定区间内存在素数。
Least Consecutive Pair of Quadratic Nonresidues
研究大素数域中最小连续二次非剩余对的上界,证明其不超过 O((log p)^2 (log log p)^3)。
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…
This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result shows that any short interval [x, x + y], y => C(log x)^(1+e), contains prime numbers for all sufficiently large real numbers x => x_0 unconditionally. An application demonstrates that a prime p => x > 2 can be determined in deterministic polynomial time O(log(x)^8).
The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea of our approach is summarized on the creation and on the analyzing sequence of sets of distinct co-primes with the first $n$ primes, $\left\{ p_i :\, i\leq n \right\}$, and the important properties of the modulus linear combination of the co-prime sets, $H=\left(1,p_{n+1},..., Π_{i=1}^n p_i-1\right) $, that gives sets of even numbers $\{0,2,4,..., Π_{i=1}^n…
Generation and Distribution of Prime Numbers Using a Modified Lagrange Polynomial
本文提出一种改进的拉格朗日多项式外推方法,并基于连续素数间的线性递推关系设计素数生成算法,用于从已知连续素数生成新的素数。
An information-theoretic upper bound on prime gaps
本文利用稀有事件建模中的水平集方法建立素数经验密度与源分布的关系,并据此给出素数间隙的信息论上界,从而处理克拉梅尔猜想,同时指出机器学习分析素数分布存在认知局限。
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。