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

2019 OIM Problems/Problem 1

Revision as of 14:00, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == For each positive integer <math>n</math>, let <math>s(n)</math> be the sum of the squares of the digits of <math>n</math>. For example, <math>s(15) = 1^2 + 5^2 =...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

For each positive integer $n$, let $s(n)$ be the sum of the squares of the digits of $n$. For example, $s(15) = 1^2 + 5^2 = 26$. Find all integers $n \ge 1$ such that $s(n) = n$.

~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=2019_OIM_Problems/Problem_1&oldid=207355"