Skip to content

Fixed points for discrete logarithms

Citations of this article
Mendeley users who have this article in their library.
Get full text


We establish a conjecture of Brizolis that for every prime p>3 there is a primitive root g and an integer x in the interval [1,p-1] with log g x=x. Here, log g is the discrete logarithm function to the base g for the cyclic group (Z/pZ)×. Tools include a numerically explicit "smoothed" version of the Pólya-Vinogradov inequality for the sum of values of a Dirichlet character on an interval, a simple lower bound sieve, and an exhaustive search over small cases. © 2010 Springer-Verlag Berlin Heidelberg.




Levin, M., Pomerance, C., & Soundararajan, K. (2010). Fixed points for discrete logarithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6197 LNCS, pp. 6–15).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free