Number Theory

    

An Elementary Proof of Green-Tao Theorem

Authors: Marko V. Jankovic

In this paper an elementary proof of Green-Tao theorem is going to be presented. The proof represents an extension of the proof of the Polignac's conjecture (or twin prime, or Sophie Germain primes conjecture). It will be shown that arithmetic progressions that consist of prime numbers and that are of the length k (k is natural number), could be obtained through k-stage recursive type sieve process, and that their number is infinite.

Comments: 15 Pages.

Download: PDF

Submission history

[v1] 2021-05-30 17:50:30

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

comments powered by Disqus