During my recent wanderings, I faced a mathematical problem which had to be solved by a Java program. The problem is:
You are given a number n. Find the smallest number N, which is divided by n, with the condition that N should have only 0s and 1s.
You are given a number n. Find the smallest number N, which is divided by n, with the condition that N should have only 0s and 1s.