Residue classes free of values of Euler’s function (1999)

Cached

Download Links

by Kevin Ford , Sergei Konyagin , Carl Pomerance
Venue:In: Gy}ory K (ed) Proc Number Theory in Progress, pp 805–812. Berlin: W de Gruyter
Citations:6 - 1 self

Active Bibliography

4 COMMON VALUES OF THE ARITHMETIC FUNCTIONS φ AND σ – Kevin Ford, Florian Luca, Carl Pomerance
21 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
Divisibility, Smoothness and Cryptographic Applications – David Naccache, Igor E. Shparlinski - 2008
3 Lower bounds for the number of smooth values of a polynomial – Greg Martin - 1998
5 On values taken by the largest prime factor of shifted primes – William D. Banks, Igor E. Shparlinski
15 The distribution of totients – Kevin Ford - 1998
Residue Classes Having Tardy Totients – John B. Friedlander, Florian Luca - 2008
8 On the density of primes in arithmetic progression having a prescribed primitive root – Pieter Moree - 1999
ON THE STABILITY OF CERTAIN LUCAS SEQUENCES MODULO 2* – Walter Carlip, Eliot Jacobson - 1995
Modulus Period Distribution – Eliot Jacob Son - 1987
Algebraic Geometry over a field of positive characteristic – J.W.P. Hirschfeld, Luca Giuzzi
Algebraic curves and maximal arcs – Angela Aguglia, Luca Giuzzi, G. Korchmáros - 2008
7 Exceptional covers and bijections on rational points – Robert M. Guralnick, Thomas J. Tucker, Michael, E. Zieve
1 Smooth values of iterates of the Euler phi-function – Youness Lamzouri
LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO – Peter Müller, Michael, E. Zieve
ON THE SURJECTIVITY OF ENGEL WORDS ON PSL(2, q) – Tatiana Bandman, Shelly Garion, Fritz Grunewald
Article 13.8.8 On the Ratio of the Sum of Divisors and Euler’s Totient Function I – Kevin A. Broughan, Daniel Delbourgo
5 Smooth Orders and Cryptographic Applications – Carl Pomerance, Igor Shparlinski - 2002
1 On a combinatorial method for counting smooth numbers in sets of integers – Ernie Croot