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.
remainder = 7
divisor = 12
then dividend = 1111 and the resulting sum is 4.
is there any particular mathematical theory regarding this?..i cant find my way for large numbers.
nice job, well done tim
Factorize THIS, buddy
How to add?
Vectorize the digits of an Integer
Duplicate each element of a vector.
Sum the real and imaginary parts of a complex number
Fill an array given a sum and array length values
Simulating the selection of a state with given probabilities
Flip the right coin to survive!
Sum of digit range
Best Square-Shaped Grid for Subplot
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office