Counting Fixed Points, Two-Cycles, and Collisions of the Discrete Exponential Function using p-adic Methods

Details Counting Fixed Points, Two-Cycles, and Collisions of the Discrete Exponential Function using p-adic Methods Counting Fixed Points, Two-Cycles, and Collisions of the Discrete Exponential Function using p-adic Methods

2011-05-26

arxiv.org/abs/1105.5346v1

Mathematics

Number Theory

14 pages, no figures

Scientific paper

Brizolis asked for which primes p greater than 3 does there exist a pair (g, h) such that h is a fixed point of the discrete exponential map with base g, or equivalently h is a fixed point of the discrete logarithm with base g. Zhang (1995) and Cobeli and Zaharescu (1999) answered with a "yes" for sufficiently large primes and gave estimates for the number of such pairs when g and h are primitive roots modulo p. In 2000, Campbell showed that the answer to Brizolis was "yes" for all primes. The first author has extended this question to questions about counting fixed points, two-cycles, and collisions of the discrete exponential map. In this paper, we use p-adic methods, primarily Hensel's lemma and p-adic interpolation, to count fixed points, two cycles, collisions, and solutions to related equations modulo powers of a prime p.

Affiliated with

Also associated with

No associations

Rating

Counting Fixed Points, Two-Cycles, and Collisions of the Discrete Exponential Function using p-adic Methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Fixed Points, Two-Cycles, and Collisions of the Discrete Exponential Function using p-adic Methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Fixed Points, Two-Cycles, and Collisions of the Discrete Exponential Function using p-adic Methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218274