加载中…
For a nonnegative integer , and a prime in , we prove a result that provides a method for computing the number of integers with for which the Carlitz binomial coefficients fall into each of the residue classes modulo . Our main result can be viewed as a function field analogue of the Garfield-Wilf theorem.

生成讲解博客的中文版本

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