Ramanujan Primes and Bertrand's Postulate

نویسنده

  • Jonathan Sondow
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ramanujan and Labos Primes, Their Generalizations, and Classifications of Primes

We study the parallel properties of the Ramanujan primes and a symmetric counterpart, the Labos primes. Further, we study all primes with these properties (generalized Ramanujan and Labos primes) and construct two kinds of sieves for them. Finally, we give a further natural generalization of these constructions and pose some conjectures and open problems.

متن کامل

Ramanujan Primes: Bounds, Runs, Twins, and Gaps

The nth Ramanujan prime is the smallest positive integer Rn such that if x ≥ Rn, then the interval ( 1 2x, x ] contains at least n primes. We sharpen Laishram’s theorem that Rn < p3n by proving that the maximum of Rn/p3n is R5/p15 = 41/47. We give statistics on the length of the longest run of Ramanujan primes among all primes p < 10n, for n ≤ 9. We prove that if an upper twin prime is Ramanuja...

متن کامل

Arithmetic in Metamath, Case Study: Bertrand's Postulate

Unlike some other formal systems, the proof system Metamath has no built-in concept of “decimal number” in the sense that arbitrary digit strings are not recognized by the system without prior definition. We present a system of theorems and definitions and an algorithm to apply these as basic operations to perform arithmetic calculations with a number of steps proportional to an arbitrary-preci...

متن کامل

Ramanujan's Proof of Bertrand's Postulate

We present Ramanujan’s proof of Bertrand’s postulate and in the process, eliminate his use of Stirling’s formula. The revised proof is elegant and elementary so as to be accessible to a wider audience.

متن کامل

Bertrand's postulate

Bertrand’s postulate is an early result on the distribution of prime numbers: For every positive integer n, there exists a prime number that lies strictly between n and 2n. The proof is ported from John Harrison’s formalisation in HOL Light [1]. It proceeds by first showing that the property is true for all n greater than or equal to 600 and then showing that it also holds for all n below 600 b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 116  شماره 

صفحات  -

تاریخ انتشار 2009