Art of Problem Solving
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
During AMC 10A/12A testing, the AoPS Wiki is in read-only mode and no edits can be made.

2014 OIM Problems/Problem 1: Revision history

Diff selection: Mark the radio buttons 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.

14 December 2023

  • curprev 14:0714:07, 14 December 2023 Tomasdiaz talk contribs 392 bytes +392 Created page with "== Problem == For each positive integer <math>n</math>, define <math>s(n)</math> as the sum of the digits of <math>n</math>. Find the smallest positive integer <math>k</math>..."
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2014_OIM_Problems/Problem_1"