2020 CAMO Problems/Problem 2
Problem 2
Let 
be a positive integer, 
a prime, and 
an integer with 
. Prove that ![\[\binom{p^k}{pn}\equiv\binom{p^{k-1}}n\pmod{p^{2k+1}}.\]](http://latex.artofproblemsolving.com/c/7/9/c79b820229a5e0ac8bdd0cab9ce7f744ba6a8756.png)
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 2020 CAMO (Problems • Resources) | ||
| 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. 
