Prime Constellations of nᵏ − (n−1)ᵏ: Algebraic Obstructions, Bateman–Horn Verification, and the Non-Monotonicity of Maximum Constellation Lengths
Fuente:
Zenodo
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Recurso digital |
| Lingua: | inglese |
| Pubblicazione: |
Zenodo
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866901356405587968 |
|---|---|
| author | Chen, Ruqing |
| author_facet | Chen, Ruqing |
| contents | <p>We investigate the polynomial family Qₖ(n) = nᵏ − (n − 1)ᵏ for prime exponents k = 3, 5, 7, 11, 13, enumerating all prime values for n ≤ 10⁸ and searching for consecutive prime constellations up to n ≤ 2 × 10⁹.</p> <p>Main results:</p> <p>(1) The maximum constellation length L(k) is determined by the longest gap in the forbidden residue set modulo the smallest splitting prime p₀(k) ≡ 1 (mod k), yielding L(3) = 3, L(5) = 6, L(7) = 17, L(11) = 4, L(13) = 8. All five bounds are verified computationally with zero exceptions.</p> <p>(2) The Bateman–Horn conjecture is confirmed to 0.2% accuracy for polynomial degrees 4, 6, 10, and 12, with the Euler product C(k) converged to ≤ 0.03% precision over all primes p ≤ 10⁷.</p> <p>(3) L(k) is non-monotonic in k, controlled by the forbidden density ρ(k) = (k − 1)/p₀(k).</p> <p>(4) Residue locking: all 239 quadruplets for k = 11 are confined to exactly 2 of 23 residue classes modulo p₀ = 23.</p> <p>(5) A unique septuplet is found at n = 77,664,241 for k = 7, matching the Bateman–Horn prediction of 1.1 expected occurrences.</p> <p>Repository contents: LaTeX source and compiled PDF (14 pages, 6 figures, 20 references); computational scripts (segmented sieve, Bateman–Horn constant computation, algebraic verification, figure generation); summary data tables.</p> <p>MSC 2020: 11N32, 11N05, 11C08, 11Y35</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_18819849 |
| institution | Zenodo |
| language | eng |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Prime Constellations of nᵏ − (n−1)ᵏ: Algebraic Obstructions, Bateman–Horn Verification, and the Non-Monotonicity of Maximum Constellation Lengths Chen, Ruqing prime-producing polynomials Bateman–Horn conjecture prime constellations cyclotomic splitting computational number theory algebraic obstructions Mathematics Number Theory <p>We investigate the polynomial family Qₖ(n) = nᵏ − (n − 1)ᵏ for prime exponents k = 3, 5, 7, 11, 13, enumerating all prime values for n ≤ 10⁸ and searching for consecutive prime constellations up to n ≤ 2 × 10⁹.</p> <p>Main results:</p> <p>(1) The maximum constellation length L(k) is determined by the longest gap in the forbidden residue set modulo the smallest splitting prime p₀(k) ≡ 1 (mod k), yielding L(3) = 3, L(5) = 6, L(7) = 17, L(11) = 4, L(13) = 8. All five bounds are verified computationally with zero exceptions.</p> <p>(2) The Bateman–Horn conjecture is confirmed to 0.2% accuracy for polynomial degrees 4, 6, 10, and 12, with the Euler product C(k) converged to ≤ 0.03% precision over all primes p ≤ 10⁷.</p> <p>(3) L(k) is non-monotonic in k, controlled by the forbidden density ρ(k) = (k − 1)/p₀(k).</p> <p>(4) Residue locking: all 239 quadruplets for k = 11 are confined to exactly 2 of 23 residue classes modulo p₀ = 23.</p> <p>(5) A unique septuplet is found at n = 77,664,241 for k = 7, matching the Bateman–Horn prediction of 1.1 expected occurrences.</p> <p>Repository contents: LaTeX source and compiled PDF (14 pages, 6 figures, 20 references); computational scripts (segmented sieve, Bateman–Horn constant computation, algebraic verification, figure generation); summary data tables.</p> <p>MSC 2020: 11N32, 11N05, 11C08, 11Y35</p> |
| title | Prime Constellations of nᵏ − (n−1)ᵏ: Algebraic Obstructions, Bateman–Horn Verification, and the Non-Monotonicity of Maximum Constellation Lengths |
| topic | prime-producing polynomials Bateman–Horn conjecture prime constellations cyclotomic splitting computational number theory algebraic obstructions Mathematics Number Theory |
| url | https://doi.org/10.5281/zenodo.18819849 |