Mathematical Machine for Primality Testing of Numbers: An Advanced Research

Musha, Takaaki (2021) Mathematical Machine for Primality Testing of Numbers: An Advanced Research. In: Recent Advances in Mathematical Research and Computer Science Vol. 5. B P International, pp. 83-93. ISBN 978-93-5547-325-7

Full text not available from this repository.

Abstract

Like the optical prism to break white light up into its constituent spectral colors, the machine to show a prime as a single spectrum is proposed. From the theoretical analysis, it can be shown that the machine to recognize the prime number as a single spectrum can be realized by using the Fourier transform of the correlation function of Riemann zeta function. Moreover, this method can be used for a factorization of the integer composed of two primes. Integer factorization is the decomposition of a composite number into a product of smaller integers, for which there is not known efficient algorithm. From the theoretical analysis, we can see that prime factorization for the integer composed of two different primes can be conducted within a polynomial time.

Item Type: Book Section
Subjects: STM Academic > Mathematical Science
Depositing User: Unnamed user with email support@stmacademic.com
Date Deposited: 10 Jan 2024 04:29
Last Modified: 10 Jan 2024 04:29
URI: http://article.researchpromo.com/id/eprint/1462

Actions (login required)

View Item
View Item