Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Adleman, Leonard M.
1980.
On distinguishing prime numbers from composite numbers.
p.
387.
Pomerance, Carl
1981.
On the distribution of pseudoprimes.
Mathematics of Computation,
Vol. 37,
Issue. 156,
p.
587.
Erdős, Paul
and
Pomerance, Carl
1986.
On the number of false witnesses for a composite number.
Mathematics of Computation,
Vol. 46,
Issue. 173,
p.
259.
Ribenboim, Paulo
1988.
The Book of Prime Number Records.
p.
153.
Erdős, P.
Kiss, P.
and
Sárközy, A.
1988.
A lower bound for the counting function of Lucas pseudoprimes.
Mathematics of Computation,
Vol. 51,
Issue. 183,
p.
315.
Ribenboim, Paulo
1989.
The Book of Prime Number Records.
p.
153.
Guy, Richard K.
1994.
Unsolved Problems in Number Theory.
Vol. 1,
Issue. ,
p.
44.
Maurer, Ueli M.
1995.
Fast generation of prime numbers and secure public-key cryptographic parameters.
Journal of Cryptology,
Vol. 8,
Issue. 3,
p.
123.
Pomerance, Carl
and
Shparlinski, Igor E.
2002.
Algorithmic Number Theory.
Vol. 2369,
Issue. ,
p.
338.
Banks, William D.
Harcharras, Asma
and
Shparlinski, Igor E.
2004.
Smooth values of shifted primes in arithmetic progressions.
Michigan Mathematical Journal,
Vol. 52,
Issue. 3,
Guy, Richard K.
2004.
Unsolved Problems in Number Theory.
Vol. 1,
Issue. ,
p.
71.
Banks, W. D.
Luca, F.
Saidak, F.
and
StĂ;nicĂ, P.
2005.
Compositions with the euler and carmichael functions.
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg,
Vol. 75,
Issue. 1,
p.
215.
Banks, William D.
Ford, Kevin
Luca, Florian
Pappalardi, Francesco
and
Shparlinski, Igor E.
2005.
Values of the Euler Function in Various Sequences.
Monatshefte für Mathematik,
Vol. 146,
Issue. 1,
p.
1.
Contini, Scott
Croot, Ernie
and
Shparlinski, Igor
2006.
Complexity of inverting the Euler function.
Mathematics of Computation,
Vol. 75,
Issue. 254,
p.
983.
Banks, William D.
and
Shparlinski, Igor E.
2007.
On values taken by the largest prime factor of shifted primes.
Journal of the Australian Mathematical Society,
Vol. 82,
Issue. 1,
p.
133.
Lamzouri, Youness
2007.
Smooth Values of the Iterates of the Euler Phi-Function.
Canadian Journal of Mathematics,
Vol. 59,
Issue. 1,
p.
127.
Baker, Roger
2009.
Numbers in a given set with (or without) a large prime factor.
The Ramanujan Journal,
Vol. 20,
Issue. 3,
p.
275.
Bin Chen
2010.
A new equation involving the euler function.
p.
977.
Narkiewicz, Władysław
2012.
Rational Number Theory in the 20th Century.
p.
195.
Pollack, Paul
Pomerance, Carl
and
Treviño, Enrique
2013.
Sets of monotonicity for Euler’s totient function.
The Ramanujan Journal,
Vol. 30,
Issue. 3,
p.
379.