benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For each positive integer n, let s(n) be the sum of the squares of the digits of n. For example, s(15)=1²+5²=26. Determine all integers n≥1 such that s(n)=n.

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

For each positive integer nn, let s(n)s(n) be the sum of the squares of the digits of nn. For example, s(15)=12+52=26s(15)=1^2+5^2=26. Determine all integers n≥1n\geq 1 such that s(n)=ns(n)=n.
Plain-text mathematical notation (without MathML)
For each positive integer n, let s(n) be the sum of the squares of the digits of n. For example, s(15)=1²+5²=26. Determine all integers n≥1 such that s(n)=n.
Original LaTeX notation
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$. Determine all integers $n\geq 1$ such that $s(n)=n$.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
effc4467-b61b-51f3-a076-f1663878c6a2
task_key
test--effc4467-b61b-51f3-a076-f1663878c6a2
task_revision_id
1
config / split
/ test

Official source

initial import