Question 131
Let $s(n)$ denote the sum of the digits (in base ten) of a positive integer $n$. Compute the number of positive integers $n$ at most $10^{4}$ that satisfy
$$
s(11 n)=2 s(n)
$$
$$
s(11 n)=2 s(n)
$$
Math Olympiad Vault · MathNet 2023-part-07 — 187 problems (EN–VI)