Find the smallest number that consist of only number 1's (e.g. 11111111111) which satisfy a given divisor and remainder. Then return the sum of its digits.

Example:

 remainder = 7
 divisor = 12

then dividend = 1111 and the resulting sum is 4.

Solve

Solution Stats

56 Solutions

25 Solvers

Last Solution submitted on May 28, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers25

Chris Cleveland George Berken Christian Schröder CXD

Suggested Problems

More from this Author6

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!