2019 OIM Problems/Problem 1

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.

Page

Toolbox

Search

2019 OIM Problems/Problem 1

Problem

Solution

See also