>>123892Here is a proof that the pattern exists (though it doesn't disprove other potential patterns, I am not smart enough for that).
Find a number N that is divisible by X and that consists of d digits: y ones followed by z zeros such that y+z = d
We construct a second number A which is also divisible by X and is guaranteed to be a string of ones and zeros:
A=N*10^y + N
A is divisible by X because it is an integer multiple of N and N is divisible by X: as show by the rewritten equation A = N*(10^y + 1)
A is a string of ones followed by zeros because N*10^y has y ones followed by z zeroes (from N), followed by y more zeroes from 10^y, such that that A is y ones followed by y+z = d zeroes. N is d digits, so there is no overlap between the two parts of A.