Formulas giving prime numbers under Cram\'er's conjecture

Abstract

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 [Anx] (where [] denotes the integer part) gives a prime number for any positive integer n. Under the same conjecture, we also prove that for any ε>0, there exists a positive real number B for which the formula [B.n!2+ε] gives a prime number for any sufficiently large positive integer n.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…