2020 CAMO Problems/Problem 2

Revision as of 14:16, 5 September 2020 by Jbala (talk | contribs) (Created page with "==Problem 2== Let <math>k</math> be a positive integer, <math>p>3</math> a prime, and <math>n</math> an integer with <math>0\le n\le p^{k-1}</math>. Prove that <cmath>\binom{p...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem 2

Let $k$ be a positive integer, $p>3$ a prime, and $n$ an integer with $0\le n\le p^{k-1}$. Prove that \[\binom{p^k}{pn}\equiv\binom{p^{k-1}}n\pmod{p^{2k+1}}.\]

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

2020 CAMO (ProblemsResources)
Preceded by
Problem 1
Followed by
Problem 3
1 2 3 4 5 6
All CAMO Problems and Solutions

The problems on this page are copyrighted by the MAC's Christmas Mathematics Competitions. AMC logo.png

Invalid username
Login to AoPS