The “Vertical” Generalization of the Binary Goldbach’s Conjecture as Applied on “Iterative” Primes with (Recursive) Prime Indexes (i-primeths)This article proposes a synthesized classification of some Goldbach-like conjectures, including those which are “stronger” than the Binary Goldbach’s Conjecture (BGC) and launches a new generalization of BGC briefly called “the Vertical Binary Goldbach’s Conjecture” (VBGC), which is essentially a metaconjecture, as VBGC states an infinite number of conjectures stronger than BGC, which all apply on “iterative” primes with recursive prime indexes (i-primeths). |
Ce spun oamenii - Scrie o recenzie
Nu am găsit nicio recenzie în locurile obișnuite.
Termeni și expresii frecvente
3,n based A-GLC alias arithmetic progressions B-GLC based on GIPs bijection considered contain at least defining the recursive DISTINCT odd distinct positive integers elements GIPs eveninteger eveninteger n f a,b finite positive integer for(a formal proof formulated using ternary formulation of BGC formulation variant GKRC GLCs stronger Goldbach Conjecture Goldbach index-partitions Goldbach-like Conjecture GLC i-primeths pair i-primeths sets identical elements infinite number iteration order least one line least one pair least one triad limit 2m linearithmic matrix meta-conjecture meta-sequence nn(M nºs ntBGC obviously stronger odd integer OEIS pair of DISTINCT pair of finite positive integers pair predicted by fx prime indexes prime number Prime Number Theorem primeths self-similar stronger than BGC sub-variant Sun's Conjecture super-primes theorem triad of primes Twin Prime Conjecture Type A formulation Type B neutral values of f VBGC VBGC(a,b verified
Informații bibliografice
| Titlu | The “Vertical” Generalization of the Binary Goldbach’s Conjecture as Applied on “Iterative” Primes with (Recursive) Prime Indexes (i-primeths) |
| Autor | Andrei-Lucian Drăgoi |
| Editor | Infinite Study |
| Lungime | 32 pagini |
| Exportă citatul | BiBTeX EndNote RefMan |