Show that for any positive integer , we can find a positive integer such that the decimal digits of are only 's and 's.
This is a first impresssion again (not that my last was too succesful) but wouldn't the brute force solution just take and let multiply the two and then reduce this to a linear algebra question on solving equations?