Bouchaib Bahboui

Bouchaib Bahboui


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 October 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
BBBouchaib Bahboui
Bouchaib Bahboui
I announce the discovery of the Unified Prime Equation (UPE) [Bahbouhi Bouchaib1,2,3, 2025], a structural framework that provides a formal proof of Goldbach’s conjecture. The conjecture, first posed by Christian Goldbach in correspondence with Leonhard Euler in 1742, asserts that every even integer greater than two can be expressed as the sum of two primes. For nearly three centuries this simple claim has resisted proof, despite the development of the Prime Number Theorem and extensive advances in analytic number theory. The UPE closes this chapter of uncertainty: it guarantees that around any integer N there exists a prime within a symmetric bounded window of size proportional to (ln N)^2, and when centered on x = E/2 for an even E, the construction yields symmetric primes p and q with p + q = E. This unites the density of primes with the symmetry of Goldbach pairs into an unconditional proof. The story of this discovery is also a story of the discipline itself. From the infinitude of primes in Euclid’s Elements [Euclid, 300 BC], to Chebyshev’s early distributional results [Chebyshev, 1852], to the Prime Number Theorem proved by Hadamard [Hadamard, 1896] and de la Vallée Poussin [de la Vallée Poussin, 1896], the search for patterns in primes has been relentless. Hardy and Littlewood’s circle method [Hardy & Littlewood, 1923] offered heuristic densities for Goldbach pairs, while Vinogradov’s three-primes theorem [Vinogradov, 1937] and Chen’s work on prime plus semiprime [Chen, 1973] gave formidable partial results. More recently, Ramaré [Ramaré, 1995] established that every even integer is the sum of at most six primes. These developments narrowed the gap but stopped short of the decisive step. The decisive insight came from overlapping explicit bounds. Cramér’s probabilistic model [Cramér, 1936] and Dusart’s explicit inequalities [Dusart, 2010] predict that prime gaps grow no faster than about (ln N)^2. By synthesizing these results with a finite sieve and a ranking procedure, the UPE ensured that no admissible interval is empty of primes. Once applied symmetrically to even integers, the long-standing conjecture yielded. Thus Goldbach’s problem, one of the most celebrated in mathematics, is solved. The review that follows narrates this intellectual journey and situates the UPE as the culmination of centuries of effort, while also opening doors toward new questions related to prime gaps, Polignac’s conjecture, and the Riemann Hypothesis.

16 September 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
BBBouchaib Bahboui
Bouchaib Bahboui
The computational construction of Goldbach prime pairs becomes increasingly demanding when the prescribed even integer reaches several thousand decimal digits, because repeated primality testing of unsuccessful candidates can rapidly dominate the computational cost. This work introduces Bahbouhi.b.goldbach.2026, an adaptive multilevel algorithm designed to construct prime pairs p and q satisfying p + q = E for a prescribed very large even integer E. Instead of relying on a direct sequential search, the method organizes candidate selection into a hierarchy of increasingly expensive operations. It combines arithmetic classification modulo 6 and 12, admissible residue rails, destructive congruences, an r − 1 divisibility representation, deep modular sieving, survivor-resistance ranking, peripheral and central search branches, local candidate probes, anchor propagation, and an adaptive controller that redirects the search when a branch becomes unproductive. Probable-prime testing is therefore concentrated on candidates that survive the cheaper arithmetic layers. The algorithm was experimentally applied to prescribed even integers ranging from moderate sizes to more than 10,000 decimal digits. The largest externally verified representation retained in the reported experiments is E = 10^10068 + 28878, with p = 16481 and q = 10^10068 + 12397. The experiments illustrate the practical scalability of the multilevel approach while identifying the principal computational bottlenecks that emerge at extreme digit lengths. This work is computational and algorithmic and makes no claim of proving Goldbach's conjecture.

