Nonexistence of permutation binomials of certain shapes

Simple item page
dc.creatorMasuda, Ariane M.
dc.creatorZieve, Michael E.
dc.date2007-07-07
dc.date.accessioned2026-07-07T09:42:55Z
dc.date.available2026-07-07T09:42:55Z
dc.descriptionSuppose x^m + c*x^n is a permutation polynomial over GF(p), where p>5 is prime, m>n>0, and c is in GF(p)^*. We prove that gcd(m-n,p-1) is not 2 or 4. In the special case that either (p-1)/2 or (p-1)/4 is prime, this was conjectured in a recent paper by Masuda, Panario and Wang.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/0707.1102
dc.identifierhttp://arxiv.org/abs/0707.1102
dc.identifierElectronic J. Combinatorics 14 (2007), N12
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162366
dc.subjectNumber Theory
dc.subject11T06
dc.titleNonexistence of permutation binomials of certain shapes
dc.typetext

Files

Collections

arXiv