Share This Article:

Detecting a Regularity in the Generation and Utilization of Primes in the Multiplicative Number Theory

Full-Text HTML XML Download Download as PDF (Size:315KB) PP. 187-196
DOI: 10.4236/ns.2019.116019    277 Downloads   562 Views Citations
Author(s)

ABSTRACT

If Goldbach’s conjecture is true, then for each prime number p there is at least one pair of primes symmetric with respect to p and whose sum is 2p. In the multiplicative number theory, covering the positive integers with primes, during the prime factorization, may be viewed as being the outcome of a parallel system which functions properly if and only if Euler’s formula of the product of the reciprocals of the primes is true. An exact formula for the number of primes less than or equal to an arbitrary bound is given. This formula may be implemented using Wolfram’s computer package Mathematica.

Cite this paper

Guiasu, S. (2019) Detecting a Regularity in the Generation and Utilization of Primes in the Multiplicative Number Theory. Natural Science, 11, 187-196. doi: 10.4236/ns.2019.116019.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.