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.
nice job, well done tim
Most nonzero elements in row
Converting Decimal to Binary
Set some matrix elements to zero
Is My Wife Wrong?
Remove the Zero
Best Square-Shaped Grid for Subplot
Fill an array given a sum and array length values
Flip the right coin to survive!
Simulating the selection of a state with given probabilities
last n digit of a power function
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