Martino, Gabriele (2013) Primality Test. American Journal of Computational Mathematics, 03 (01). pp. 59-60. ISSN 2161-1203
Text
AJCM_2013032811255391.pdf - Published Version
Download (55kB)
AJCM_2013032811255391.pdf - Published Version
Download (55kB)
Official URL: https://doi.org/10.4236/ajcm.2013.31009
Abstract
In this paper we will give an algorithm that in the worst case solve the question about the primality of a number in but that gives better result if the number is not prime (constant operation). Firstly, we will introduce an equation on which are based not prime numbers. With this equation it is possible to deduce the prime number that generates a not prime number and to establish an equation in which if exists a certain integer the number is not prime and therefore vice versa to deduce if it is prime.
Item Type: | Article |
---|---|
Subjects: | OA Digital Library > Mathematical Science |
Depositing User: | Unnamed user with email support@oadigitallib.org |
Date Deposited: | 19 Jun 2023 05:20 |
Last Modified: | 15 Oct 2024 10:13 |
URI: | http://library.thepustakas.com/id/eprint/1552 |