olymmath

HMMT 2017 T7

  • Team

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

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2017/t7 · Tag HTTDSSWR04 · Edit this page on GitHub · Keys: j next, k previous