Problem 2463. Sum of Dividend Digits
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.
Solution Stats
Problem Comments
-
2 Comments
Asif Newaz
on 13 Mar 2020
is there any particular mathematical theory regarding this?..i cant find my way for large numbers.
Asif Newaz
on 3 Jun 2025 at 9:39
Hint: For very large numbers made of many 1's, constructing the full number (like '1111111111...') and converting it using str2double will fail.
Instead, use modular arithmetic directly.
Solution Comments
Show commentsProblem Recent Solvers22
Suggested Problems
-
424 Solvers
-
Remove white space from the string
198 Solvers
-
Make a run-length companion vector
645 Solvers
-
Detect a number and replace with two NaN's
193 Solvers
-
153 Solvers
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!