Number Theory


Unknown Algorithms for Finding Prime Numbers Among Odd Numbers

Authors: Oleg Cherepanov

The discovered algorithm for extracting prime numbers from the natural series is alternative to both the Eratosthenes lattice and Sundaram and Atkin's sentences. The distribution of prime numbers does not have a formula, but if the number is one less than the prime number is an exponent of the integers, then there are no two scalar scalars whose sum is equal to the third integer in the same degree. This is the sound of P. Fermat's Great Theorem, the proof of which he could begin by using the Minor theorem known to him. The first part of the proof is here restored. But how did P. Fermat finish it?

Comments: 6 Pages.

Download: PDF

Submission history

[v1] 2017-05-28 03:10:36

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