一个紧凑的素数分布规律

素数规律不能精确地描述,但可以用阈值的方式对素数规律进行描述。本文介绍了一个迄今最紧凑的素数分布定律:在连续奇素数序列中,假定p、q是2个临近的奇素数,pq,V(p)为奇素数p在奇素数序列中的位置号。除了2个变异奇数区间115,125]和1 329,1 359],在奇数区间3,q~2)内,连续奇合数个数不大于V(p)。该定律强于Legendre猜想、Oppermann猜想、Andrica猜想和伯特兰-切比雪夫定理。

A compact distribution law of prime numbers

Although the distribution of prime numbers can not be described accurately,the law of prime number distribution can be described by threshold values.In the article,the most compact prime distribution law is presented to cope with the problem.Let p,q be two serial ones among the odd prime number serial,p＜q;and notation V(p) represents the position number of the odd prime p in the serial.Except the two odd intervals of 115,125] and 1 329,1 359],the number of consecutive odd composite numbers is not greater than V(p) in the odd district 3,q2).The law is more powerful than the Legendre's,Oppermann's and Andrica's conjectures.The proposed law has been validated for the odd numbers as 32bit PC can stand.