MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn moreOpportunities for recent engineering grads.

Apply TodayFind 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.

12 correct solutions
5 incorrect solutions

Last solution submitted on Nov 23, 2014

1 player likes this solution

1 Comment