Number Theory

   

Proof of Bunyakovsky's Conjecture

Authors: Robert Deloin

Bunyakovsky's conjecture states that under special conditions, polynomial integer functions of degree greater than one generate innitely many primes. The main contribution of this paper is to introduce a new approach that enables to prove Bunyakovsky's conjecture. The key idea of this new approach is that there exists a general method to solve this problem by using only arithmetic progressions and congruences. As consequences of Bunyakovsky's proven conjecture, three Landau's problems are resolved: the n^2+1 problem, the twin primes conjecture and the binary Goldbach conjecture. The method is also used to prove that there are infinitely many primorial and factorial primes.

Comments: 10 Pages. This is version 2 with important changes.

Download: PDF

Submission history

[v1] 2016-11-29 03:29:40
[v2] 2016-12-08 03:13:44

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