American Journal of Applied Mathematics and Statistics. 2014, 2(2), 60-65
DOI: 10.12691/AJAMS-2-2-2
Series Primes in Binary
P.M. Mazurkin1,
1Doctor of Engineering Science, Academician of RANS, member of EANS, Volga Region State Technological University, Russia
Pub. Date: February 21, 2014
Cite this paper
P.M. Mazurkin. Series Primes in Binary.
American Journal of Applied Mathematics and Statistics. 2014; 2(2):60-65. doi: 10.12691/AJAMS-2-2-2
Abstract
To prove the famous Riemann hypothesis, that the real part of the root is always exactly equal to 1/2, a series of 500 and the other prime numbers has been converted from decimal to binary number system. At the same time was a clear non-trivial zeros. Any prime number can be represented as quantized into binary digital signal. Quantization step to not dilute a number of prime numbers is 1. Number of levels (binary digits) depends on the power of the quantized number of primes. As a result, we get two types of zeros - the trivial and nontrivial. Capacity of a finite number of primes must be taken based on the completeness of block incidence matrix. Average statistical indicator is a binary number, and influencing variable - itself a prime number. The binary representation allows to visualize and geometric patterns in the full range of prime numbers.
Keywords
simple numbers, conversion, geometry, criteria
Copyright
This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit
http://creativecommons.org/licenses/by/4.0/
References
[1] | Gashkov S.B. Number systems and their applications. M. MCCME, 2004. 52. |
|
[2] | Signal. URL: http://ru.wikipedia.org/wiki/%D0%A1%D0%B8%D0%B3%D0%BD%D0%B0%D0%BB. |
|