Formulas giving prime numbers under Cramér's conjecture (Q1016784)

From MaRDI portal
Revision as of 21:39, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Formulas giving prime numbers under Cramér's conjecture
scientific article

    Statements

    Formulas giving prime numbers under Cramér's conjecture (English)
    0 references
    0 references
    14 May 2009
    0 references
    In 1947 \textit{W. H. Mills} [Bull. Am. Math. Soc. 53, 604 (1947; Zbl 0033.16303)] proved the existence of an absolute constant \(A>1\) for which \([A^{3^n}]\) is prime for any positive integer \(n\). In a similar way, four years later, \textit{E. M. Wright} [Am. Math. Mon. 58, 616--618 (1951; Zbl 0044.03703)] demonstrated the existence of an absolute constant \(\alpha>0\) for which the infinite sequence \([\alpha],[2^\alpha],[2^{2^\alpha}],\dots,\) is composed entirely of primes. The proofs of both of these results rely on estimates for the gaps between primes. Mills' result uses Ingham's bound: for a given \(\varepsilon>0\) there is an \(x_0\) depending on \(\varepsilon\) such that for all \(x\geq x_0\) there is always a prime in the interval \([x,x^{5/8+\varepsilon}]\). Wright's result depends on Bertrand's postulate: for all positive integers \(n\) there is prime in the interval \([n,2n]\). Elaborating the ideas of Mills and Wright, the author points out that using a bound on the gaps between primes allows the construction of a function \(h\) (depending on the prime gap bound) such that between any two consecutive terms of the sequence \((h(n))_n\), there is at least one prime number, and consequently, setting \(f_n:=h\circ \cdots \circ h\) (where \(h\) is applied \(n\) times) allows one to deduce the existence of a real constant \(A>1\) for which the sequence \(([f_n(A)])_n\) consists entirely of prime numbers. In Mills' and Wright's examples the functions are \(h(x)=x^3\) and \(h(x)=2^x\), respectively. The main results of this paper, concern the generalization of this method by taking a sequence of (possibly different) functions \((h_m)_m\) and considering the composition \(f_n:=h_0\circ \cdots\circ h_{n-1}\). More specifically, setting \(h_n:=f_{n+1}\circ f_n^{-1}\) the author shows that if it is true that for any \(n\) and any \(x\) sufficiently large (relative to \(n\)) that the interval \([h_n(x),h_n(x+1)-1)\) contains a prime, then there exists a real number \(A\) for which the sequence \(([f_n(A)])_n\) consists entirely of prime numbers. The author gives a few examples of such sequences depending on a conjecture concerning gaps between consecutive primes. Some open questions are also given.
    0 references
    0 references
    prime-representing functions
    0 references
    prime gaps
    0 references
    Cramér's conjecture
    0 references

    Identifiers