Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 508 papers for “Primality test”
massena misiec, Luis Felipe · Figshare · 2021
this text is in portuguese just so an important security leak within its practical use is kept under the nationality of the author first, it will later be translated in to english<br>
Cited by 0Open access
massena misiec, Luis Felipe · Figshare · 2021
this text is in portuguese just so an important security leak within its practical use is kept under the nationality of the author first, it will later be translated in to english<br>
Cited by 0Open access
Gabriele Martino · American Journal of Computational Mathematics · 2013
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.
Cited by 0Open access
massena misiec, Luis Felipe · Figshare · 2021
this text is in portuguese just so an important security leak within its practical use is kept under the nationality of the author first, it will later be translated in to english<br>
Cited by 0Open access
Anton Stiglic · 2025
Cited by 0
massena misiec, Luis Felipe · Figshare · 2021
this text is in portuguese just so an important security leak within its practical use is kept under the nationality of the author first, it will later be translated in to english<br>
Cited by 0Open access
massena misiec, Luis Felipe · Figshare · 2021
this text is in portuguese just so an important security leak within its practical use is kept under the nationality of the author first, it will later be translated in to english<br>
Cited by 0Open access
massena misiec, Luis Felipe · Figshare · 2024
In this paper it is given a third paper of a possible primality test that gives 99% certainty.<br>
Cited by 0Open access
massena misiec, Luis Felipe · Figshare · 2024
In this paper it is given a third paper of a possible primality test that gives 99% certainty.<br>
Cited by 0Open access
Dante Servi · Zenodo (CERN European Organization for Nuclear Research) · 2021
The test consists in comparing a number (p?) of which one wants to establish the primality or not, with a composite number (which I call (L)) which contains the majority of possible prime numbers; it does not recognize prime numbers but composite numbers.<br> This is obviously a test limited to the prime numbers present in (L).<br> In this review [v2] I highlight a further possibility that the test offers, it is a rough factoring that seems to me interesting for the speed of execution. Note: In version [v2] I wrote that (L) can be bigger than (p?); in the case in which (L) is greater than (p?) it does not always distinguish a number composed of a prime number and I obtain a fraction of the type 1 / n.
Cited by 0Open access
Anton Stiglic · 2025
Cited by 0
massena misiec, Luis Felipe · Figshare · 2023
Based on a chat gpt answer it is proposed a simple and effective primality test that works well for big numbers "n"
Cited by 0Open access
Dante Servi · Zenodo (CERN European Organization for Nuclear Research) · 2021
The test consists in comparing a number (p?) with a "primorial"; the test does not recognize prime numbers but composite numbers.<br> Note: in the article I wrote that the primorial must be smaller than the number to be tested, this is wrong; I will correct the article asap.
Cited by 0Open access
Anton Stiglic · 2006
Cited by 1
massena misiec, Luis Felipe · Figshare · 2023
Based on a chat gpt answer it is proposed a simple and effective primality test that works well for big numbers "n"
Cited by 0Open access
Sang-Un Lee, Myeong-Bok Choi · Journal of the Korea Society of Computer and Information · 2011
대표적인 소수판별법으로 밀러-라빈방법이 적용되고 있다. 밀러-라빈판별법은 m=[2, n-1]에서 m을 k개 선택하여 n-1=<TEX>$2^sd$</TEX>, <TEX>$0\;{\leq}\;r\;{\leq}\;s-1$</TEX> 에 대해 <TEX>$m^d\;{\equiv}\;1(mod\;n)$</TEX> 또는 <TEX>$m^{2^rd}\;{\equiv}\;-1(mod n)$</TEX>로 소수를 판별하여 <TEX>$k{\times}r$</TEX>회를 수행한다. 본 논문은 c=<TEX>$p^{\frac{n-1}{2}}(mod\;n)$</TEX>을 계산하여 c=-1이면 소수로 판별하여 k회 수행하였다. 제안된 판별법은 밀러-라빈 판별법의 <TEX>$k{\times}r$</TEX>회를 k회로 감소시켰다. Generally, Miller-Rabin method has been the most popular primality test. This method arbitrary selects m at k-times from m=[2, n-1] range and (m,n)=1. Miller-Rabin method performs <TEX>$k{\times}r$</TEX> times and reports prime as <TEX>$m^d\;{\equiv}\;1(mod\;n)$</TEX> or <TEX>$m^{2^rd}\;{\equiv}\;-1(mod n)$</TEX> such that n-1=<TEX>$2^sd$</TEX>, <TEX>$0\;{\leq}\;r\;{\leq}\;s-1$</TEX>. This paper suggests more simple primality test than Miller-Rabin method. This test method computes c=<TEX>$p^{\frac{n-1}{2}}(mod\;n)$</TEX> for k times and reports prime as c=-1. The proposed primality test method reduces <TEX>$k{\times}r$</TEX> times of Miller-Rabin method to k times.
Cited by 0Open access
Mathematisch Instituut · 1979
Cited by 0
Anton Štiglić · 2011
Cited by 0
Terzić, Predrag · 2020
Cited by 0Open access
massena misiec, Luis Felipe · Figshare · 2024
In this paper it is given a third paper of a possible primality test that gives 99% certainty.<br>
Cited by 0Open access