A simple polynomial for a simple transposition
Greg Martin
Abstract
In this note, we review some facts about polynomials representing functions modulo primes p. In addition we prove that the polynomial f(x) = xp-2 + xp-3 + ... + x3 + x2 + 2x + 1 represents the transposition (0 1) modulo p, that is, f(0) 1 (mod p), f(1) 0 (mod p), and f(a) a (mod p) for all 2 a p-1.
Create a lesson
Related papers
13 unknowns over quadratic integer rings and Lucas congruences
Geng-Rui Zhang
Complete characterization of a class of complete permutation quadrinomials over \(Fq2\)
Yanjun Li, Maosheng Xiong
Sets whose differences avoid a bracket quadratic
Khalid Younis
Matrix representations and arithmetic properties of jacobsthal numbers via binary 3x3 matrices
Wilson Arley Martinez, Samin Ingrith Ceron
Lower Bounds for Moments of L-functions
Sanoli Gun, Gaurav Kumar, Deep Thakur
D(N)-quadruples in upper-triangular 2×2 integer matrices
Andrej Dujella, Zrinka Franušić