The distribution of the Carlitz binomial coefficients modulo a prime

Abstract

For a nonnegative integer n, and a prime in Fq[T], we prove a result that provides a method for computing the number of integers m with 0 m n for which the Carlitz binomial coefficients nmC fall into each of the residue classes modulo . Our main result can be viewed as a function field analogue of the Garfield-Wilf theorem.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…