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 "2016 OIM Problems/Problem 6"

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) 14:04, 14 December 2023‎ Tomasdiaz (talk | contribs)‎ . . (488 bytes) (+488)‎ . . (Created page with "== Problem == Let <math>k</math> be a positive integer and <math>a_1, a_2, \cdots a_k</math> be digits. Prove that a positive integer <math>n</math> exists such that the last...")
Retrieved from "https://artofproblemsolving.com/wiki/index.php/2016_OIM_Problems/Problem_6"