## Proof of the Twin Prime Conjecture

**Authors:** Dieter Sengschmitt

I can proof that there are infinitely many twin primes. The twin prime counting function π2(n), which gives the number of twin primes less than or equal to n for any natural number n, is for
limn→∞ π2(n)= 2 C2 [π(n)]^2/n
where π(n) is the prime counting function and C2 is the so-called twin prime constant with C2=0,6601618…

**Comments:** 15 Pages.

**Download:** **PDF**

### Submission history

[v1] 2017-10-03 11:01:23

**Unique-IP document downloads:** 64 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.*

*
*