Number Theory

    

A Proof of Sophie Germain Primes Conjecture

Authors: Marko V. Jankovic

In this paper a proof of the existence of an infinite number of Sophie Germain primes, is going to be presented. In order to do that, we analyze the basic formula for prime numbers and decide when this formula would produce a Sophie Germain prime, and when not. Originally very difficult problem (in observational space) has been transformed into a simpler one (in generative space) that can be solved. First, it has been shown which numbers cannot be used for generation of Sophie Germain primes. After that it is going to be shown that that number is smaller than the number of numbers that are used for generation of composite odd numbers. Since it is well known that exist infinite number of numbers that are used for generating the prime odds, it is easy to conclude that the number of numbers that can be used for generating Sophie Germain primes is infinite, too.

Comments: 8 Pages.

Download: PDF

Submission history

[v1] 2019-05-10 01:25:34
[v2] 2019-06-20 04:30:28
[v3] 2019-06-29 04:06:52
[v4] 2020-03-18 13:48:43

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