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
-
1 Comment
Asif Newaz
on 13 Mar 2020
is there any particular mathematical theory regarding this?..i cant find my way for large numbers.
Solution Comments
Show commentsProblem Recent Solvers20
Suggested Problems
-
6880 Solvers
-
Reverse the Words (not letters) of a String
453 Solvers
-
Determine the number of odd integers in a vector
755 Solvers
-
812 Solvers
-
Append two matrix as shown below example
228 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!