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
Solution Comments
Show comments
Loading...
Problem Recent Solvers25
Suggested Problems
-
Determine if a Given Number is a Triangle Number
400 Solvers
-
Convert hex color specification to MATLAB RGB
259 Solvers
-
633 Solvers
-
10634 Solvers
-
Generate a string like abbcccddddeeeee
276 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!
is there any particular mathematical theory regarding this?..i cant find my way for large numbers.
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.