TWIN PRIME CONJECTURE VIA TAHA'S PRIME DETECTOR AND SEQUENCE EXTENSION
Abstract This paper presents a formal construction addressing the Twin Prime Conjecture using an algorithmic testing framework termed Taha’s Detector of Prime Numbers alongside classical Eulerian principles for infinite primes. By examining arbitrary sequential prime products extended by structured even offsets, p₁p₂p₃...p_r + 2u, we define dynamic candidates for consecutive twin prime pairs. Wilson's factorial theorem is generalized via set non-belonging criteria over ℕ₊ to analytically verify the primality of the successor candidate p₁p₂p₃...p_r + 2(u+1). By demonstrating that any arbitrary pair (p, q) ∈ TP structurally yields a strictly greater twin prime pair (p_{r+1}, q_{r+1}) ∈ TP, we formally disprove the existence of a final bounded element within the set. A clean bijective infinity equivalence between the indexing bounds of ℕ₊ and the cardinality of TP is established, concluding that the set of twin primes is infinite.
Authors
- Taha Muhammad (ORCID: https://orcid.org/0000-0002-8954-9264)
Publication Details
- Published
- 2026-11-12
- DOI
- https://doi.org/10.33774/coe-2026-k59g5
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint