|
1
|
Finding strong pseudoprimes to several bases. II,Math
– Zhenxiang Zhang, Min Tang
|
|
2
|
A one-parameter quadratic-base version of the Baillie–PSW probable prime test
– Zhenxiang Zhang
|
|
|
TWO KINDS OF STRONG PSEUDOPRIMES UP TO 10 36
– Zhenxiang Zhang
|
|
8
|
Nagaraj, Density of Carmichael numbers with three prime factors
– R. Balasubramanian, S. V. Nagaraj
|
|
1
|
ON THE EXISTENCE AND NON-EXISTENCE OF ELLIPTIC PSEUDOPRIMES
– Siguna Müller
|
|
3
|
Primality Testing Revisited
– J.H. Davenport
- 1992
|
|
|
Improved Bounds for Goldback Conjecture
– Yannick Saouter
|
|
|
MO419 – Probabilistic Algorithms – Flávio K. Miyazawa – IC/UNICAMP 2010 A survey on Probabilistic Algorithms to Primality Test
– Marcio Machado, Pereira Ra, Marco Alves, Ganhoto Ra
|
|
1
|
The Pseudosquares Prime Sieve
– Jonathan P. Sorenson
|
|
|
Primality testing
– Richard P. Brent
- 2003
|
|
3
|
Primality testing
– Richard P
- 1992
|
|
3
|
Some Primality Testing Algorithms
– R.G.E. Pinch
- 1993
|
|
|
Solving the generalized Pell equation x 2 − Dy 2 = N
– unknown authors
|
|
|
On p x − q y = c and related three term exponential Diophantine equations with prime bases short running title: Prime Base Exponential Diophantine Equations
– unknown authors
- 2011
|
|
5
|
Prime numbers: a computational perspective. Second Edition
– Richard Crandall, Carl Pomerance, Richard Crandall, Carl Pomerance
- 2005
|
|
|
Zeroing the Baseball Indicator and the Chirality of Triples
– Christopher S. Simons, Marcus Wright
- 2004
|
|
|
The Mathematica ® Journal Ordered and Unordered Factorizations of Integers
– Arnold Knopfmacher, Michael Mays
|
|
|
Algorithmic Number Theory MSRI Publications
– unknown authors
|
|
|
Algorithmic Number Theory MSRI Publications
– unknown authors
|