10 October 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
BBBouchaib Bahboui
Bouchaib Bahboui
The binary Goldbach conjecture asserts that every even integer E>2 is a sum of two primes. This paper does not claim an unconditional proof. It establishes an explicit reduction in which the proved part consists of: (i) exact destructive-congruence and collision identities; (ii) the separation of repeated-factor concentration from large-factor perfect dispersion; (iii) an exact Chen-Liouville prime/semiprime identity on Chen support; (iv) the unconditional Goldbach Space criterion; (v) the U2 quotient and destructor-renewal principles; (vi) the U2* identity D_-(E)=R_P(E)+R_{P3}(E)+R_{P5}(E)+... and the exact implication D_-(E)>U_odd>=3(E) => R_P(E)>0; and (vii) the bilateral symmetric sieve geometry, for which an odd prime r not dividing E removes exactly two deviation classes and contributes the local factor 1-2/r. The reduction leaves one explicit analytic lock. For E=2m and a nonnegative Rabbit/U2* weight W_E, one must obtain a local signed anti-saturation estimate for T_E(W)=sum_d W_E(d) lambda(m-d)lambda(m+d), with a quantitative margin strong enough to dominate the U2* contamination from complements with odd Omega at least 3. Mangerel's unconditional global anti-saturation theorem for the reflected Liouville convolution does not by itself imply this weighted polylogarithmic local estimate. Consequently the proof of Goldbach is complete within the framework conditional on this R3-local anti-saturation estimate together with the stated U2* contamination bound; those uniform estimates are not proved here. The contribution is therefore an explicit conditional reduction of binary Goldbach to a sharply formulated local signed inequality, together with exact structural lemmas identifying the only remaining analytic obstruction.

10 November 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
BBBouchaib Bahboui
Bouchaib Bahboui
This paper develops an exact counting framework for the strong Goldbach problem. For an even integer E≥6, let R(E) count odd primes p for which E−p is also prime. The K-correction identity R(E)=N(E)−D(E)+K(E) follows from an exact pointwise identity for the number of distinct small prime divisors of E−p. We develop the associated multiplicity histogram, factorial moments, finite inclusion–exclusion identities, and a weighted three-moment lower bound, while explicitly auditing the information these quantities do and do not provide. A second decomposition uses rough complementary integers: for E^(1/3)<z<√(E−3), every rough complement is prime or semiprime, giving the exact identity R(E)=S(E,z)−B(E,z)+C(E,z). A Liouville-sign identity supplies an equivalent signed formulation. We isolate the remaining analytic task as a uniform separation between rough prime survivors and semiprime contamination. The manuscript ends with a three-step conditional closure scheme: prove a positive lower bound for S, prove a strictly smaller upper bound for B (with the small-complement correction retained), and combine these estimates. The first two uniform estimates are not established here. Accordingly, this is a rigorous partial-results manuscript, not a proof of the strong Goldbach conjecture.

30 September 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
BBBouchaib Bahboui
Bouchaib Bahboui
The binary Goldbach conjecture states that every even integer greater than 2 is a sum of two primes. This paper studies the smallest prime component of such a representation. For an even integer E, Pmin(E) is defined as the smallest prime p for which E - p is also prime. BOUSSOLE-Pmin combines an ordered FIRST search with an empirical prediction of the likely boundary distance. A longitudinal reference series of 100 selected integers of the form 10^N + 2 was studied up to N = 4000. A separate frozen prediction was then tested on 2000 new integers of the form 10^N + c, using 20 values of N from 20 to 400 and 100 even offsets at each level. The predictive scale was D(E) = log(E) log log(E), with frozen levels 0.258D, 0.790D and 1.088D. Observed coverages were 51.5%, 79.4% and 85.4%. The independent median Pmin/D was 0.24893, close to the frozen median coefficient 0.258, while the upper tail was substantially heavier than predicted. The method therefore uses prediction as a search compass, not as a stopping rule. Finally, Pmin gives a direct reformulation of Goldbach: a future proof can target uniform positivity of the number of prime pairs with the smaller prime restricted to a controlled boundary window.

26 October 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
BBBouchaib Bahboui
Bouchaib Bahboui
This expanded review audits the centered prime-segment approach to binary Goldbach, modular destructive residues, pairwise gcd constraints, complete and cube-root sieves, Chinese remainder constructions, circle-method correlations, and the Chen–Liouville parity selector. Every elementary proposition is accompanied by a proof or an exact derivation; three long appendices provide symbol-only derivations. A CRT construction proves arbitrarily deep fixed peripheral deserts and a logarithmic lower-bound obstruction along an unbounded sequence in the extended-value least-summand convention. None of these statements resolves the universal non-coverage lemma L. We separate established literature, exact equivalences, computational observations, conditional implications, and open estimates, and give explicit success criteria for future attempts to overcome the parity barrier.