The Dividing Path

Number Theory Level 5

All the digits of the positive integer \(N\) are either \(0\) or \(1\). The remainder after dividing \(N\) by \(37\) is \(18\). What is the smallest number of times that the digit \(1\) can appear in \(N\)?

Details and Assumptions:

This problem is not original.

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, conceptual quizzes.

Our wiki is made for math and science

Master advanced concepts through explanations, examples, and problems from the community.

Used and loved by 4 million people

Learn from a vibrant community of students and enthusiasts, including olympiad champions, researchers, and professionals.