It is known that once you write the sequence 10101...101 long enough, the number will be finally divisible by any odd number if it is NOT a multiple of 5. Input an odd number(not divisible by 5), count how many 1's you need to write.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers14
Suggested Problems
-
931 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1335 Solvers
-
549 Solvers
-
Number of 1s in a binary string
11725 Solvers
-
70 Solvers
More from this Author12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!