Gilbreath Equation, Gilbreath Polynomials, and Upper and Lower Bounds for Gilbreath Conjecture

Riccardo Gatti ()
Additional contact information
Riccardo Gatti: National Laboratory of Molecular Biology and Stem Cell Engineering, Istituto Nazionale di Biostrutture e Biosistemi (INBB) c/o Eldor Lab, Via di Corticella 183, 40128 Bologna, Italy

Mathematics, 2023, vol. 11, issue 18, 1-7

Abstract: Let S = s 1 , … , s n be a finite sequence of integers. Then, S is a Gilbreath sequence of length n , S ∈ G n , iff s 1 is even or odd and s 2 , … , s n are, respectively, odd or even and min K s 1 , … , s m ≤ s m + 1 ≤ max K s 1 , … , s m , ∀ m ∈ 1 , n . This, applied to the order sequence of prime number P , defines Gilbreath polynomials and two integer sequences, A347924 and A347925, which are used to prove that Gilbreath conjecture G C is implied by p n − 2 n − 1 ⩽ P n − 1 1 , where P n − 1 1 is the n − 1 -th Gilbreath polynomial at 1.

Keywords: Gilbreath conjecture; prime numbers; sequence of integer numbers; Gilbreath polynomials (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/18/4006/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/18/4006/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:18:p:4006-:d:1244394

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().