The original problem has a nice little solution in the lowest possible base, base 3: (Find the smallest positive integer x such that x_3 = [K]d and (2x)_3 = d[K] where d = 1 or 2, [K] is some number in base 3 (without leading 0's), and adjacency just means concatenation.) --Dan _____________________________________________________________________ "It don't mean a thing if it ain't got that certain je ne sais quoi." --Peter Schickele