Formulas giving prime numbers under Cramér's conjecture

Details Formulas giving prime numbers under Cramér's conjecture Formulas giving prime numbers under Cramér's conjecture

2006-11-24

arxiv.org/abs/math/0611761v1

Mathematics

Number Theory

9 pages

Scientific paper

Under Cram\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$. Under the same conjecture, we also prove that for any $\epsilon>0$, there exists a positive real number $B$ for which the formula $[B.{n!}^{2+\epsilon}]$ gives a prime number for any sufficiently large positive integer $n$.

Affiliated with

Also associated with

No associations

Rating

Formulas giving prime numbers under Cramér's conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Formulas giving prime numbers under Cramér's conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formulas giving prime numbers under Cramér's conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540344