benchmarks.wiki / Public workspace

Omni-MATH / 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⁴ that satisfy s(11n)=2s(n) · Discussion

Discussing 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⁴ that satisfy s(11n)=2s(n) · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.