The Prime Seed Constant of the Pascal–Prime Pyramid

Read full text Summarise with VIRAT
Authors: Balint Kollath
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

We introduce a triangular array whose interior obeys the Pascal addition rule while sequential primes are placed along the right edge, with a "Pascal-First" allocation ensuring that primes arising naturally as interior sums are not duplicated on the boundary. We prove that the row sums satisfy an exact recursion S(n) = 2S(n−1) + ε(n), where ε(n) depends solely on boundary increments. Telescoping yields a convergent series for the normalised limit C = lim S(N)/2^{N−1} = 6.81539911…, whose terms decay as O(ln n / 2^n). We establish a Prime Desert Theorem confining interior primes to positions of polynomial growth, prove prime completeness, and characterise the cross-section as a perturbed Gaussian. A verification script is included.

Fields of Study & Subjects

Analytic Number Theory Research Advanced Combinatorial Mathematics Advanced Mathematical Theories and Applications

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
21 March 2026
Language
EN
Document type
Preprint