A simple polynomial for a simple transposition

Simple item page
dc.creatorMartin, Greg
dc.date2006-03-02
dc.date.accessioned2026-07-07T07:06:27Z
dc.date.available2026-07-07T07:06:27Z
dc.descriptionIn this note, we review some facts about polynomials representing functions modulo primes p. In addition we prove that the polynomial f(x) = x^{p-2} + x^{p-3} + ... + x^3 + x^2 + 2x + 1 represents the transposition (0 1) modulo p, that is, f(0) \equiv 1 (mod p), f(1) \equiv 0 (mod p), and f(a) \equiv a (mod p) for all 2 \le a \le p-1.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/math/0603054
dc.identifierhttp://arxiv.org/abs/math/0603054
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/110034
dc.subjectNumber Theory
dc.subject11T06; 11A07
dc.titleA simple polynomial for a simple transposition
dc.typetext

Files

Collections

arXiv