OFFSET
1,1
COMMENTS
If x -> x + x^k is a bijection from Z/pZ to Z/pZ then the following facts hold:
-v_2(k-1) >= v_2(p-1)
-gcd(k+1,p-1) = 2
-2^(k-1) = 1 (mod p).
The third fact is very important as it shows that for a given k there are a finite number of solutions p.
If p = 1 (mod 3) and 2^((p-1)/3) = 1 then either k = (p-1)/3+1 or k = 2*(p-1)/3+1 has the wanted property (see sequence A014752 for more information when this happens). It is a sufficient but not necessary condition since 3251 also appears in this sequence but 3 does not divide 3250.
LINKS
Elias Caeiro, Table of n, a(n) for n = 1...212
Problèmes du 9ème Tournoi Français des Jeunes Mathématiciennes et Mathématiciens, Problem 7 question 7, 2019 (in French).
EXAMPLE
For p = 31 and k = 21, x -> x + x^k is a bijection.
CROSSREFS
KEYWORD
nonn
AUTHOR
Elias Caeiro, Apr 16 2019
STATUS
approved