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
-
Back to basics 20 - singleton dimensions
279 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
267 Solvers
-
Implement a bubble sort technique and output the number of swaps required
404 Solvers
-
178 Solvers
-
105 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!
