BERTRAND POSTULATE FOR PRIMES IN ARITHMETICAL PROGRESSIONS

被引：9

作者：

MOREE, P

机构：

[1] Mathematical Institute, Leiden University, 2300 RA Leiden

来源：

COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1993年 / 26卷 / 05期

关键词：

ARITHMETICAL PROGRESSION; PRIME; INTERVAL;

D O I：

10.1016/0898-1221(93)90071-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Bertrand's Postulate is the theorem that the interval (x, 2x) contains at least one prime for x > 1. We prove, building on work of Erdos, analogues of this result, in which the interval is of the form (x, zx) and there are at least m primes = a(mod d) required to be contained in this interval, and where z, a and d have to satisfy some conditions. For the case m = 1 the results are worked out using a computer. They can be found in Table 1.

引用

页码：35 / 43

页数：9

共 23 条

[1] THE DISCRIMINATOR - A SIMPLE APPLICATION OF BERTRAND POSTULATE [J].