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
Project Euler: Problem 2, Sum of even Fibonacci
Construct a string from letters and counts
Area of a triangle
Simulating the selection of a state with given probabilities
Flip the right coin to survive!
Sum of digit range
last n digit of a power function
Fill an array given a sum and array length values
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