Solutions of equations over finite fields: enumeration via bijections
classification
🧮 math.NT
keywords
equationsfieldsfiniteproofsolutionsalternativeargumentavoided
read the original abstract
We present a simple proof of the well-known fact concerning the number of solutions of diagonal equations over finite fields. In a similar manner, we give an alternative proof of the recent result on generalizations of Carlitz equations. In both cases, the use of character sums is avoided by using an elementary combinatorial argument.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.