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

2014 OIM Problems/Problem 1

Revision as of 15:07, 14 December 2023 by Tomasdiaz (talk | contribs) (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>...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

For each positive integer $n$, define $s(n)$ as the sum of the digits of $n$. Find the smallest positive integer $k$ such that

\[s(k) = s(2k) = s(3k) = \cdots = s(2013k) = s(2014k)\]

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

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

See also

OIM Problems and Solutions

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2014_OIM_Problems/Problem_1&oldid=207394"