English

Family of prime-representing constants: use of the ceiling function

General Mathematics 2022-12-06 v2

Abstract

The analysis of regularities and randomness in the distribution of prime numbers remains at the research frontiers for many generations of mathematicians from different groups and topical fields. In 2019 D. Fridman et al. (Am. Math. Mon. 2019, 126:1, 70-73) have suggested the constant f1=2.9200509773...f_1 = 2.9200509773... for generation of the complete sequence of primes with using of a recursive relation for fnf_n such that the floor function fn=pn\lfloor f_n \rfloor = p_n, where pnp_n is the nth prime. Here I present the family of constants hn(h1=1.2148208055...)h_n (h_1 = 1.2148208055...) such that the ceiling function hn=pn\lceil h_n \rceil = p_n. The proposed recursive relation hn=hn(hn1hn1+2)h_n=\lceil h_n \rceil(h_{n-1}-\lceil h_{n-1} \rceil+2) generates the sequence of all known prime numbers. I also show that constants hnh_n are irrational.

Keywords

Cite

@article{arxiv.2101.00094,
  title  = {Family of prime-representing constants: use of the ceiling function},
  author = {I. A. Weinstein},
  journal= {arXiv preprint arXiv:2101.00094},
  year   = {2022}
}

Comments

6 pages, 2 theorems, 1 table, 11 references