We classify, for every prime power and every , the permutation binomials over . Writing , such a binomial is a permutation if and only if , , and for some coprime to . This proves a conjecture of Masuda, Rubio, and Santiago: every permutation binomial of this form arises from for a suitable . We also determine the exact number of distinct permutation functions represented by this family. As a further consequence, we completely classify the broader family in the coprime-index case . The new ingredient in the main classification is the necessity argument: selected Hermite power sums are organized so that Lucas’ theorem turns their coefficients into digit conditions; a Farey-guided local argument then forces successive base- digits, and cyclic rotations yield the inverse congruence. In characteristic , a mod- lift to an auxiliary ring retains endpoint information lost modulo .

生成讲解博客的中文版本

生成AI智能校验的中文版本