MathDB
2017 Team #7: Diverse Pascal's triangle row modulo p

Source:

February 19, 2017
Pascal's Trianglenumber theory

Problem Statement

Let pp be a prime. A complete residue class modulo pp is a set containing at least one element equivalent to k(modp)k \pmod{p} for all kk. (a) Show that there exists an nn such that the nnth row of Pascal's triangle forms a complete residue class modulo pp. (b) Show that there exists an np2n \le p^2 such that the nnth row of Pascal's triangle forms a complete residue class modulo pp.