Results 11 to 20 of about 249 (52)
Fermat test with Gaussian base and Gaussian pseudoprimes [PDF]
, 2014 The structure of the group (Z/nZ). and Fermat’s little theorem are the basis for some of the best-known primality testing algorithms. Many related concepts arise: Euler’s totient function and Carmichael’s lambda function, Fermat pseudoprimes, Carmichael ...
Grau, José María +3 more
core +5 more sources
Kesetaraan Uji Pepin dan Lucas-lehmer [PDF]
, 2015 Pepin test provides a necessary and sufficient condition for a Fermat number to be a prime. Lucas-Lehmer test provides a necessary and sufficient condition for a Mersenne number to be a prime.
Gemawati, S. (Sri) +2 more
core
Artin's primitive root conjecture -a survey - [PDF]
, 2012 This is an expanded version of a write-up of a talk given in the fall of 2000 in Oberwolfach. A large part of it is intended to be understandable by non-number theorists with a mathematical background.
Moree, Pieter
core +2 more sources
Primality-testing Mersenne Numbers (II) [PDF]
, 1986 Reports the factor-filtering and primality-testing of Mersenne Numbers Mp for p < 100000, the latter using the ICL 'DAP' Distributed Array ...
Haworth, Guy McCrossan
core
Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II [PDF]
, 2011 We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials' $ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials .
Kwasniewski, Andrzej Krzysztof
core
Note on Integer Factoring Methods IV [PDF]
, 2006 This note continues the theoretical development of deterministic integer factorization algorithms based on systems of polynomials equations. The main result establishes a new deterministic time complexity bench mark in integer factorization.Comment: 20 ...
Carella, N. A.
core +3 more sources
Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
, 2014 It is shown that for any fixed $i>0$, the $\Sigma_{i+1}$-fragment of Presburger arithmetic, i.e., its restriction to $i+1$ quantifier alternations beginning with an existential quantifier, is complete for $\mathsf{\Sigma}^{\mathsf{EXP}}_{i}$, the $i$-th ...
Agrawal Manindra +7 more
core +1 more source
, 1987 These notes have been issued on a small scale in 1983 and 1987 and on request at other times. This issue follows two items of news. First, WaIter Colquitt and Luther Welsh found the 'missed' Mersenne prime M110503 and advanced the frontier of complete Mp-
Haworth, Guy McCrossan
core
Microcomputer Algorithms for Prime Number Testing [PDF]
, 1983 This paper gives a survey of different methods of prime number testing. Emphasis has been given to algorithms based upon Fermat\u27s Theorem: if p is an odd prime number, then p divides ap-a. All of the computer programs described in this paper have been
Barton, Susan Dale
core +1 more source
Fem matemàtiques treballant amb els nombres primers [PDF]
, 2009 L'estudi dels nombres primers ha apassionat a molts matemàtics, i no matemàtics, de tots els temps. Al llarg d'aquesta notes1, amb l'objectiu de contagiar-nos una mica d'aquest apassionament, ens anirem plantejant preguntes i cercant respostes sobre ...
Gimbert Quintilla, Joan
core +1 more source