Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Revision history of "2020 CAMO Problems/Problem 2"

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur | prev) 13:16, 5 September 2020‎ Jbala (talk | contribs)‎ . . (372 bytes) (+372)‎ . . (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...")
Retrieved from "https://artofproblemsolving.com/wiki/index.php/2020_CAMO_Problems/Problem_2"