The use of the invariant's properties in the primality test and prime search
J. Hernández-Toro
Abstract
Open-access reader
J. Hernández-Toro
Abstract
Open-access reader
The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown, indicating the advantages and disadvantages of these new algorithms. The information provided by these algorithms also gives additional information regarding the factorization of a compound number.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown, indicating the advantages and disadvantages of these new algorithms. The information provided by these algorithms also gives additional information regarding the factorization of a compound number.
Key concepts: Primality test, Prime (order theory), Factorization, Invariant (physics), Computer science, Mathematics, Test (biology), Arithmetic