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 Solvers12
Suggested Problems
-
Project Euler: Problem 5, Smallest multiple
1658 Solvers
-
Back to basics 22 - Rotate a matrix
937 Solvers
-
261 Solvers
-
Sum the numbers on the main diagonal
616 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
420 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!
