Authors: Berndt Gensel
Every prime number $p geq 5$ has the form $6x-1$ or $6x+1$. We call $x$ the textbf{generator} of $p$. Twin primes are distinguished by a textbf{common generator} for each pair. Therefore it makes sense to search for the Twin Primes on the level of their generators. This paper presents a new approach to prove the textbf{Twin Prime Conjecture} by a method to extract all Twin Primes on the level of the Twin Prime Generators.We define the om{p_n}--numbers $x$ as numbers for that holds that $6x-1$ and $6x+1$ are coprime to the primes $5,7,ldots,p_n$. By dint of the average size $bd(p_n)$ of the om{p_n}--gaps we can prove the textbf{Twin Prime Conjecture}.
Comments: 16 Pages.
Download: PDF
[v1] 2023-01-19 16:05:22
[v2] 2023-01-20 17:01:11
[v3] 2023-03-04 17:00:35
[v4] 2024-12-07 16:28:21
[v5] 2025-02-10 16:34:09
Unique-IP document downloads: 605 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.